java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec13_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:34:18,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:34:18,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:34:18,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:34:18,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:34:18,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:34:18,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:34:18,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:34:18,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:34:18,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:34:18,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:34:18,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:34:18,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:34:18,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:34:18,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:34:18,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:34:18,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:34:18,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:34:18,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:34:18,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:34:18,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:34:18,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:34:18,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:34:18,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:34:18,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:34:18,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:34:18,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:34:18,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:34:18,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:34:18,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:34:18,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:34:18,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:34:18,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:34:18,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:34:18,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:34:18,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:34:18,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:34:18,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:34:18,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:34:18,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:34:18,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:34:18,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:34:18,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:34:18,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:34:18,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:34:18,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:34:18,408 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:34:18,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:34:18,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:34:18,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:34:18,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:34:18,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:34:18,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:34:18,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:34:18,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:34:18,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:34:18,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:34:18,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:34:18,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:34:18,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:34:18,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:34:18,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:34:18,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:34:18,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:34:18,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:34:18,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:34:18,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:34:18,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:34:18,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:34:18,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:34:18,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:34:18,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:34:18,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:34:18,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:34:18,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:34:18,457 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:34:18,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec13_product30.cil.c [2019-09-08 03:34:18,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d087001cc/c0b461f570774366aa32f91f819a0ba4/FLAGadf9d12bb [2019-09-08 03:34:19,057 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:34:19,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec13_product30.cil.c [2019-09-08 03:34:19,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d087001cc/c0b461f570774366aa32f91f819a0ba4/FLAGadf9d12bb [2019-09-08 03:34:19,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d087001cc/c0b461f570774366aa32f91f819a0ba4 [2019-09-08 03:34:19,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:34:19,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:34:19,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:34:19,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:34:19,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:34:19,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:34:19" (1/1) ... [2019-09-08 03:34:19,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380bf43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:19, skipping insertion in model container [2019-09-08 03:34:19,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:34:19" (1/1) ... [2019-09-08 03:34:19,362 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:34:19,444 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:34:20,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:34:20,149 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:34:20,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:34:20,386 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:34:20,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20 WrapperNode [2019-09-08 03:34:20,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:34:20,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:34:20,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:34:20,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:34:20,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... [2019-09-08 03:34:20,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... [2019-09-08 03:34:20,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... [2019-09-08 03:34:20,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... [2019-09-08 03:34:20,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... [2019-09-08 03:34:20,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... [2019-09-08 03:34:20,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... [2019-09-08 03:34:20,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:34:20,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:34:20,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:34:20,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:34:20,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:34:20,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:34:20,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:34:20,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:34:20,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:34:20,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:34:20,713 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:34:20,713 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:34:20,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:34:20,714 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:34:20,714 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:34:20,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:34:20,715 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:34:20,716 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:34:20,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:34:20,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__1 [2019-09-08 03:34:20,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__2 [2019-09-08 03:34:20,720 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:34:20,720 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:34:20,721 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:34:20,721 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:34:20,721 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:34:20,722 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:34:20,723 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:34:20,723 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:34:20,723 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:34:20,723 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:34:20,723 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:34:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:34:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:34:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:34:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:34:20,725 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:34:20,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:34:20,725 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:34:20,725 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:34:20,726 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:34:20,726 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:34:20,726 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:34:20,726 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:34:20,726 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:34:20,726 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:34:20,727 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:34:20,727 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:34:20,727 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:34:20,727 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:34:20,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:34:20,728 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:34:20,728 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:34:20,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:34:20,728 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:34:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:34:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:34:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:34:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:34:20,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:34:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:34:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:34:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:34:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:34:20,730 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:34:20,731 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-09-08 03:34:20,731 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:34:20,731 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-09-08 03:34:20,731 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:34:20,731 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:34:20,731 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:34:20,732 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:34:20,732 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:34:20,732 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:34:20,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:34:20,733 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:34:20,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:34:20,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:34:20,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:34:20,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:34:20,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:34:20,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:34:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:34:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:34:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:34:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:34:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:34:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:34:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:34:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:34:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:34:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:34:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:34:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:34:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:34:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:34:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:34:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__1 [2019-09-08 03:34:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:34:20,742 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__2 [2019-09-08 03:34:20,742 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:34:20,742 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:34:20,742 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:34:20,743 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:34:20,743 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:34:20,743 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:34:20,743 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:34:20,744 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:34:20,744 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:34:20,744 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:34:20,744 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:34:20,745 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:34:20,745 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:34:20,745 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:34:20,745 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:34:20,746 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:34:20,746 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:34:20,746 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:34:20,746 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:34:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:34:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:34:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:34:20,748 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:34:20,748 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:34:20,748 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:34:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:34:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:34:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:34:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:34:20,750 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:34:20,750 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:34:20,750 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:34:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:34:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:34:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:34:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:34:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:34:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:34:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:34:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:34:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:34:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:34:20,753 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:34:20,753 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:34:20,754 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:34:20,757 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:34:20,758 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:34:20,758 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:34:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:34:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:34:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:34:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-09-08 03:34:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-09-08 03:34:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:34:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:34:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:34:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:34:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:34:20,769 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:34:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:34:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:34:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:34:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:34:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:34:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:34:20,770 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:34:20,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:34:22,902 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:34:22,903 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:34:22,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:34:22 BoogieIcfgContainer [2019-09-08 03:34:22,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:34:22,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:34:22,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:34:22,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:34:22,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:34:19" (1/3) ... [2019-09-08 03:34:22,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168ae2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:34:22, skipping insertion in model container [2019-09-08 03:34:22,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:34:20" (2/3) ... [2019-09-08 03:34:22,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168ae2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:34:22, skipping insertion in model container [2019-09-08 03:34:22,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:34:22" (3/3) ... [2019-09-08 03:34:22,911 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product30.cil.c [2019-09-08 03:34:22,920 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:34:22,929 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:34:22,944 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:34:22,980 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:34:22,980 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:34:22,981 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:34:22,981 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:34:22,981 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:34:22,981 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:34:22,981 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:34:22,981 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:34:22,981 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:34:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states. [2019-09-08 03:34:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 03:34:23,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:23,034 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:23,039 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1657439968, now seen corresponding path program 1 times [2019-09-08 03:34:23,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:23,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 03:34:23,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:23,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:23,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:24,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 2878 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:34:24,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:34:24,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:24,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:34:24,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:34:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:34:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:34:24,230 INFO L87 Difference]: Start difference. First operand 823 states. Second operand 9 states. [2019-09-08 03:34:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:24,580 INFO L93 Difference]: Finished difference Result 1342 states and 2168 transitions. [2019-09-08 03:34:24,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:34:24,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 03:34:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:24,620 INFO L225 Difference]: With dead ends: 1342 [2019-09-08 03:34:24,620 INFO L226 Difference]: Without dead ends: 674 [2019-09-08 03:34:24,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-08 03:34:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-09-08 03:34:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-08 03:34:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1065 transitions. [2019-09-08 03:34:24,780 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1065 transitions. Word has length 113 [2019-09-08 03:34:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:24,780 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 1065 transitions. [2019-09-08 03:34:24,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:34:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1065 transitions. [2019-09-08 03:34:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 03:34:24,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:24,804 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:24,805 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:24,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:24,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1328074300, now seen corresponding path program 1 times [2019-09-08 03:34:24,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:24,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:24,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:24,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:24,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:34:25,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:25,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:34:25,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:25,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 2880 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:34:25,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:34:25,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:25,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 03:34:25,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:34:25,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:34:25,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:34:25,675 INFO L87 Difference]: Start difference. First operand 674 states and 1065 transitions. Second operand 12 states. [2019-09-08 03:34:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:25,883 INFO L93 Difference]: Finished difference Result 1329 states and 2115 transitions. [2019-09-08 03:34:25,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:34:25,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2019-09-08 03:34:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:25,892 INFO L225 Difference]: With dead ends: 1329 [2019-09-08 03:34:25,892 INFO L226 Difference]: Without dead ends: 683 [2019-09-08 03:34:25,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:34:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-08 03:34:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2019-09-08 03:34:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-09-08 03:34:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1077 transitions. [2019-09-08 03:34:25,957 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1077 transitions. Word has length 115 [2019-09-08 03:34:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:25,959 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 1077 transitions. [2019-09-08 03:34:25,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:34:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1077 transitions. [2019-09-08 03:34:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 03:34:25,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:25,969 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:25,969 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1848619236, now seen corresponding path program 1 times [2019-09-08 03:34:25,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 03:34:26,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:26,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:34:26,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:26,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 2881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:34:26,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:34:26,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:26,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:34:26,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:34:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:34:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:34:26,580 INFO L87 Difference]: Start difference. First operand 681 states and 1077 transitions. Second operand 6 states. [2019-09-08 03:34:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:26,715 INFO L93 Difference]: Finished difference Result 1341 states and 2135 transitions. [2019-09-08 03:34:26,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:34:26,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-09-08 03:34:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:26,724 INFO L225 Difference]: With dead ends: 1341 [2019-09-08 03:34:26,724 INFO L226 Difference]: Without dead ends: 682 [2019-09-08 03:34:26,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:34:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-08 03:34:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-09-08 03:34:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-08 03:34:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1073 transitions. [2019-09-08 03:34:26,760 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1073 transitions. Word has length 116 [2019-09-08 03:34:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:26,761 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1073 transitions. [2019-09-08 03:34:26,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:34:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1073 transitions. [2019-09-08 03:34:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 03:34:26,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:26,767 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:26,767 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash 330287968, now seen corresponding path program 1 times [2019-09-08 03:34:26,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:26,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:26,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:34:26,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:26,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:26,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:27,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 2882 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:34:27,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:34:27,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:27,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 03:34:27,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:34:27,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:34:27,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:34:27,429 INFO L87 Difference]: Start difference. First operand 682 states and 1073 transitions. Second operand 12 states. [2019-09-08 03:34:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:27,659 INFO L93 Difference]: Finished difference Result 1334 states and 2117 transitions. [2019-09-08 03:34:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:34:27,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2019-09-08 03:34:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:27,665 INFO L225 Difference]: With dead ends: 1334 [2019-09-08 03:34:27,665 INFO L226 Difference]: Without dead ends: 685 [2019-09-08 03:34:27,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:34:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-08 03:34:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2019-09-08 03:34:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-08 03:34:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1073 transitions. [2019-09-08 03:34:27,697 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1073 transitions. Word has length 117 [2019-09-08 03:34:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:27,697 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1073 transitions. [2019-09-08 03:34:27,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:34:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1073 transitions. [2019-09-08 03:34:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 03:34:27,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:27,701 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:27,701 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:27,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1164080996, now seen corresponding path program 1 times [2019-09-08 03:34:27,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:27,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:27,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:27,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:27,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:34:27,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:27,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:27,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:28,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 2883 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:34:28,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:34:28,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:28,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 03:34:28,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:34:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:34:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:34:28,336 INFO L87 Difference]: Start difference. First operand 682 states and 1073 transitions. Second operand 12 states. [2019-09-08 03:34:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:28,520 INFO L93 Difference]: Finished difference Result 1334 states and 2117 transitions. [2019-09-08 03:34:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:34:28,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-08 03:34:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:28,531 INFO L225 Difference]: With dead ends: 1334 [2019-09-08 03:34:28,531 INFO L226 Difference]: Without dead ends: 685 [2019-09-08 03:34:28,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:34:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-08 03:34:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2019-09-08 03:34:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-08 03:34:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1073 transitions. [2019-09-08 03:34:28,568 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1073 transitions. Word has length 118 [2019-09-08 03:34:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:28,571 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1073 transitions. [2019-09-08 03:34:28,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:34:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1073 transitions. [2019-09-08 03:34:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 03:34:28,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:28,576 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:28,577 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:28,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1086570939, now seen corresponding path program 1 times [2019-09-08 03:34:28,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:28,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:34:28,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:28,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:34:28,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:29,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 2880 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:34:29,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:34:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:34:29,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:34:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:34:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:34:29,293 INFO L87 Difference]: Start difference. First operand 682 states and 1073 transitions. Second operand 14 states. [2019-09-08 03:34:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:29,626 INFO L93 Difference]: Finished difference Result 1347 states and 2141 transitions. [2019-09-08 03:34:29,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:34:29,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 119 [2019-09-08 03:34:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:29,633 INFO L225 Difference]: With dead ends: 1347 [2019-09-08 03:34:29,633 INFO L226 Difference]: Without dead ends: 698 [2019-09-08 03:34:29,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:34:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-08 03:34:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 691. [2019-09-08 03:34:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-08 03:34:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1089 transitions. [2019-09-08 03:34:29,666 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1089 transitions. Word has length 119 [2019-09-08 03:34:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:29,667 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1089 transitions. [2019-09-08 03:34:29,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:34:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1089 transitions. [2019-09-08 03:34:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 03:34:29,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:29,671 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:29,671 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:29,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1177080636, now seen corresponding path program 1 times [2019-09-08 03:34:29,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:29,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:29,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:34:29,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:29,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:34:29,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:30,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 2885 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:34:30,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:34:30,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:34:30,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:34:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:34:30,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:34:30,314 INFO L87 Difference]: Start difference. First operand 691 states and 1089 transitions. Second operand 9 states. [2019-09-08 03:34:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:30,646 INFO L93 Difference]: Finished difference Result 1367 states and 2181 transitions. [2019-09-08 03:34:30,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:34:30,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 03:34:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:30,654 INFO L225 Difference]: With dead ends: 1367 [2019-09-08 03:34:30,655 INFO L226 Difference]: Without dead ends: 709 [2019-09-08 03:34:30,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-08 03:34:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 706. [2019-09-08 03:34:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 03:34:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1110 transitions. [2019-09-08 03:34:30,690 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1110 transitions. Word has length 120 [2019-09-08 03:34:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:30,690 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 1110 transitions. [2019-09-08 03:34:30,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:34:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1110 transitions. [2019-09-08 03:34:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 03:34:30,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:30,693 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:30,694 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -694506182, now seen corresponding path program 1 times [2019-09-08 03:34:30,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:30,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:30,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:34:30,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:30,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:34:30,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:31,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 2887 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:34:31,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:34:31,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:31,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 03:34:31,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:34:31,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:34:31,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:34:31,324 INFO L87 Difference]: Start difference. First operand 706 states and 1110 transitions. Second operand 8 states. [2019-09-08 03:34:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:31,455 INFO L93 Difference]: Finished difference Result 1397 states and 2225 transitions. [2019-09-08 03:34:31,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:34:31,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-09-08 03:34:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:31,461 INFO L225 Difference]: With dead ends: 1397 [2019-09-08 03:34:31,461 INFO L226 Difference]: Without dead ends: 722 [2019-09-08 03:34:31,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-08 03:34:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 714. [2019-09-08 03:34:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-08 03:34:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1124 transitions. [2019-09-08 03:34:31,494 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1124 transitions. Word has length 122 [2019-09-08 03:34:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:31,495 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 1124 transitions. [2019-09-08 03:34:31,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:34:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1124 transitions. [2019-09-08 03:34:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 03:34:31,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:31,497 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:31,498 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:31,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:31,498 INFO L82 PathProgramCache]: Analyzing trace with hash 292958225, now seen corresponding path program 1 times [2019-09-08 03:34:31,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:31,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:31,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:31,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:34:31,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:31,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:32,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 2888 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:34:32,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:34:32,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:32,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 03:34:32,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:34:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:34:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:34:32,066 INFO L87 Difference]: Start difference. First operand 714 states and 1124 transitions. Second operand 8 states. [2019-09-08 03:34:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:32,187 INFO L93 Difference]: Finished difference Result 1409 states and 2246 transitions. [2019-09-08 03:34:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:34:32,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-09-08 03:34:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:32,193 INFO L225 Difference]: With dead ends: 1409 [2019-09-08 03:34:32,194 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 03:34:32,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 03:34:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 718. [2019-09-08 03:34:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-09-08 03:34:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1132 transitions. [2019-09-08 03:34:32,223 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1132 transitions. Word has length 123 [2019-09-08 03:34:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:32,223 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 1132 transitions. [2019-09-08 03:34:32,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:34:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1132 transitions. [2019-09-08 03:34:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 03:34:32,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:32,226 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:32,227 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1440183135, now seen corresponding path program 1 times [2019-09-08 03:34:32,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:32,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:32,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:32,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:32,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:34:32,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:32,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:34:32,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:34:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:34:32,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:34:32,361 INFO L87 Difference]: Start difference. First operand 718 states and 1132 transitions. Second operand 9 states. [2019-09-08 03:34:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:32,628 INFO L93 Difference]: Finished difference Result 1351 states and 2129 transitions. [2019-09-08 03:34:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:34:32,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 03:34:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:32,635 INFO L225 Difference]: With dead ends: 1351 [2019-09-08 03:34:32,635 INFO L226 Difference]: Without dead ends: 728 [2019-09-08 03:34:32,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:34:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-08 03:34:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 724. [2019-09-08 03:34:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-08 03:34:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1139 transitions. [2019-09-08 03:34:32,671 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1139 transitions. Word has length 124 [2019-09-08 03:34:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:32,672 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1139 transitions. [2019-09-08 03:34:32,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:34:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1139 transitions. [2019-09-08 03:34:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:34:32,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:32,675 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:32,675 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash -552113839, now seen corresponding path program 1 times [2019-09-08 03:34:32,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:32,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:34:32,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:32,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:34:32,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:34:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:34:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:34:32,826 INFO L87 Difference]: Start difference. First operand 724 states and 1139 transitions. Second operand 9 states. [2019-09-08 03:34:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:33,046 INFO L93 Difference]: Finished difference Result 1353 states and 2130 transitions. [2019-09-08 03:34:33,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:34:33,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-09-08 03:34:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:33,052 INFO L225 Difference]: With dead ends: 1353 [2019-09-08 03:34:33,052 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 03:34:33,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:34:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 03:34:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2019-09-08 03:34:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-08 03:34:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1139 transitions. [2019-09-08 03:34:33,084 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1139 transitions. Word has length 125 [2019-09-08 03:34:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:33,085 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1139 transitions. [2019-09-08 03:34:33,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:34:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1139 transitions. [2019-09-08 03:34:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:34:33,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:33,088 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:33,088 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash -722207105, now seen corresponding path program 1 times [2019-09-08 03:34:33,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:33,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:33,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:34:33,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:33,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:34:33,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:34:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:34:33,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:34:33,212 INFO L87 Difference]: Start difference. First operand 724 states and 1139 transitions. Second operand 4 states. [2019-09-08 03:34:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:33,302 INFO L93 Difference]: Finished difference Result 1395 states and 2215 transitions. [2019-09-08 03:34:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:34:33,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-08 03:34:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:33,310 INFO L225 Difference]: With dead ends: 1395 [2019-09-08 03:34:33,310 INFO L226 Difference]: Without dead ends: 701 [2019-09-08 03:34:33,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:34:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-09-08 03:34:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2019-09-08 03:34:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-09-08 03:34:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1091 transitions. [2019-09-08 03:34:33,343 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1091 transitions. Word has length 125 [2019-09-08 03:34:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:33,344 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 1091 transitions. [2019-09-08 03:34:33,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:34:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1091 transitions. [2019-09-08 03:34:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:34:33,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:33,347 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:33,347 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1328378363, now seen corresponding path program 1 times [2019-09-08 03:34:33,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:33,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:33,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:33,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:34:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:33,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:34:33,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:34:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:34:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:34:33,504 INFO L87 Difference]: Start difference. First operand 701 states and 1091 transitions. Second operand 6 states. [2019-09-08 03:34:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:33,730 INFO L93 Difference]: Finished difference Result 1389 states and 2186 transitions. [2019-09-08 03:34:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:34:33,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 03:34:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:33,736 INFO L225 Difference]: With dead ends: 1389 [2019-09-08 03:34:33,736 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 03:34:33,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:34:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 03:34:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 708. [2019-09-08 03:34:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-08 03:34:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1095 transitions. [2019-09-08 03:34:33,764 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1095 transitions. Word has length 126 [2019-09-08 03:34:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:33,765 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1095 transitions. [2019-09-08 03:34:33,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:34:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1095 transitions. [2019-09-08 03:34:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:34:33,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:33,768 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:33,768 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:33,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1460429767, now seen corresponding path program 1 times [2019-09-08 03:34:33,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:33,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:33,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:34:33,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:33,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:34:33,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:34:33,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:34:33,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:34:33,901 INFO L87 Difference]: Start difference. First operand 708 states and 1095 transitions. Second operand 7 states. [2019-09-08 03:34:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:33,998 INFO L93 Difference]: Finished difference Result 1335 states and 2083 transitions. [2019-09-08 03:34:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:34:33,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2019-09-08 03:34:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:34,004 INFO L225 Difference]: With dead ends: 1335 [2019-09-08 03:34:34,004 INFO L226 Difference]: Without dead ends: 694 [2019-09-08 03:34:34,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:34:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-08 03:34:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-09-08 03:34:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-09-08 03:34:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1062 transitions. [2019-09-08 03:34:34,029 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1062 transitions. Word has length 126 [2019-09-08 03:34:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:34,029 INFO L475 AbstractCegarLoop]: Abstraction has 692 states and 1062 transitions. [2019-09-08 03:34:34,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:34:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1062 transitions. [2019-09-08 03:34:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 03:34:34,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:34,032 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:34,032 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash -657009237, now seen corresponding path program 1 times [2019-09-08 03:34:34,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:34,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:34,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:34,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:34,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:34:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:34,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:34:34,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:34:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:34:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:34:34,193 INFO L87 Difference]: Start difference. First operand 692 states and 1062 transitions. Second operand 11 states. [2019-09-08 03:34:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:34,549 INFO L93 Difference]: Finished difference Result 1313 states and 2045 transitions. [2019-09-08 03:34:34,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:34:34,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-08 03:34:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:34,558 INFO L225 Difference]: With dead ends: 1313 [2019-09-08 03:34:34,558 INFO L226 Difference]: Without dead ends: 688 [2019-09-08 03:34:34,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:34:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-09-08 03:34:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 686. [2019-09-08 03:34:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-09-08 03:34:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1052 transitions. [2019-09-08 03:34:34,596 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1052 transitions. Word has length 127 [2019-09-08 03:34:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:34,597 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 1052 transitions. [2019-09-08 03:34:34,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:34:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1052 transitions. [2019-09-08 03:34:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 03:34:34,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:34,602 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:34,602 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1362077552, now seen corresponding path program 1 times [2019-09-08 03:34:34,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:34,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:34,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:34,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:34,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:34:34,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:34:34,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:34:34,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:34:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:35,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:34:35,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:34:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:34:35,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:34:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 03:34:35,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:34:35,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:34:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:34:35,224 INFO L87 Difference]: Start difference. First operand 686 states and 1052 transitions. Second operand 5 states. [2019-09-08 03:34:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:35,518 INFO L93 Difference]: Finished difference Result 1906 states and 3011 transitions. [2019-09-08 03:34:35,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:34:35,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-08 03:34:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:35,528 INFO L225 Difference]: With dead ends: 1906 [2019-09-08 03:34:35,528 INFO L226 Difference]: Without dead ends: 1293 [2019-09-08 03:34:35,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:34:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-09-08 03:34:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1220. [2019-09-08 03:34:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-09-08 03:34:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1905 transitions. [2019-09-08 03:34:35,591 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1905 transitions. Word has length 129 [2019-09-08 03:34:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:35,593 INFO L475 AbstractCegarLoop]: Abstraction has 1220 states and 1905 transitions. [2019-09-08 03:34:35,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:34:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1905 transitions. [2019-09-08 03:34:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 03:34:35,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:35,599 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:35,599 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:35,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1489259453, now seen corresponding path program 1 times [2019-09-08 03:34:35,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:35,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:35,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:35,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:34:35,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:35,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:34:35,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:34:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:34:35,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:35,825 INFO L87 Difference]: Start difference. First operand 1220 states and 1905 transitions. Second operand 10 states. [2019-09-08 03:34:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:36,843 INFO L93 Difference]: Finished difference Result 2834 states and 4434 transitions. [2019-09-08 03:34:36,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:34:36,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 180 [2019-09-08 03:34:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:36,859 INFO L225 Difference]: With dead ends: 2834 [2019-09-08 03:34:36,859 INFO L226 Difference]: Without dead ends: 1687 [2019-09-08 03:34:36,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:34:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2019-09-08 03:34:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1683. [2019-09-08 03:34:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-09-08 03:34:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2589 transitions. [2019-09-08 03:34:36,949 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2589 transitions. Word has length 180 [2019-09-08 03:34:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:36,950 INFO L475 AbstractCegarLoop]: Abstraction has 1683 states and 2589 transitions. [2019-09-08 03:34:36,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:34:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2589 transitions. [2019-09-08 03:34:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:34:36,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:36,956 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:36,956 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:36,956 INFO L82 PathProgramCache]: Analyzing trace with hash 782145964, now seen corresponding path program 1 times [2019-09-08 03:34:36,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:36,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:34:37,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:37,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:34:37,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:34:37,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:34:37,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:34:37,148 INFO L87 Difference]: Start difference. First operand 1683 states and 2589 transitions. Second operand 6 states. [2019-09-08 03:34:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:42,060 INFO L93 Difference]: Finished difference Result 4354 states and 7017 transitions. [2019-09-08 03:34:42,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:34:42,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-09-08 03:34:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:42,083 INFO L225 Difference]: With dead ends: 4354 [2019-09-08 03:34:42,083 INFO L226 Difference]: Without dead ends: 2744 [2019-09-08 03:34:42,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2019-09-08 03:34:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2587. [2019-09-08 03:34:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2587 states. [2019-09-08 03:34:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 4008 transitions. [2019-09-08 03:34:42,238 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 4008 transitions. Word has length 181 [2019-09-08 03:34:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:42,240 INFO L475 AbstractCegarLoop]: Abstraction has 2587 states and 4008 transitions. [2019-09-08 03:34:42,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:34:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 4008 transitions. [2019-09-08 03:34:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:34:42,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:42,249 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:42,249 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1670404598, now seen corresponding path program 1 times [2019-09-08 03:34:42,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:42,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:34:42,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:42,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:34:42,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:34:42,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:34:42,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:34:42,406 INFO L87 Difference]: Start difference. First operand 2587 states and 4008 transitions. Second operand 6 states. [2019-09-08 03:34:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:46,920 INFO L93 Difference]: Finished difference Result 7423 states and 12290 transitions. [2019-09-08 03:34:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:34:46,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-09-08 03:34:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:46,956 INFO L225 Difference]: With dead ends: 7423 [2019-09-08 03:34:46,956 INFO L226 Difference]: Without dead ends: 4909 [2019-09-08 03:34:46,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2019-09-08 03:34:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4542. [2019-09-08 03:34:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4542 states. [2019-09-08 03:34:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 7163 transitions. [2019-09-08 03:34:47,319 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 7163 transitions. Word has length 182 [2019-09-08 03:34:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:47,319 INFO L475 AbstractCegarLoop]: Abstraction has 4542 states and 7163 transitions. [2019-09-08 03:34:47,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:34:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 7163 transitions. [2019-09-08 03:34:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 03:34:47,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:47,328 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:47,329 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1663485680, now seen corresponding path program 1 times [2019-09-08 03:34:47,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:47,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:47,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:47,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:34:47,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:47,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:34:47,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:34:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:34:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:34:47,527 INFO L87 Difference]: Start difference. First operand 4542 states and 7163 transitions. Second operand 6 states. [2019-09-08 03:34:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:52,379 INFO L93 Difference]: Finished difference Result 14283 states and 24926 transitions. [2019-09-08 03:34:52,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:34:52,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-09-08 03:34:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:52,445 INFO L225 Difference]: With dead ends: 14283 [2019-09-08 03:34:52,445 INFO L226 Difference]: Without dead ends: 9814 [2019-09-08 03:34:52,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2019-09-08 03:34:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 8909. [2019-09-08 03:34:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8909 states. [2019-09-08 03:34:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8909 states to 8909 states and 14522 transitions. [2019-09-08 03:34:53,020 INFO L78 Accepts]: Start accepts. Automaton has 8909 states and 14522 transitions. Word has length 183 [2019-09-08 03:34:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:34:53,021 INFO L475 AbstractCegarLoop]: Abstraction has 8909 states and 14522 transitions. [2019-09-08 03:34:53,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:34:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8909 states and 14522 transitions. [2019-09-08 03:34:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:34:53,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:34:53,028 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:34:53,028 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:34:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:34:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash -324133574, now seen corresponding path program 1 times [2019-09-08 03:34:53,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:34:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:34:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:53,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:34:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:34:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:34:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:34:53,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:34:53,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:34:53,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:34:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:34:53,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:34:53,189 INFO L87 Difference]: Start difference. First operand 8909 states and 14522 transitions. Second operand 6 states. [2019-09-08 03:34:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:34:59,164 INFO L93 Difference]: Finished difference Result 30339 states and 57574 transitions. [2019-09-08 03:34:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:34:59,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-08 03:34:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:34:59,314 INFO L225 Difference]: With dead ends: 30339 [2019-09-08 03:34:59,314 INFO L226 Difference]: Without dead ends: 21503 [2019-09-08 03:34:59,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:34:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21503 states. [2019-09-08 03:35:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21503 to 19156. [2019-09-08 03:35:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19156 states. [2019-09-08 03:35:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19156 states to 19156 states and 32939 transitions. [2019-09-08 03:35:00,861 INFO L78 Accepts]: Start accepts. Automaton has 19156 states and 32939 transitions. Word has length 184 [2019-09-08 03:35:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:00,861 INFO L475 AbstractCegarLoop]: Abstraction has 19156 states and 32939 transitions. [2019-09-08 03:35:00,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:35:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 19156 states and 32939 transitions. [2019-09-08 03:35:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 03:35:00,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:00,870 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:00,870 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1341504821, now seen corresponding path program 1 times [2019-09-08 03:35:00,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:00,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:00,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:00,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:00,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:35:01,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:01,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:35:01,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:35:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:35:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:35:01,015 INFO L87 Difference]: Start difference. First operand 19156 states and 32939 transitions. Second operand 7 states. [2019-09-08 03:35:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:01,656 INFO L93 Difference]: Finished difference Result 38375 states and 65951 transitions. [2019-09-08 03:35:01,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:35:01,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-09-08 03:35:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:01,798 INFO L225 Difference]: With dead ends: 38375 [2019-09-08 03:35:01,798 INFO L226 Difference]: Without dead ends: 19309 [2019-09-08 03:35:03,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:35:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-09-08 03:35:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 19275. [2019-09-08 03:35:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19275 states. [2019-09-08 03:35:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19275 states to 19275 states and 33109 transitions. [2019-09-08 03:35:04,093 INFO L78 Accepts]: Start accepts. Automaton has 19275 states and 33109 transitions. Word has length 185 [2019-09-08 03:35:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:04,094 INFO L475 AbstractCegarLoop]: Abstraction has 19275 states and 33109 transitions. [2019-09-08 03:35:04,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:35:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 19275 states and 33109 transitions. [2019-09-08 03:35:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:35:04,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:04,103 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:04,103 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:04,103 INFO L82 PathProgramCache]: Analyzing trace with hash -815832887, now seen corresponding path program 1 times [2019-09-08 03:35:04,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:04,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:04,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:04,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:35:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:04,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:35:04,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:35:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:35:04,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:35:04,226 INFO L87 Difference]: Start difference. First operand 19275 states and 33109 transitions. Second operand 5 states. [2019-09-08 03:35:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:04,963 INFO L93 Difference]: Finished difference Result 38499 states and 65401 transitions. [2019-09-08 03:35:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:35:04,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-08 03:35:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:05,097 INFO L225 Difference]: With dead ends: 38499 [2019-09-08 03:35:05,097 INFO L226 Difference]: Without dead ends: 19329 [2019-09-08 03:35:05,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:35:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19329 states. [2019-09-08 03:35:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19329 to 19285. [2019-09-08 03:35:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19285 states. [2019-09-08 03:35:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19285 states to 19285 states and 33121 transitions. [2019-09-08 03:35:06,078 INFO L78 Accepts]: Start accepts. Automaton has 19285 states and 33121 transitions. Word has length 186 [2019-09-08 03:35:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:06,078 INFO L475 AbstractCegarLoop]: Abstraction has 19285 states and 33121 transitions. [2019-09-08 03:35:06,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:35:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 19285 states and 33121 transitions. [2019-09-08 03:35:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:35:06,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:06,084 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:06,085 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash -367288471, now seen corresponding path program 1 times [2019-09-08 03:35:06,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:06,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:06,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:35:06,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:35:06,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:35:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:35:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:35:06,228 INFO L87 Difference]: Start difference. First operand 19285 states and 33121 transitions. Second operand 7 states. [2019-09-08 03:35:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:07,155 INFO L93 Difference]: Finished difference Result 38599 states and 66247 transitions. [2019-09-08 03:35:07,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:35:07,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 186 [2019-09-08 03:35:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:07,248 INFO L225 Difference]: With dead ends: 38599 [2019-09-08 03:35:07,249 INFO L226 Difference]: Without dead ends: 19404 [2019-09-08 03:35:07,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:35:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19404 states. [2019-09-08 03:35:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19404 to 19302. [2019-09-08 03:35:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19302 states. [2019-09-08 03:35:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19302 states to 19302 states and 33138 transitions. [2019-09-08 03:35:08,623 INFO L78 Accepts]: Start accepts. Automaton has 19302 states and 33138 transitions. Word has length 186 [2019-09-08 03:35:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:08,623 INFO L475 AbstractCegarLoop]: Abstraction has 19302 states and 33138 transitions. [2019-09-08 03:35:08,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:35:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 19302 states and 33138 transitions. [2019-09-08 03:35:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:35:08,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:08,630 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:08,631 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1114786218, now seen corresponding path program 1 times [2019-09-08 03:35:08,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:08,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:08,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:08,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:08,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:35:08,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:08,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:35:08,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:35:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:35:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:35:08,787 INFO L87 Difference]: Start difference. First operand 19302 states and 33138 transitions. Second operand 6 states. [2019-09-08 03:35:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:16,606 INFO L93 Difference]: Finished difference Result 70741 states and 150350 transitions. [2019-09-08 03:35:16,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:35:16,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-08 03:35:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:16,906 INFO L225 Difference]: With dead ends: 70741 [2019-09-08 03:35:16,906 INFO L226 Difference]: Without dead ends: 51512 [2019-09-08 03:35:17,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:35:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51512 states. [2019-09-08 03:35:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51512 to 45135. [2019-09-08 03:35:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45135 states. [2019-09-08 03:35:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45135 states to 45135 states and 83647 transitions. [2019-09-08 03:35:21,588 INFO L78 Accepts]: Start accepts. Automaton has 45135 states and 83647 transitions. Word has length 186 [2019-09-08 03:35:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:21,588 INFO L475 AbstractCegarLoop]: Abstraction has 45135 states and 83647 transitions. [2019-09-08 03:35:21,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:35:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 45135 states and 83647 transitions. [2019-09-08 03:35:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 03:35:21,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:21,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:21,596 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 233719476, now seen corresponding path program 1 times [2019-09-08 03:35:21,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:21,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:21,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:35:21,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:21,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:35:21,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:35:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:35:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:35:21,760 INFO L87 Difference]: Start difference. First operand 45135 states and 83647 transitions. Second operand 6 states. [2019-09-08 03:35:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:33,580 INFO L93 Difference]: Finished difference Result 170578 states and 322380 transitions. [2019-09-08 03:35:33,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:35:33,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 03:35:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:34,156 INFO L225 Difference]: With dead ends: 170578 [2019-09-08 03:35:34,156 INFO L226 Difference]: Without dead ends: 125549 [2019-09-08 03:35:34,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:35:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125549 states. [2019-09-08 03:35:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125549 to 122466. [2019-09-08 03:35:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122466 states. [2019-09-08 03:35:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122466 states to 122466 states and 220372 transitions. [2019-09-08 03:35:43,753 INFO L78 Accepts]: Start accepts. Automaton has 122466 states and 220372 transitions. Word has length 195 [2019-09-08 03:35:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:43,754 INFO L475 AbstractCegarLoop]: Abstraction has 122466 states and 220372 transitions. [2019-09-08 03:35:43,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:35:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 122466 states and 220372 transitions. [2019-09-08 03:35:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 03:35:43,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:43,762 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:43,762 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash 852040967, now seen corresponding path program 1 times [2019-09-08 03:35:43,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:43,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:43,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:35:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:43,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:35:43,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:35:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:35:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:35:43,912 INFO L87 Difference]: Start difference. First operand 122466 states and 220372 transitions. Second operand 7 states. [2019-09-08 03:35:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:53,136 INFO L93 Difference]: Finished difference Result 243836 states and 439964 transitions. [2019-09-08 03:35:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:35:53,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-09-08 03:35:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:53,826 INFO L225 Difference]: With dead ends: 243836 [2019-09-08 03:35:53,826 INFO L226 Difference]: Without dead ends: 123126 [2019-09-08 03:35:55,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:35:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123126 states. [2019-09-08 03:36:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123126 to 123126. [2019-09-08 03:36:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123126 states. [2019-09-08 03:36:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123126 states to 123126 states and 220999 transitions. [2019-09-08 03:36:07,163 INFO L78 Accepts]: Start accepts. Automaton has 123126 states and 220999 transitions. Word has length 202 [2019-09-08 03:36:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:36:07,164 INFO L475 AbstractCegarLoop]: Abstraction has 123126 states and 220999 transitions. [2019-09-08 03:36:07,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:36:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 123126 states and 220999 transitions. [2019-09-08 03:36:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 03:36:07,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:36:07,173 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:36:07,173 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:36:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:36:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash 391880699, now seen corresponding path program 1 times [2019-09-08 03:36:07,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:36:07,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:36:07,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:07,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:36:07,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:36:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:36:08,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:36:08,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:36:08,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:36:08,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:36:08,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:36:08,141 INFO L87 Difference]: Start difference. First operand 123126 states and 220999 transitions. Second operand 7 states. [2019-09-08 03:36:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:36:35,945 INFO L93 Difference]: Finished difference Result 402271 states and 752083 transitions. [2019-09-08 03:36:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:36:35,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 215 [2019-09-08 03:36:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:36:38,236 INFO L225 Difference]: With dead ends: 402271 [2019-09-08 03:36:38,236 INFO L226 Difference]: Without dead ends: 309292 [2019-09-08 03:36:38,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:36:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309292 states. [2019-09-08 03:37:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309292 to 307297. [2019-09-08 03:37:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307297 states. [2019-09-08 03:37:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307297 states to 307297 states and 569985 transitions. [2019-09-08 03:37:08,526 INFO L78 Accepts]: Start accepts. Automaton has 307297 states and 569985 transitions. Word has length 215 [2019-09-08 03:37:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:08,527 INFO L475 AbstractCegarLoop]: Abstraction has 307297 states and 569985 transitions. [2019-09-08 03:37:08,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:37:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 307297 states and 569985 transitions. [2019-09-08 03:37:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 03:37:08,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:08,533 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:37:08,533 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 145567612, now seen corresponding path program 1 times [2019-09-08 03:37:08,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:08,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:08,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:37:08,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:37:08,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:37:08,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:09,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 3380 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:37:09,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:37:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:37:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:37:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 03:37:09,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:37:09,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:37:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:37:09,323 INFO L87 Difference]: Start difference. First operand 307297 states and 569985 transitions. Second operand 15 states.