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_spec3_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:15:44,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:15:44,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:15:44,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:15:44,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:15:44,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:15:44,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:15:44,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:15:44,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:15:44,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:15:44,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:15:44,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:15:44,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:15:44,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:15:44,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:15:44,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:15:44,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:15:44,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:15:44,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:15:44,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:15:44,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:15:44,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:15:44,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:15:44,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:15:44,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:15:44,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:15:44,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:15:44,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:15:44,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:15:44,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:15:44,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:15:44,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:15:44,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:15:44,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:15:44,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:15:44,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:15:44,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:15:44,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:15:44,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:15:44,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:15:44,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:15:44,610 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 04:15:44,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:15:44,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:15:44,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:15:44,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:15:44,627 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:15:44,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:15:44,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:15:44,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:15:44,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:15:44,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:15:44,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:15:44,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:15:44,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:15:44,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:15:44,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:15:44,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:15:44,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:15:44,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:15:44,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:15:44,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:15:44,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:15:44,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:15:44,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:15:44,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:15:44,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:15:44,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:15:44,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:15:44,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:15:44,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:15:44,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:15:44,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:15:44,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:15:44,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:15:44,698 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:15:44,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product20.cil.c [2019-09-08 04:15:44,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116a4c80a/5bb3c685c84741f3b117586bc1c1c03c/FLAGcc12bff4f [2019-09-08 04:15:45,467 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:15:45,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product20.cil.c [2019-09-08 04:15:45,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116a4c80a/5bb3c685c84741f3b117586bc1c1c03c/FLAGcc12bff4f [2019-09-08 04:15:45,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/116a4c80a/5bb3c685c84741f3b117586bc1c1c03c [2019-09-08 04:15:45,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:15:45,630 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:15:45,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:15:45,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:15:45,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:15:45,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:15:45" (1/1) ... [2019-09-08 04:15:45,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2027b576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:45, skipping insertion in model container [2019-09-08 04:15:45,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:15:45" (1/1) ... [2019-09-08 04:15:45,648 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:15:45,744 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:15:46,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:15:46,550 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:15:46,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:15:46,795 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:15:46,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46 WrapperNode [2019-09-08 04:15:46,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:15:46,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:15:46,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:15:46,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:15:46,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (1/1) ... [2019-09-08 04:15:46,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (1/1) ... [2019-09-08 04:15:46,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (1/1) ... [2019-09-08 04:15:46,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (1/1) ... [2019-09-08 04:15:46,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (1/1) ... [2019-09-08 04:15:46,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (1/1) ... [2019-09-08 04:15:46,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (1/1) ... [2019-09-08 04:15:47,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:15:47,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:15:47,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:15:47,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:15:47,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (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 04:15:47,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:15:47,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:15:47,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:15:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:15:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:15:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:15:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:15:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:15:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:15:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:15:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:15:47,100 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:15:47,100 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:15:47,101 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:15:47,102 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:15:47,102 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:15:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:15:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:15:47,106 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:15:47,106 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:15:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:15:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:15:47,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:15:47,108 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:15:47,108 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:15:47,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:15:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:15:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:15:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:15:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 04:15:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:15:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:15:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:15:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 04:15:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:15:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:15:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:15:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 04:15:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:15:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 04:15:47,111 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:15:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:15:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:15:47,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:15:47,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:15:47,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:15:47,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:15:47,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:15:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:15:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:15:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:15:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:15:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:15:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:15:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:15:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:15:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:15:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:15:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:15:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:15:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:15:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:15:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:15:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:15:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:15:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:15:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:15:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:15:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:15:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:15:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:15:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:15:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:15:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:15:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:15:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:15:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:15:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:15:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:15:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:15:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:15:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:15:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:15:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:15:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:15:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:15:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:15:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:15:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:15:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:15:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:15:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:15:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:15:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:15:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:15:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:15:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:15:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:15:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:15:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:15:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:15:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:15:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:15:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:15:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:15:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:15:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:15:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:15:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:15:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:15:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:15:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:15:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:15:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:15:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:15:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 04:15:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:15:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:15:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 04:15:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:15:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:15:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:15:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 04:15:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:15:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:15:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 04:15:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:15:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:15:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:15:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:15:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:15:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:15:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:15:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:15:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:15:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:15:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:15:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:15:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:15:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:15:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:15:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:15:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:15:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:15:47,150 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:15:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:15:47,151 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:15:47,152 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:15:47,152 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:15:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:15:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:15:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:15:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:15:47,153 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:15:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:15:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:15:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:15:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:15:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:15:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:15:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:15:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:15:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:15:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:15:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:15:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:15:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:15:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:15:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:15:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:15:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:15:49,643 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:15:49,644 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:15:49,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:15:49 BoogieIcfgContainer [2019-09-08 04:15:49,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:15:49,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:15:49,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:15:49,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:15:49,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:15:45" (1/3) ... [2019-09-08 04:15:49,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524d5541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:15:49, skipping insertion in model container [2019-09-08 04:15:49,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:15:46" (2/3) ... [2019-09-08 04:15:49,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524d5541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:15:49, skipping insertion in model container [2019-09-08 04:15:49,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:15:49" (3/3) ... [2019-09-08 04:15:49,655 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product20.cil.c [2019-09-08 04:15:49,665 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:15:49,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:15:49,696 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:15:49,752 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:15:49,753 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:15:49,753 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:15:49,753 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:15:49,754 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:15:49,754 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:15:49,754 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:15:49,755 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:15:49,755 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:15:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states. [2019-09-08 04:15:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:15:49,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:49,842 INFO L399 BasicCegarLoop]: trace histogram [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 04:15:49,849 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash 728591762, now seen corresponding path program 1 times [2019-09-08 04:15:49,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:49,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:49,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:15:50,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:15:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:15:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:15:50,610 INFO L87 Difference]: Start difference. First operand 809 states. Second operand 7 states. [2019-09-08 04:15:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:50,969 INFO L93 Difference]: Finished difference Result 1283 states and 2064 transitions. [2019-09-08 04:15:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:15:50,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-09-08 04:15:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:51,002 INFO L225 Difference]: With dead ends: 1283 [2019-09-08 04:15:51,002 INFO L226 Difference]: Without dead ends: 650 [2019-09-08 04:15:51,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 04:15:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-08 04:15:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-09-08 04:15:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-08 04:15:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1027 transitions. [2019-09-08 04:15:51,186 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1027 transitions. Word has length 93 [2019-09-08 04:15:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:51,187 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1027 transitions. [2019-09-08 04:15:51,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:15:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1027 transitions. [2019-09-08 04:15:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:15:51,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:51,195 INFO L399 BasicCegarLoop]: trace histogram [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 04:15:51,196 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2105197679, now seen corresponding path program 1 times [2019-09-08 04:15:51,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:51,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:51,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:51,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:51,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:51,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:51,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:15:51,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:15:51,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:15:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:15:51,467 INFO L87 Difference]: Start difference. First operand 648 states and 1027 transitions. Second operand 4 states. [2019-09-08 04:15:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:51,580 INFO L93 Difference]: Finished difference Result 1262 states and 2019 transitions. [2019-09-08 04:15:51,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:15:51,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-08 04:15:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:51,588 INFO L225 Difference]: With dead ends: 1262 [2019-09-08 04:15:51,589 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 04:15:51,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:15:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 04:15:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 04:15:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 04:15:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 994 transitions. [2019-09-08 04:15:51,648 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 994 transitions. Word has length 94 [2019-09-08 04:15:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:51,651 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 994 transitions. [2019-09-08 04:15:51,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:15:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 994 transitions. [2019-09-08 04:15:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:15:51,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:51,660 INFO L399 BasicCegarLoop]: trace histogram [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 04:15:51,664 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1592349723, now seen corresponding path program 1 times [2019-09-08 04:15:51,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:51,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:51,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:51,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:51,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:51,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:15:51,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:15:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:15:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:15:51,918 INFO L87 Difference]: Start difference. First operand 630 states and 994 transitions. Second operand 7 states. [2019-09-08 04:15:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:52,034 INFO L93 Difference]: Finished difference Result 1231 states and 1961 transitions. [2019-09-08 04:15:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:15:52,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-09-08 04:15:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:52,041 INFO L225 Difference]: With dead ends: 1231 [2019-09-08 04:15:52,041 INFO L226 Difference]: Without dead ends: 624 [2019-09-08 04:15:52,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 04:15:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-08 04:15:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-09-08 04:15:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-08 04:15:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 981 transitions. [2019-09-08 04:15:52,116 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 981 transitions. Word has length 94 [2019-09-08 04:15:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:52,117 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 981 transitions. [2019-09-08 04:15:52,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:15:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 981 transitions. [2019-09-08 04:15:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:15:52,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:52,119 INFO L399 BasicCegarLoop]: trace histogram [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 04:15:52,119 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:52,120 INFO L82 PathProgramCache]: Analyzing trace with hash 444231126, now seen corresponding path program 1 times [2019-09-08 04:15:52,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:52,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:52,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:52,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:15:52,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:15:52,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:15:52,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:15:52,276 INFO L87 Difference]: Start difference. First operand 624 states and 981 transitions. Second operand 7 states. [2019-09-08 04:15:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:52,384 INFO L93 Difference]: Finished difference Result 1219 states and 1935 transitions. [2019-09-08 04:15:52,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:15:52,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 04:15:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:52,394 INFO L225 Difference]: With dead ends: 1219 [2019-09-08 04:15:52,395 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 04:15:52,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 04:15:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 04:15:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 04:15:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 04:15:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 968 transitions. [2019-09-08 04:15:52,428 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 968 transitions. Word has length 95 [2019-09-08 04:15:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:52,429 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 968 transitions. [2019-09-08 04:15:52,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:15:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 968 transitions. [2019-09-08 04:15:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:15:52,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:52,431 INFO L399 BasicCegarLoop]: trace histogram [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 04:15:52,431 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:52,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:52,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1352448671, now seen corresponding path program 1 times [2019-09-08 04:15:52,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:52,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:52,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:52,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:52,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:52,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:15:52,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:15:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:15:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:15:52,602 INFO L87 Difference]: Start difference. First operand 618 states and 968 transitions. Second operand 7 states. [2019-09-08 04:15:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:52,700 INFO L93 Difference]: Finished difference Result 1207 states and 1909 transitions. [2019-09-08 04:15:52,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:15:52,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-08 04:15:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:52,706 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 04:15:52,707 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 04:15:52,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 04:15:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 04:15:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 04:15:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:15:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 955 transitions. [2019-09-08 04:15:52,733 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 955 transitions. Word has length 96 [2019-09-08 04:15:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:52,733 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 955 transitions. [2019-09-08 04:15:52,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:15:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 955 transitions. [2019-09-08 04:15:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:15:52,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:52,735 INFO L399 BasicCegarLoop]: trace histogram [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 04:15:52,735 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:52,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1553576800, now seen corresponding path program 1 times [2019-09-08 04:15:52,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:52,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:52,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:52,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:52,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:15:52,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:15:52,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:15:52,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:15:52,875 INFO L87 Difference]: Start difference. First operand 612 states and 955 transitions. Second operand 7 states. [2019-09-08 04:15:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:52,968 INFO L93 Difference]: Finished difference Result 1195 states and 1883 transitions. [2019-09-08 04:15:52,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:15:52,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-08 04:15:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:52,981 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 04:15:52,982 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 04:15:52,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 04:15:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 04:15:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 04:15:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:15:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 954 transitions. [2019-09-08 04:15:53,013 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 954 transitions. Word has length 96 [2019-09-08 04:15:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:53,013 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 954 transitions. [2019-09-08 04:15:53,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:15:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 954 transitions. [2019-09-08 04:15:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:15:53,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:53,016 INFO L399 BasicCegarLoop]: trace histogram [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 04:15:53,016 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1582577178, now seen corresponding path program 1 times [2019-09-08 04:15:53,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:53,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:53,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:53,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:53,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:53,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:15:53,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:15:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:15:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:15:53,186 INFO L87 Difference]: Start difference. First operand 612 states and 954 transitions. Second operand 5 states. [2019-09-08 04:15:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:53,259 INFO L93 Difference]: Finished difference Result 1194 states and 1880 transitions. [2019-09-08 04:15:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:15:53,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 04:15:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:53,265 INFO L225 Difference]: With dead ends: 1194 [2019-09-08 04:15:53,265 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 04:15:53,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:15:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 04:15:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 04:15:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:15:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 953 transitions. [2019-09-08 04:15:53,298 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 953 transitions. Word has length 97 [2019-09-08 04:15:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:53,299 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 953 transitions. [2019-09-08 04:15:53,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:15:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 953 transitions. [2019-09-08 04:15:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:15:53,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:53,306 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:15:53,306 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1643629033, now seen corresponding path program 1 times [2019-09-08 04:15:53,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:53,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:53,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:15:53,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:15:53,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:15:53,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:15:53,484 INFO L87 Difference]: Start difference. First operand 612 states and 953 transitions. Second operand 5 states. [2019-09-08 04:15:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:53,557 INFO L93 Difference]: Finished difference Result 1194 states and 1878 transitions. [2019-09-08 04:15:53,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:15:53,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 04:15:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:53,563 INFO L225 Difference]: With dead ends: 1194 [2019-09-08 04:15:53,563 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 04:15:53,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:15:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 04:15:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 04:15:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:15:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 952 transitions. [2019-09-08 04:15:53,595 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 952 transitions. Word has length 98 [2019-09-08 04:15:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:53,595 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 952 transitions. [2019-09-08 04:15:53,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:15:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 952 transitions. [2019-09-08 04:15:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:15:53,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:53,598 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:15:53,598 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash -205792939, now seen corresponding path program 1 times [2019-09-08 04:15:53,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:53,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:53,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:53,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:53,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:53,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:15:53,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:15:53,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:15:53,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:15:53,719 INFO L87 Difference]: Start difference. First operand 612 states and 952 transitions. Second operand 5 states. [2019-09-08 04:15:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:53,793 INFO L93 Difference]: Finished difference Result 1194 states and 1876 transitions. [2019-09-08 04:15:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:15:53,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 04:15:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:53,798 INFO L225 Difference]: With dead ends: 1194 [2019-09-08 04:15:53,799 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 04:15:53,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:15:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 04:15:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 04:15:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:15:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 951 transitions. [2019-09-08 04:15:53,833 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 951 transitions. Word has length 99 [2019-09-08 04:15:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:53,834 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 951 transitions. [2019-09-08 04:15:53,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:15:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 951 transitions. [2019-09-08 04:15:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 04:15:53,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:53,836 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:15:53,836 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:53,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:53,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1150361404, now seen corresponding path program 1 times [2019-09-08 04:15:53,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:53,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:53,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:53,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:15:53,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:15:53,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:15:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:15:53,947 INFO L87 Difference]: Start difference. First operand 612 states and 951 transitions. Second operand 5 states. [2019-09-08 04:15:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:54,042 INFO L93 Difference]: Finished difference Result 1194 states and 1874 transitions. [2019-09-08 04:15:54,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:15:54,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 04:15:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:54,048 INFO L225 Difference]: With dead ends: 1194 [2019-09-08 04:15:54,048 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 04:15:54,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:15:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 04:15:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 04:15:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 04:15:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 950 transitions. [2019-09-08 04:15:54,072 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 950 transitions. Word has length 100 [2019-09-08 04:15:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:54,072 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 950 transitions. [2019-09-08 04:15:54,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:15:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 950 transitions. [2019-09-08 04:15:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 04:15:54,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:54,074 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:15:54,074 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 185725072, now seen corresponding path program 1 times [2019-09-08 04:15:54,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:54,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:54,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:54,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:15:54,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:15:54,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:15:54,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:15:54,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:15:54,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:15:54,264 INFO L87 Difference]: Start difference. First operand 612 states and 950 transitions. Second operand 8 states. [2019-09-08 04:15:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:57,560 INFO L93 Difference]: Finished difference Result 2235 states and 3531 transitions. [2019-09-08 04:15:57,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:15:57,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-08 04:15:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:57,576 INFO L225 Difference]: With dead ends: 2235 [2019-09-08 04:15:57,576 INFO L226 Difference]: Without dead ends: 1657 [2019-09-08 04:15:57,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:15:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-09-08 04:15:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1645. [2019-09-08 04:15:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2019-09-08 04:15:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2558 transitions. [2019-09-08 04:15:57,681 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2558 transitions. Word has length 101 [2019-09-08 04:15:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:57,684 INFO L475 AbstractCegarLoop]: Abstraction has 1645 states and 2558 transitions. [2019-09-08 04:15:57,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:15:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2558 transitions. [2019-09-08 04:15:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 04:15:57,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:57,686 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:15:57,686 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:57,687 INFO L82 PathProgramCache]: Analyzing trace with hash 962074000, now seen corresponding path program 1 times [2019-09-08 04:15:57,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:57,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:57,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 04:15:57,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:15:57,875 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 04:15:57,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:58,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:15:58,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:15:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:15:58,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:15:58,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:15:58,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:15:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:15:58,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:15:58,670 INFO L87 Difference]: Start difference. First operand 1645 states and 2558 transitions. Second operand 12 states. [2019-09-08 04:16:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:06,565 INFO L93 Difference]: Finished difference Result 8066 states and 13139 transitions. [2019-09-08 04:16:06,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:16:06,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-09-08 04:16:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:06,633 INFO L225 Difference]: With dead ends: 8066 [2019-09-08 04:16:06,633 INFO L226 Difference]: Without dead ends: 6455 [2019-09-08 04:16:06,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:16:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2019-09-08 04:16:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 4167. [2019-09-08 04:16:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4167 states. [2019-09-08 04:16:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 6561 transitions. [2019-09-08 04:16:07,085 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 6561 transitions. Word has length 101 [2019-09-08 04:16:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:07,086 INFO L475 AbstractCegarLoop]: Abstraction has 4167 states and 6561 transitions. [2019-09-08 04:16:07,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:16:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 6561 transitions. [2019-09-08 04:16:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 04:16:07,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:07,088 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:16:07,088 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash -128546951, now seen corresponding path program 1 times [2019-09-08 04:16:07,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:07,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:16:07,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:07,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:16:07,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:16:07,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:16:07,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:16:07,238 INFO L87 Difference]: Start difference. First operand 4167 states and 6561 transitions. Second operand 7 states. [2019-09-08 04:16:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:10,460 INFO L93 Difference]: Finished difference Result 12343 states and 19923 transitions. [2019-09-08 04:16:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:16:10,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-09-08 04:16:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:10,524 INFO L225 Difference]: With dead ends: 12343 [2019-09-08 04:16:10,524 INFO L226 Difference]: Without dead ends: 8210 [2019-09-08 04:16:10,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:16:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2019-09-08 04:16:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 8122. [2019-09-08 04:16:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8122 states. [2019-09-08 04:16:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 12908 transitions. [2019-09-08 04:16:10,979 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 12908 transitions. Word has length 104 [2019-09-08 04:16:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:10,980 INFO L475 AbstractCegarLoop]: Abstraction has 8122 states and 12908 transitions. [2019-09-08 04:16:10,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:16:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 12908 transitions. [2019-09-08 04:16:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 04:16:10,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:10,982 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:16:10,982 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash 422139196, now seen corresponding path program 1 times [2019-09-08 04:16:10,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:10,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:10,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:10,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:16:11,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:11,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:16:11,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:16:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:16:11,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:16:11,100 INFO L87 Difference]: Start difference. First operand 8122 states and 12908 transitions. Second operand 4 states. [2019-09-08 04:16:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:11,438 INFO L93 Difference]: Finished difference Result 15841 states and 25449 transitions. [2019-09-08 04:16:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:16:11,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 04:16:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:11,539 INFO L225 Difference]: With dead ends: 15841 [2019-09-08 04:16:11,539 INFO L226 Difference]: Without dead ends: 7741 [2019-09-08 04:16:11,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:16:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2019-09-08 04:16:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 7719. [2019-09-08 04:16:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7719 states. [2019-09-08 04:16:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7719 states to 7719 states and 12247 transitions. [2019-09-08 04:16:12,104 INFO L78 Accepts]: Start accepts. Automaton has 7719 states and 12247 transitions. Word has length 105 [2019-09-08 04:16:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:12,105 INFO L475 AbstractCegarLoop]: Abstraction has 7719 states and 12247 transitions. [2019-09-08 04:16:12,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:16:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7719 states and 12247 transitions. [2019-09-08 04:16:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 04:16:12,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:12,107 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:16:12,107 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash 53496904, now seen corresponding path program 1 times [2019-09-08 04:16:12,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:12,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:12,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:12,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 04:16:12,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:12,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:16:12,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:16:12,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:16:12,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:16:12,280 INFO L87 Difference]: Start difference. First operand 7719 states and 12247 transitions. Second operand 7 states. [2019-09-08 04:16:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:16,015 INFO L93 Difference]: Finished difference Result 23081 states and 37687 transitions. [2019-09-08 04:16:16,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:16:16,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-09-08 04:16:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:16,099 INFO L225 Difference]: With dead ends: 23081 [2019-09-08 04:16:16,099 INFO L226 Difference]: Without dead ends: 15396 [2019-09-08 04:16:16,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:16:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15396 states. [2019-09-08 04:16:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15396 to 15272. [2019-09-08 04:16:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15272 states. [2019-09-08 04:16:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15272 states to 15272 states and 24621 transitions. [2019-09-08 04:16:16,750 INFO L78 Accepts]: Start accepts. Automaton has 15272 states and 24621 transitions. Word has length 113 [2019-09-08 04:16:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:16,750 INFO L475 AbstractCegarLoop]: Abstraction has 15272 states and 24621 transitions. [2019-09-08 04:16:16,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:16:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15272 states and 24621 transitions. [2019-09-08 04:16:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 04:16:16,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:16,753 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:16:16,753 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1202684267, now seen corresponding path program 1 times [2019-09-08 04:16:16,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:16,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:16,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:16,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:16,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 04:16:16,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:16,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:16:16,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:16:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:16:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:16:16,873 INFO L87 Difference]: Start difference. First operand 15272 states and 24621 transitions. Second operand 4 states. [2019-09-08 04:16:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:17,502 INFO L93 Difference]: Finished difference Result 30191 states and 49230 transitions. [2019-09-08 04:16:17,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:16:17,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 04:16:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:17,597 INFO L225 Difference]: With dead ends: 30191 [2019-09-08 04:16:17,597 INFO L226 Difference]: Without dead ends: 14941 [2019-09-08 04:16:17,645 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 04:16:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14941 states. [2019-09-08 04:16:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14941 to 14901. [2019-09-08 04:16:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14901 states. [2019-09-08 04:16:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14901 states to 14901 states and 23979 transitions. [2019-09-08 04:16:18,385 INFO L78 Accepts]: Start accepts. Automaton has 14901 states and 23979 transitions. Word has length 114 [2019-09-08 04:16:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:18,385 INFO L475 AbstractCegarLoop]: Abstraction has 14901 states and 23979 transitions. [2019-09-08 04:16:18,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:16:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 14901 states and 23979 transitions. [2019-09-08 04:16:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 04:16:18,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:18,388 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:16:18,388 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1104399514, now seen corresponding path program 1 times [2019-09-08 04:16:18,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:18,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:18,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:18,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:16:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:16:18,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:16:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:16:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:16:18,545 INFO L87 Difference]: Start difference. First operand 14901 states and 23979 transitions. Second operand 7 states. [2019-09-08 04:16:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:22,027 INFO L93 Difference]: Finished difference Result 44743 states and 74586 transitions. [2019-09-08 04:16:22,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:16:22,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-09-08 04:16:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:22,258 INFO L225 Difference]: With dead ends: 44743 [2019-09-08 04:16:22,258 INFO L226 Difference]: Without dead ends: 29876 [2019-09-08 04:16:22,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:16:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29876 states. [2019-09-08 04:16:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29876 to 29692. [2019-09-08 04:16:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29692 states. [2019-09-08 04:16:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29692 states to 29692 states and 48998 transitions. [2019-09-08 04:16:23,742 INFO L78 Accepts]: Start accepts. Automaton has 29692 states and 48998 transitions. Word has length 123 [2019-09-08 04:16:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:23,742 INFO L475 AbstractCegarLoop]: Abstraction has 29692 states and 48998 transitions. [2019-09-08 04:16:23,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:16:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 29692 states and 48998 transitions. [2019-09-08 04:16:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 04:16:23,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:23,744 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:16:23,745 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:23,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1662690101, now seen corresponding path program 1 times [2019-09-08 04:16:23,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:23,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 04:16:23,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:23,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:16:23,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:16:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:16:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:16:23,837 INFO L87 Difference]: Start difference. First operand 29692 states and 48998 transitions. Second operand 4 states. [2019-09-08 04:16:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:25,656 INFO L93 Difference]: Finished difference Result 59081 states and 98868 transitions. [2019-09-08 04:16:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:16:25,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-08 04:16:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:25,853 INFO L225 Difference]: With dead ends: 59081 [2019-09-08 04:16:25,853 INFO L226 Difference]: Without dead ends: 29411 [2019-09-08 04:16:26,064 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 04:16:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29411 states. [2019-09-08 04:16:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29411 to 29335. [2019-09-08 04:16:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29335 states. [2019-09-08 04:16:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29335 states to 29335 states and 48323 transitions. [2019-09-08 04:16:27,406 INFO L78 Accepts]: Start accepts. Automaton has 29335 states and 48323 transitions. Word has length 124 [2019-09-08 04:16:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:27,407 INFO L475 AbstractCegarLoop]: Abstraction has 29335 states and 48323 transitions. [2019-09-08 04:16:27,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:16:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29335 states and 48323 transitions. [2019-09-08 04:16:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 04:16:27,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:27,410 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-09-08 04:16:27,411 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash -98700217, now seen corresponding path program 1 times [2019-09-08 04:16:27,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:27,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:27,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:27,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:16:27,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:27,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:16:27,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:16:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:16:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:16:27,634 INFO L87 Difference]: Start difference. First operand 29335 states and 48323 transitions. Second operand 7 states. [2019-09-08 04:16:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:32,702 INFO L93 Difference]: Finished difference Result 88217 states and 152173 transitions. [2019-09-08 04:16:32,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:16:32,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-09-08 04:16:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:33,106 INFO L225 Difference]: With dead ends: 88217 [2019-09-08 04:16:33,106 INFO L226 Difference]: Without dead ends: 58916 [2019-09-08 04:16:33,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:16:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58916 states. [2019-09-08 04:16:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58916 to 58632. [2019-09-08 04:16:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58632 states. [2019-09-08 04:16:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58632 states to 58632 states and 100413 transitions. [2019-09-08 04:16:38,290 INFO L78 Accepts]: Start accepts. Automaton has 58632 states and 100413 transitions. Word has length 134 [2019-09-08 04:16:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:38,291 INFO L475 AbstractCegarLoop]: Abstraction has 58632 states and 100413 transitions. [2019-09-08 04:16:38,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:16:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 58632 states and 100413 transitions. [2019-09-08 04:16:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 04:16:38,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:38,292 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-09-08 04:16:38,292 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1017675526, now seen corresponding path program 1 times [2019-09-08 04:16:38,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:38,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:38,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:38,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:38,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:16:38,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:38,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:16:38,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:16:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:16:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:16:38,390 INFO L87 Difference]: Start difference. First operand 58632 states and 100413 transitions. Second operand 4 states. [2019-09-08 04:16:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:40,395 INFO L93 Difference]: Finished difference Result 116272 states and 202767 transitions. [2019-09-08 04:16:40,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:16:40,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 04:16:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:40,709 INFO L225 Difference]: With dead ends: 116272 [2019-09-08 04:16:40,709 INFO L226 Difference]: Without dead ends: 57656 [2019-09-08 04:16:40,952 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 04:16:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57656 states. [2019-09-08 04:16:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57656 to 57512. [2019-09-08 04:16:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57512 states. [2019-09-08 04:16:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57512 states to 57512 states and 98126 transitions. [2019-09-08 04:16:46,200 INFO L78 Accepts]: Start accepts. Automaton has 57512 states and 98126 transitions. Word has length 135 [2019-09-08 04:16:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:46,200 INFO L475 AbstractCegarLoop]: Abstraction has 57512 states and 98126 transitions. [2019-09-08 04:16:46,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:16:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 57512 states and 98126 transitions. [2019-09-08 04:16:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 04:16:46,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:46,201 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-09-08 04:16:46,202 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash -408867468, now seen corresponding path program 1 times [2019-09-08 04:16:46,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:46,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:16:46,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:16:46,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:16:46,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:16:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:16:46,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:16:46,319 INFO L87 Difference]: Start difference. First operand 57512 states and 98126 transitions. Second operand 3 states. [2019-09-08 04:16:48,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:48,404 INFO L93 Difference]: Finished difference Result 117775 states and 199571 transitions. [2019-09-08 04:16:48,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:16:48,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 04:16:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:48,748 INFO L225 Difference]: With dead ends: 117775 [2019-09-08 04:16:48,748 INFO L226 Difference]: Without dead ends: 61516 [2019-09-08 04:16:48,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:16:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61516 states. [2019-09-08 04:16:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61516 to 60954. [2019-09-08 04:16:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60954 states. [2019-09-08 04:16:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60954 states to 60954 states and 104227 transitions. [2019-09-08 04:16:54,136 INFO L78 Accepts]: Start accepts. Automaton has 60954 states and 104227 transitions. Word has length 136 [2019-09-08 04:16:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:16:54,137 INFO L475 AbstractCegarLoop]: Abstraction has 60954 states and 104227 transitions. [2019-09-08 04:16:54,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:16:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 60954 states and 104227 transitions. [2019-09-08 04:16:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 04:16:54,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:16:54,140 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-09-08 04:16:54,141 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:16:54,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:16:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1816972749, now seen corresponding path program 1 times [2019-09-08 04:16:54,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:16:54,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:16:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:16:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:16:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 04:16:54,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:16:54,353 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 04:16:54,368 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 04:16:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:16:54,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 3418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:16:54,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:16:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:16:54,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:16:54,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 04:16:54,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:16:54,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:16:54,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:16:54,911 INFO L87 Difference]: Start difference. First operand 60954 states and 104227 transitions. Second operand 13 states. [2019-09-08 04:16:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:59,206 INFO L93 Difference]: Finished difference Result 134406 states and 247274 transitions. [2019-09-08 04:16:59,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:16:59,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 195 [2019-09-08 04:16:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:59,634 INFO L225 Difference]: With dead ends: 134406 [2019-09-08 04:16:59,635 INFO L226 Difference]: Without dead ends: 73486 [2019-09-08 04:16:59,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2019-09-08 04:16:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73486 states. [2019-09-08 04:17:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73486 to 69786. [2019-09-08 04:17:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69786 states. [2019-09-08 04:17:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69786 states to 69786 states and 118017 transitions. [2019-09-08 04:17:02,744 INFO L78 Accepts]: Start accepts. Automaton has 69786 states and 118017 transitions. Word has length 195 [2019-09-08 04:17:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:17:02,745 INFO L475 AbstractCegarLoop]: Abstraction has 69786 states and 118017 transitions. [2019-09-08 04:17:02,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:17:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 69786 states and 118017 transitions. [2019-09-08 04:17:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 04:17:02,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:17:02,781 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2019-09-08 04:17:02,781 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:17:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:17:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1417449010, now seen corresponding path program 1 times [2019-09-08 04:17:02,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:17:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:17:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:02,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 11 proven. 37 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-08 04:17:03,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:17:03,021 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 04:17:03,037 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 04:17:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:03,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 4119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:17:03,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:17:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-08 04:17:03,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:17:03,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:17:03,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:17:03,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:17:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:17:03,771 INFO L87 Difference]: Start difference. First operand 69786 states and 118017 transitions. Second operand 15 states. [2019-09-08 04:17:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:17:09,544 INFO L93 Difference]: Finished difference Result 140170 states and 248851 transitions. [2019-09-08 04:17:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:17:09,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2019-09-08 04:17:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:17:09,893 INFO L225 Difference]: With dead ends: 140170 [2019-09-08 04:17:09,893 INFO L226 Difference]: Without dead ends: 70418 [2019-09-08 04:17:10,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:17:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70418 states. [2019-09-08 04:17:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70418 to 70418. [2019-09-08 04:17:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70418 states. [2019-09-08 04:17:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70418 states to 70418 states and 118552 transitions. [2019-09-08 04:17:12,566 INFO L78 Accepts]: Start accepts. Automaton has 70418 states and 118552 transitions. Word has length 303 [2019-09-08 04:17:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:17:12,567 INFO L475 AbstractCegarLoop]: Abstraction has 70418 states and 118552 transitions. [2019-09-08 04:17:12,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:17:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 70418 states and 118552 transitions. [2019-09-08 04:17:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-09-08 04:17:12,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:17:12,601 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 04:17:12,601 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:17:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:17:12,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1113275069, now seen corresponding path program 1 times [2019-09-08 04:17:12,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:17:12,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:17:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:12,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-09-08 04:17:12,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:17:12,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 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 04:17:12,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:13,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 5196 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:17:13,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:17:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-09-08 04:17:14,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:17:14,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:17:14,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:17:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:17:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:17:14,497 INFO L87 Difference]: Start difference. First operand 70418 states and 118552 transitions. Second operand 15 states. [2019-09-08 04:17:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:17:18,233 INFO L93 Difference]: Finished difference Result 141554 states and 249822 transitions. [2019-09-08 04:17:18,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:17:18,234 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 474 [2019-09-08 04:17:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:17:18,721 INFO L225 Difference]: With dead ends: 141554 [2019-09-08 04:17:18,721 INFO L226 Difference]: Without dead ends: 71170 [2019-09-08 04:17:22,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 475 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:17:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71170 states. [2019-09-08 04:17:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71170 to 71170. [2019-09-08 04:17:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71170 states. [2019-09-08 04:17:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71170 states to 71170 states and 119255 transitions. [2019-09-08 04:17:24,576 INFO L78 Accepts]: Start accepts. Automaton has 71170 states and 119255 transitions. Word has length 474 [2019-09-08 04:17:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:17:24,577 INFO L475 AbstractCegarLoop]: Abstraction has 71170 states and 119255 transitions. [2019-09-08 04:17:24,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:17:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 71170 states and 119255 transitions. [2019-09-08 04:17:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 04:17:24,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:17:24,611 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2019-09-08 04:17:24,612 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:17:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:17:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1417231810, now seen corresponding path program 1 times [2019-09-08 04:17:24,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:17:24,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:17:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:24,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 11 proven. 43 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-08 04:17:25,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:17:25,236 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 04:17:25,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:25,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 4127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:17:25,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:17:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-08 04:17:25,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:17:25,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:17:25,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:17:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:17:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:17:25,959 INFO L87 Difference]: Start difference. First operand 71170 states and 119255 transitions. Second operand 15 states. [2019-09-08 04:17:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:17:30,095 INFO L93 Difference]: Finished difference Result 143170 states and 251185 transitions. [2019-09-08 04:17:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:17:30,096 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 311 [2019-09-08 04:17:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:17:30,411 INFO L225 Difference]: With dead ends: 143170 [2019-09-08 04:17:30,412 INFO L226 Difference]: Without dead ends: 72034 [2019-09-08 04:17:30,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:17:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72034 states. [2019-09-08 04:17:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72034 to 72034. [2019-09-08 04:17:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72034 states. [2019-09-08 04:17:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72034 states to 72034 states and 120094 transitions. [2019-09-08 04:17:33,542 INFO L78 Accepts]: Start accepts. Automaton has 72034 states and 120094 transitions. Word has length 311 [2019-09-08 04:17:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:17:33,543 INFO L475 AbstractCegarLoop]: Abstraction has 72034 states and 120094 transitions. [2019-09-08 04:17:33,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:17:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 72034 states and 120094 transitions. [2019-09-08 04:17:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 04:17:33,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:17:33,563 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2019-09-08 04:17:33,563 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:17:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:17:33,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1273119488, now seen corresponding path program 1 times [2019-09-08 04:17:33,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:17:33,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:17:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:33,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-09-08 04:17:33,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:17:33,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:17:33,844 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 04:17:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:34,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 4131 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 04:17:34,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:17:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 04:17:34,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:17:34,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-09-08 04:17:34,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:17:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:17:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:17:34,631 INFO L87 Difference]: Start difference. First operand 72034 states and 120094 transitions. Second operand 18 states. [2019-09-08 04:17:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:17:53,732 INFO L93 Difference]: Finished difference Result 227809 states and 410087 transitions. [2019-09-08 04:17:53,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 04:17:53,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 313 [2019-09-08 04:17:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:17:54,527 INFO L225 Difference]: With dead ends: 227809 [2019-09-08 04:17:54,527 INFO L226 Difference]: Without dead ends: 155803 [2019-09-08 04:17:55,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:17:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155803 states. [2019-09-08 04:18:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155803 to 152991. [2019-09-08 04:18:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152991 states. [2019-09-08 04:18:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152991 states to 152991 states and 258467 transitions. [2019-09-08 04:18:07,287 INFO L78 Accepts]: Start accepts. Automaton has 152991 states and 258467 transitions. Word has length 313 [2019-09-08 04:18:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:18:07,288 INFO L475 AbstractCegarLoop]: Abstraction has 152991 states and 258467 transitions. [2019-09-08 04:18:07,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:18:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 152991 states and 258467 transitions. [2019-09-08 04:18:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 04:18:07,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:18:07,312 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:18:07,312 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:18:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:18:07,313 INFO L82 PathProgramCache]: Analyzing trace with hash 984501084, now seen corresponding path program 1 times [2019-09-08 04:18:07,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:18:07,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:18:07,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:18:07,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:18:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:18:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:18:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-08 04:18:07,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:18:07,565 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 04:18:07,582 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 04:18:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:18:08,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 4482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:18:08,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:18:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 04:18:08,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:18:08,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-09-08 04:18:08,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:18:08,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:18:08,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:18:08,329 INFO L87 Difference]: Start difference. First operand 152991 states and 258467 transitions. Second operand 13 states. [2019-09-08 04:18:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:18:50,821 INFO L93 Difference]: Finished difference Result 557746 states and 1214413 transitions. [2019-09-08 04:18:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:18:50,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 335 [2019-09-08 04:18:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:02,092 INFO L225 Difference]: With dead ends: 557746 [2019-09-08 04:19:02,093 INFO L226 Difference]: Without dead ends: 404669 [2019-09-08 04:19:03,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 04:19:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404669 states. [2019-09-08 04:19:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404669 to 375482. [2019-09-08 04:19:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375482 states. [2019-09-08 04:19:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375482 states to 375482 states and 668914 transitions. [2019-09-08 04:19:38,443 INFO L78 Accepts]: Start accepts. Automaton has 375482 states and 668914 transitions. Word has length 335 [2019-09-08 04:19:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:38,443 INFO L475 AbstractCegarLoop]: Abstraction has 375482 states and 668914 transitions. [2019-09-08 04:19:38,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:19:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 375482 states and 668914 transitions. [2019-09-08 04:19:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-08 04:19:38,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:38,461 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 9, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2019-09-08 04:19:38,461 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:38,462 INFO L82 PathProgramCache]: Analyzing trace with hash -539427537, now seen corresponding path program 1 times [2019-09-08 04:19:38,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:38,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:38,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:38,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:38,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2019-09-08 04:19:40,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:19:40,093 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:19:40,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:40,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 5487 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 04:19:40,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:19:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 445 proven. 2 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-09-08 04:19:41,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:19:41,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-09-08 04:19:41,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 04:19:41,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 04:19:41,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:19:41,137 INFO L87 Difference]: Start difference. First operand 375482 states and 668914 transitions. Second operand 24 states. [2019-09-08 04:21:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:32,885 INFO L93 Difference]: Finished difference Result 1126839 states and 2336916 transitions. [2019-09-08 04:21:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:21:32,886 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 497 [2019-09-08 04:21:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:38,829 INFO L225 Difference]: With dead ends: 1126839 [2019-09-08 04:21:38,829 INFO L226 Difference]: Without dead ends: 751391 [2019-09-08 04:21:47,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:21:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751391 states.