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_spec1_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:52:44,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:52:44,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:52:44,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:52:44,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:52:44,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:52:44,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:52:44,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:52:44,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:52:44,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:52:44,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:52:44,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:52:44,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:52:44,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:52:44,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:52:44,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:52:44,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:52:44,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:52:44,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:52:44,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:52:44,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:52:44,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:52:44,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:52:44,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:52:44,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:52:44,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:52:44,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:52:44,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:52:44,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:52:44,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:52:44,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:52:44,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:52:44,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:52:44,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:52:44,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:52:44,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:52:44,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:52:44,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:52:44,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:52:44,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:52:44,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:52:44,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:52:44,500 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:52:44,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:52:44,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:52:44,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:52:44,502 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:52:44,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:52:44,502 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:52:44,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:52:44,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:52:44,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:52:44,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:52:44,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:52:44,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:52:44,504 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:52:44,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:52:44,504 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:52:44,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:52:44,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:52:44,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:52:44,505 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:52:44,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:52:44,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:52:44,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:52:44,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:52:44,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:52:44,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:52:44,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:52:44,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:52:44,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:52:44,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:52:44,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:52:44,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:52:44,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:52:44,556 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:52:44,557 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c [2019-09-08 03:52:44,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc62ca2c/16db9391edc54c1a9136e2d1110807d7/FLAG52228a265 [2019-09-08 03:52:45,199 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:52:45,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c [2019-09-08 03:52:45,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc62ca2c/16db9391edc54c1a9136e2d1110807d7/FLAG52228a265 [2019-09-08 03:52:45,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc62ca2c/16db9391edc54c1a9136e2d1110807d7 [2019-09-08 03:52:45,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:52:45,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:52:45,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:52:45,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:52:45,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:52:45,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:52:45" (1/1) ... [2019-09-08 03:52:45,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f483d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:45, skipping insertion in model container [2019-09-08 03:52:45,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:52:45" (1/1) ... [2019-09-08 03:52:45,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:52:45,580 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:52:46,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:52:46,322 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:52:46,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:52:46,491 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:52:46,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46 WrapperNode [2019-09-08 03:52:46,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:52:46,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:52:46,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:52:46,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:52:46,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (1/1) ... [2019-09-08 03:52:46,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (1/1) ... [2019-09-08 03:52:46,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (1/1) ... [2019-09-08 03:52:46,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (1/1) ... [2019-09-08 03:52:46,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (1/1) ... [2019-09-08 03:52:46,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (1/1) ... [2019-09-08 03:52:46,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (1/1) ... [2019-09-08 03:52:46,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:52:46,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:52:46,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:52:46,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:52:46,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52: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 03:52:46,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:52:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:52:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:52:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:52:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:52:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:52:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:52:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:52:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:52:46,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:52:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:52:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:52:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:52:46,753 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:52:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:52:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:52:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:52:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:52:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:52:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:52:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:52:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:52:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:52:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:52:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:52:46,756 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:52:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:52:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:52:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:52:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:52:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:52:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:52:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:52:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:52:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:52:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:52:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:52:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:52:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:52:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:52:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:52:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:52:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:52:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:52:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:52:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:52:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:52:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:52:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:52:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:52:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:52:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:52:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:52:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:52:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:52:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:52:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:52:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:52:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:52:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:52:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:52:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:52:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:52:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:52:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:52:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:52:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:52:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:52:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:52:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:52:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:52:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:52:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:52:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:52:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:52:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:52:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:52:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:52:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:52:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:52:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:52:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:52:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:52:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:52:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:52:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:52:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:52:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:52:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:52:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:52:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:52:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:52:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:52:46,771 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:52:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:52:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:52:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:52:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:52:46,772 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:52:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:52:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:52:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:52:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:52:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:52:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:52:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:52:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:52:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:52:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:52:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:52:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:52:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:52:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:52:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:52:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:52:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:52:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:52:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:52:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:52:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:52:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:52:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:52:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:52:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:52:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:52:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:52:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:52:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:52:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:52:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:52:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:52:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:52:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:52:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:52:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:52:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:52:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:52:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:52:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:52:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:52:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:52:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:52:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:52:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:52:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:52:49,156 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:52:49,156 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:52:49,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:52:49 BoogieIcfgContainer [2019-09-08 03:52:49,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:52:49,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:52:49,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:52:49,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:52:49,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:52:45" (1/3) ... [2019-09-08 03:52:49,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e48d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:52:49, skipping insertion in model container [2019-09-08 03:52:49,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:52:46" (2/3) ... [2019-09-08 03:52:49,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e48d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:52:49, skipping insertion in model container [2019-09-08 03:52:49,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:52:49" (3/3) ... [2019-09-08 03:52:49,166 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product25.cil.c [2019-09-08 03:52:49,176 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:52:49,187 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:52:49,205 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:52:49,246 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:52:49,247 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:52:49,247 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:52:49,247 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:52:49,247 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:52:49,248 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:52:49,248 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:52:49,248 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:52:49,248 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:52:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states. [2019-09-08 03:52:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:52:49,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:49,332 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:49,335 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash 896830833, now seen corresponding path program 1 times [2019-09-08 03:52:49,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:49,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:49,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:52:49,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:49,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:50,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 3204 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:52:50,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:52:50,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:50,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:52:50,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:52:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:52:50,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:52:50,642 INFO L87 Difference]: Start difference. First operand 759 states. Second operand 4 states. [2019-09-08 03:52:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:50,827 INFO L93 Difference]: Finished difference Result 1202 states and 1951 transitions. [2019-09-08 03:52:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:52:50,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 03:52:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:50,864 INFO L225 Difference]: With dead ends: 1202 [2019-09-08 03:52:50,865 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 03:52:50,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:52:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 03:52:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-09-08 03:52:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 03:52:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 969 transitions. [2019-09-08 03:52:51,000 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 969 transitions. Word has length 138 [2019-09-08 03:52:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:51,001 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 969 transitions. [2019-09-08 03:52:51,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:52:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 969 transitions. [2019-09-08 03:52:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 03:52:51,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:51,011 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:51,011 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1824771190, now seen corresponding path program 1 times [2019-09-08 03:52:51,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:51,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:51,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:52:51,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:51,297 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:51,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:51,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 3209 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:51,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:52:51,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:51,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:52:51,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:52:51,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:52:51,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:52:51,962 INFO L87 Difference]: Start difference. First operand 605 states and 969 transitions. Second operand 6 states. [2019-09-08 03:52:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:52,085 INFO L93 Difference]: Finished difference Result 1182 states and 1911 transitions. [2019-09-08 03:52:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:52:52,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 03:52:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:52,095 INFO L225 Difference]: With dead ends: 1182 [2019-09-08 03:52:52,096 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 03:52:52,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 03:52:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-09-08 03:52:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 03:52:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 968 transitions. [2019-09-08 03:52:52,168 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 968 transitions. Word has length 142 [2019-09-08 03:52:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:52,169 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 968 transitions. [2019-09-08 03:52:52,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:52:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 968 transitions. [2019-09-08 03:52:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 03:52:52,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:52,179 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:52,180 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash 48166316, now seen corresponding path program 1 times [2019-09-08 03:52:52,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:52,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:52:52,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:52,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:52:52,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:53,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 3211 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:53,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:52:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:52:53,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:52:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:52:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:52:53,100 INFO L87 Difference]: Start difference. First operand 605 states and 968 transitions. Second operand 6 states. [2019-09-08 03:52:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:53,213 INFO L93 Difference]: Finished difference Result 1186 states and 1914 transitions. [2019-09-08 03:52:53,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:52:53,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 03:52:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:53,225 INFO L225 Difference]: With dead ends: 1186 [2019-09-08 03:52:53,225 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:52:53,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:52:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 03:52:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:52:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 973 transitions. [2019-09-08 03:52:53,297 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 973 transitions. Word has length 144 [2019-09-08 03:52:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:53,299 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 973 transitions. [2019-09-08 03:52:53,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:52:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 973 transitions. [2019-09-08 03:52:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 03:52:53,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:53,307 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:53,308 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1492609617, now seen corresponding path program 1 times [2019-09-08 03:52:53,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:53,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:53,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:52:53,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:53,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:53,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:53,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:53,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:52:54,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:54,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:52:54,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:52:54,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:52:54,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:52:54,039 INFO L87 Difference]: Start difference. First operand 611 states and 973 transitions. Second operand 6 states. [2019-09-08 03:52:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:54,138 INFO L93 Difference]: Finished difference Result 1185 states and 1905 transitions. [2019-09-08 03:52:54,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:52:54,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 03:52:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:54,144 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 03:52:54,145 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:52:54,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:52:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 03:52:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:52:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 972 transitions. [2019-09-08 03:52:54,176 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 972 transitions. Word has length 145 [2019-09-08 03:52:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:54,176 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 972 transitions. [2019-09-08 03:52:54,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:52:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 972 transitions. [2019-09-08 03:52:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:52:54,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:54,181 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:54,181 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1011781872, now seen corresponding path program 1 times [2019-09-08 03:52:54,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:54,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:54,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:54,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:52:54,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:54,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:54,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 3213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:54,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:52:54,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:54,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:52:54,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:52:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:52:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:52:54,915 INFO L87 Difference]: Start difference. First operand 611 states and 972 transitions. Second operand 6 states. [2019-09-08 03:52:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:55,006 INFO L93 Difference]: Finished difference Result 1185 states and 1904 transitions. [2019-09-08 03:52:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:52:55,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-09-08 03:52:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:55,014 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 03:52:55,014 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:52:55,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:52:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 03:52:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:52:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 971 transitions. [2019-09-08 03:52:55,050 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 971 transitions. Word has length 146 [2019-09-08 03:52:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:55,050 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 971 transitions. [2019-09-08 03:52:55,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:52:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 971 transitions. [2019-09-08 03:52:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 03:52:55,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:55,058 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:55,058 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2009217747, now seen corresponding path program 1 times [2019-09-08 03:52:55,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:55,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:55,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:52:55,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:55,299 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:55,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 3214 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:55,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:52:55,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:55,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 03:52:55,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:52:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:52:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:52:55,924 INFO L87 Difference]: Start difference. First operand 611 states and 971 transitions. Second operand 12 states. [2019-09-08 03:52:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:56,624 INFO L93 Difference]: Finished difference Result 1196 states and 1924 transitions. [2019-09-08 03:52:56,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:52:56,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2019-09-08 03:52:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:56,635 INFO L225 Difference]: With dead ends: 1196 [2019-09-08 03:52:56,635 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:52:56,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:52:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:52:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2019-09-08 03:52:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:52:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 976 transitions. [2019-09-08 03:52:56,683 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 976 transitions. Word has length 147 [2019-09-08 03:52:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:56,684 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 976 transitions. [2019-09-08 03:52:56,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:52:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 976 transitions. [2019-09-08 03:52:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 03:52:56,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:56,690 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:56,690 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1945581503, now seen corresponding path program 1 times [2019-09-08 03:52:56,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:56,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:52:56,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:56,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:52:56,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:57,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 3217 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:57,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:52:57,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:57,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:52:57,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:52:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:52:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:57,525 INFO L87 Difference]: Start difference. First operand 618 states and 976 transitions. Second operand 8 states. [2019-09-08 03:52:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:57,846 INFO L93 Difference]: Finished difference Result 1197 states and 1914 transitions. [2019-09-08 03:52:57,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:52:57,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 03:52:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:57,854 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 03:52:57,855 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:52:57,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:52:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:52:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:52:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:52:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 971 transitions. [2019-09-08 03:52:57,895 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 971 transitions. Word has length 150 [2019-09-08 03:52:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:57,896 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 971 transitions. [2019-09-08 03:52:57,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:52:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 971 transitions. [2019-09-08 03:52:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 03:52:57,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:57,902 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:57,902 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1740497259, now seen corresponding path program 1 times [2019-09-08 03:52:57,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:57,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:57,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:52:58,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:58,106 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 03:52:58,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:58,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:58,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:52:58,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:58,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:52:58,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:52:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:52:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:58,881 INFO L87 Difference]: Start difference. First operand 618 states and 971 transitions. Second operand 8 states. [2019-09-08 03:52:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:59,175 INFO L93 Difference]: Finished difference Result 1218 states and 1935 transitions. [2019-09-08 03:52:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:52:59,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 152 [2019-09-08 03:52:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:59,182 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 03:52:59,182 INFO L226 Difference]: Without dead ends: 645 [2019-09-08 03:52:59,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:52:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-08 03:52:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2019-09-08 03:52:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 03:52:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 998 transitions. [2019-09-08 03:52:59,218 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 998 transitions. Word has length 152 [2019-09-08 03:52:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:59,218 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 998 transitions. [2019-09-08 03:52:59,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:52:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 998 transitions. [2019-09-08 03:52:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 03:52:59,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:59,223 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:59,223 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1751757003, now seen corresponding path program 1 times [2019-09-08 03:52:59,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:59,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:59,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:52:59,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:59,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:52:59,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:59,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 3218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:59,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:52:59,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:52:59,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:52:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:52:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:52:59,824 INFO L87 Difference]: Start difference. First operand 642 states and 998 transitions. Second operand 6 states. [2019-09-08 03:53:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:00,103 INFO L93 Difference]: Finished difference Result 1245 states and 1954 transitions. [2019-09-08 03:53:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:00,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-08 03:53:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:00,110 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 03:53:00,110 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 03:53:00,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 03:53:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-08 03:53:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-08 03:53:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 973 transitions. [2019-09-08 03:53:00,136 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 973 transitions. Word has length 152 [2019-09-08 03:53:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:00,137 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 973 transitions. [2019-09-08 03:53:00,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 973 transitions. [2019-09-08 03:53:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 03:53:00,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:00,140 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:00,141 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1838952981, now seen corresponding path program 1 times [2019-09-08 03:53:00,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:00,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:00,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:00,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:53:00,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:00,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:53:00,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:00,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 3215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:53:00,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:53:00,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:00,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:53:00,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:53:00,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:53:00,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:53:00,920 INFO L87 Difference]: Start difference. First operand 629 states and 973 transitions. Second operand 14 states. [2019-09-08 03:53:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:01,303 INFO L93 Difference]: Finished difference Result 1204 states and 1887 transitions. [2019-09-08 03:53:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:53:01,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 152 [2019-09-08 03:53:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:01,310 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 03:53:01,310 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:53:01,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:53:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:53:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 618. [2019-09-08 03:53:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:53:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 956 transitions. [2019-09-08 03:53:01,345 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 956 transitions. Word has length 152 [2019-09-08 03:53:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:01,345 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 956 transitions. [2019-09-08 03:53:01,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:53:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 956 transitions. [2019-09-08 03:53:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:53:01,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:01,350 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:01,351 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1136514263, now seen corresponding path program 1 times [2019-09-08 03:53:01,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:01,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:01,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:01,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:53:01,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:01,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:53:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:02,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 3223 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:53:02,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:53:02,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:02,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:53:02,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:02,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:02,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:02,150 INFO L87 Difference]: Start difference. First operand 618 states and 956 transitions. Second operand 8 states. [2019-09-08 03:53:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:02,397 INFO L93 Difference]: Finished difference Result 1186 states and 1859 transitions. [2019-09-08 03:53:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:02,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-09-08 03:53:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:02,403 INFO L225 Difference]: With dead ends: 1186 [2019-09-08 03:53:02,404 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:53:02,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:53:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:53:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:53:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:53:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 955 transitions. [2019-09-08 03:53:02,432 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 955 transitions. Word has length 156 [2019-09-08 03:53:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:02,432 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 955 transitions. [2019-09-08 03:53:02,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 955 transitions. [2019-09-08 03:53:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 03:53:02,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:02,437 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:02,437 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 97115976, now seen corresponding path program 1 times [2019-09-08 03:53:02,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:02,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:02,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 03:53:02,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:02,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:02,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:03,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 3224 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:53:03,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:53:03,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:03,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:53:03,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:53:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:53:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:53:03,245 INFO L87 Difference]: Start difference. First operand 618 states and 955 transitions. Second operand 18 states. [2019-09-08 03:53:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:03,795 INFO L93 Difference]: Finished difference Result 1202 states and 1886 transitions. [2019-09-08 03:53:03,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:53:03,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2019-09-08 03:53:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:03,800 INFO L225 Difference]: With dead ends: 1202 [2019-09-08 03:53:03,801 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:53:03,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:53:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:53:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2019-09-08 03:53:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-08 03:53:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 963 transitions. [2019-09-08 03:53:03,826 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 963 transitions. Word has length 157 [2019-09-08 03:53:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:03,826 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 963 transitions. [2019-09-08 03:53:03,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:53:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 963 transitions. [2019-09-08 03:53:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 03:53:03,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:03,831 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:03,831 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -506227811, now seen corresponding path program 1 times [2019-09-08 03:53:03,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:03,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:53:04,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:04,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:53:04,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:53:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:53:04,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:04,016 INFO L87 Difference]: Start difference. First operand 629 states and 963 transitions. Second operand 9 states. [2019-09-08 03:53:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:04,203 INFO L93 Difference]: Finished difference Result 1133 states and 1782 transitions. [2019-09-08 03:53:04,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:53:04,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-08 03:53:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:04,212 INFO L225 Difference]: With dead ends: 1133 [2019-09-08 03:53:04,212 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:53:04,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:53:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:53:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:53:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:53:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 958 transitions. [2019-09-08 03:53:04,246 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 958 transitions. Word has length 158 [2019-09-08 03:53:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:04,247 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 958 transitions. [2019-09-08 03:53:04,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:53:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 958 transitions. [2019-09-08 03:53:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 03:53:04,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:04,258 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:53:04,259 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1722074909, now seen corresponding path program 1 times [2019-09-08 03:53:04,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:53:04,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:04,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:04,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:04,450 INFO L87 Difference]: Start difference. First operand 626 states and 958 transitions. Second operand 7 states. [2019-09-08 03:53:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:04,543 INFO L93 Difference]: Finished difference Result 1130 states and 1777 transitions. [2019-09-08 03:53:04,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:53:04,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-09-08 03:53:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:04,551 INFO L225 Difference]: With dead ends: 1130 [2019-09-08 03:53:04,551 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 03:53:04,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 03:53:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-09-08 03:53:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 03:53:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 928 transitions. [2019-09-08 03:53:04,587 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 928 transitions. Word has length 158 [2019-09-08 03:53:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:04,588 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 928 transitions. [2019-09-08 03:53:04,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 928 transitions. [2019-09-08 03:53:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 03:53:04,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:04,595 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:04,595 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1081253702, now seen corresponding path program 1 times [2019-09-08 03:53:04,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:04,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:04,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:53:04,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:04,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:53:04,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:53:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:53:04,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:53:04,914 INFO L87 Difference]: Start difference. First operand 603 states and 928 transitions. Second operand 13 states. [2019-09-08 03:53:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:05,256 INFO L93 Difference]: Finished difference Result 1173 states and 1833 transitions. [2019-09-08 03:53:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:53:05,257 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2019-09-08 03:53:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:05,261 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:53:05,262 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:53:05,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:53:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:53:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2019-09-08 03:53:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 03:53:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 943 transitions. [2019-09-08 03:53:05,299 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 943 transitions. Word has length 160 [2019-09-08 03:53:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:05,299 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 943 transitions. [2019-09-08 03:53:05,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:53:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 943 transitions. [2019-09-08 03:53:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:53:05,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:05,305 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:53:05,305 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080099, now seen corresponding path program 1 times [2019-09-08 03:53:05,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:05,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:05,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:05,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:53:05,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:05,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:53:05,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:53:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:53:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:53:05,604 INFO L87 Difference]: Start difference. First operand 615 states and 943 transitions. Second operand 13 states. [2019-09-08 03:53:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:05,916 INFO L93 Difference]: Finished difference Result 1120 states and 1760 transitions. [2019-09-08 03:53:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:53:05,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-09-08 03:53:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:05,922 INFO L225 Difference]: With dead ends: 1120 [2019-09-08 03:53:05,923 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 03:53:05,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:53:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 03:53:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-08 03:53:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 03:53:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 934 transitions. [2019-09-08 03:53:05,949 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 934 transitions. Word has length 159 [2019-09-08 03:53:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:05,951 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 934 transitions. [2019-09-08 03:53:05,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:53:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 934 transitions. [2019-09-08 03:53:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 03:53:05,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:05,956 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:05,956 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash -276534136, now seen corresponding path program 1 times [2019-09-08 03:53:05,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:05,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:05,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:05,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:05,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:53:06,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:06,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:53:06,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:53:06,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:53:06,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:53:06,207 INFO L87 Difference]: Start difference. First operand 608 states and 934 transitions. Second operand 11 states. [2019-09-08 03:53:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:06,510 INFO L93 Difference]: Finished difference Result 1113 states and 1751 transitions. [2019-09-08 03:53:06,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:53:06,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 03:53:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:06,516 INFO L225 Difference]: With dead ends: 1113 [2019-09-08 03:53:06,516 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 03:53:06,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:53:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 03:53:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-08 03:53:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 03:53:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 933 transitions. [2019-09-08 03:53:06,550 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 933 transitions. Word has length 161 [2019-09-08 03:53:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:06,551 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 933 transitions. [2019-09-08 03:53:06,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:53:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 933 transitions. [2019-09-08 03:53:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 03:53:06,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:06,556 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:06,556 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1490619995, now seen corresponding path program 1 times [2019-09-08 03:53:06,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:06,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:53:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:53:06,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:53:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:53:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:53:06,764 INFO L87 Difference]: Start difference. First operand 608 states and 933 transitions. Second operand 11 states. [2019-09-08 03:53:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:07,059 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-09-08 03:53:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:53:07,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 162 [2019-09-08 03:53:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:07,067 INFO L225 Difference]: With dead ends: 1159 [2019-09-08 03:53:07,067 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 03:53:07,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:53:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 03:53:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-09-08 03:53:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 03:53:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 925 transitions. [2019-09-08 03:53:07,098 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 925 transitions. Word has length 162 [2019-09-08 03:53:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:07,099 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 925 transitions. [2019-09-08 03:53:07,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:53:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 925 transitions. [2019-09-08 03:53:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 03:53:07,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:07,104 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:07,104 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash 675189955, now seen corresponding path program 1 times [2019-09-08 03:53:07,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:07,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:07,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:53:07,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:53:07,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:53:07,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:07,438 INFO L87 Difference]: Start difference. First operand 605 states and 925 transitions. Second operand 9 states. [2019-09-08 03:53:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:10,998 INFO L93 Difference]: Finished difference Result 1107 states and 1757 transitions. [2019-09-08 03:53:10,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:10,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-09-08 03:53:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:11,004 INFO L225 Difference]: With dead ends: 1107 [2019-09-08 03:53:11,004 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:53:11,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:53:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:53:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2019-09-08 03:53:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-09-08 03:53:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 944 transitions. [2019-09-08 03:53:11,031 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 944 transitions. Word has length 163 [2019-09-08 03:53:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:11,031 INFO L475 AbstractCegarLoop]: Abstraction has 609 states and 944 transitions. [2019-09-08 03:53:11,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:53:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 944 transitions. [2019-09-08 03:53:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:53:11,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:11,036 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:11,036 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash 611633585, now seen corresponding path program 1 times [2019-09-08 03:53:11,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:11,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:11,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:11,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:11,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:11,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:53:11,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:11,187 INFO L87 Difference]: Start difference. First operand 609 states and 944 transitions. Second operand 8 states. [2019-09-08 03:53:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:17,009 INFO L93 Difference]: Finished difference Result 2033 states and 3330 transitions. [2019-09-08 03:53:17,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:53:17,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 164 [2019-09-08 03:53:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:17,022 INFO L225 Difference]: With dead ends: 2033 [2019-09-08 03:53:17,022 INFO L226 Difference]: Without dead ends: 1533 [2019-09-08 03:53:17,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:53:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2019-09-08 03:53:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1494. [2019-09-08 03:53:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-09-08 03:53:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2369 transitions. [2019-09-08 03:53:17,091 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2369 transitions. Word has length 164 [2019-09-08 03:53:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:17,091 INFO L475 AbstractCegarLoop]: Abstraction has 1494 states and 2369 transitions. [2019-09-08 03:53:17,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2369 transitions. [2019-09-08 03:53:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:53:17,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:17,096 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:17,096 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:17,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:17,096 INFO L82 PathProgramCache]: Analyzing trace with hash -618292540, now seen corresponding path program 1 times [2019-09-08 03:53:17,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:17,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:17,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:17,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:17,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:17,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:53:17,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:53:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:53:17,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:17,269 INFO L87 Difference]: Start difference. First operand 1494 states and 2369 transitions. Second operand 9 states. [2019-09-08 03:53:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:24,467 INFO L93 Difference]: Finished difference Result 4697 states and 7720 transitions. [2019-09-08 03:53:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:53:24,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-09-08 03:53:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:24,493 INFO L225 Difference]: With dead ends: 4697 [2019-09-08 03:53:24,494 INFO L226 Difference]: Without dead ends: 3312 [2019-09-08 03:53:24,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:53:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2019-09-08 03:53:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3089. [2019-09-08 03:53:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-09-08 03:53:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 4982 transitions. [2019-09-08 03:53:24,791 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 4982 transitions. Word has length 170 [2019-09-08 03:53:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:24,792 INFO L475 AbstractCegarLoop]: Abstraction has 3089 states and 4982 transitions. [2019-09-08 03:53:24,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:53:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 4982 transitions. [2019-09-08 03:53:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:53:24,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:24,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:24,799 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash -626051899, now seen corresponding path program 1 times [2019-09-08 03:53:24,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:24,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:24,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:24,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:24,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:24,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:24,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:53:24,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:53:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:53:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:53:24,959 INFO L87 Difference]: Start difference. First operand 3089 states and 4982 transitions. Second operand 5 states. [2019-09-08 03:53:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:28,150 INFO L93 Difference]: Finished difference Result 6708 states and 10834 transitions. [2019-09-08 03:53:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:53:28,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-09-08 03:53:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:28,199 INFO L225 Difference]: With dead ends: 6708 [2019-09-08 03:53:28,199 INFO L226 Difference]: Without dead ends: 4514 [2019-09-08 03:53:28,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states. [2019-09-08 03:53:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 4487. [2019-09-08 03:53:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-09-08 03:53:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 7180 transitions. [2019-09-08 03:53:28,491 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 7180 transitions. Word has length 170 [2019-09-08 03:53:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:28,492 INFO L475 AbstractCegarLoop]: Abstraction has 4487 states and 7180 transitions. [2019-09-08 03:53:28,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:53:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 7180 transitions. [2019-09-08 03:53:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:53:28,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:28,498 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:28,498 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1423335943, now seen corresponding path program 1 times [2019-09-08 03:53:28,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:28,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:28,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:28,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:28,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:28,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:28,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:28,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:28,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:28,669 INFO L87 Difference]: Start difference. First operand 4487 states and 7180 transitions. Second operand 7 states. [2019-09-08 03:53:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:33,080 INFO L93 Difference]: Finished difference Result 12305 states and 20170 transitions. [2019-09-08 03:53:33,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:53:33,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-08 03:53:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:33,149 INFO L225 Difference]: With dead ends: 12305 [2019-09-08 03:53:33,149 INFO L226 Difference]: Without dead ends: 8729 [2019-09-08 03:53:33,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:53:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8729 states. [2019-09-08 03:53:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8729 to 8566. [2019-09-08 03:53:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8566 states. [2019-09-08 03:53:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8566 states to 8566 states and 13874 transitions. [2019-09-08 03:53:33,800 INFO L78 Accepts]: Start accepts. Automaton has 8566 states and 13874 transitions. Word has length 170 [2019-09-08 03:53:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:33,800 INFO L475 AbstractCegarLoop]: Abstraction has 8566 states and 13874 transitions. [2019-09-08 03:53:33,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8566 states and 13874 transitions. [2019-09-08 03:53:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:53:33,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:33,805 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:33,805 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1087108611, now seen corresponding path program 1 times [2019-09-08 03:53:33,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:33,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:33,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:33,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:33,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:33,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:33,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:53:33,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:53:33,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:53:33,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:53:33,952 INFO L87 Difference]: Start difference. First operand 8566 states and 13874 transitions. Second operand 5 states. [2019-09-08 03:53:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:34,373 INFO L93 Difference]: Finished difference Result 16333 states and 26656 transitions. [2019-09-08 03:53:34,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:53:34,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 03:53:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:34,445 INFO L225 Difference]: With dead ends: 16333 [2019-09-08 03:53:34,445 INFO L226 Difference]: Without dead ends: 8788 [2019-09-08 03:53:34,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:53:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8788 states. [2019-09-08 03:53:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8788 to 8656. [2019-09-08 03:53:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8656 states. [2019-09-08 03:53:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 14001 transitions. [2019-09-08 03:53:34,935 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 14001 transitions. Word has length 175 [2019-09-08 03:53:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:34,936 INFO L475 AbstractCegarLoop]: Abstraction has 8656 states and 14001 transitions. [2019-09-08 03:53:34,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:53:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 14001 transitions. [2019-09-08 03:53:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:53:34,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:34,942 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:34,942 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash -216108597, now seen corresponding path program 1 times [2019-09-08 03:53:34,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:34,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:34,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:53:35,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:35,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:35,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:35,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:35,109 INFO L87 Difference]: Start difference. First operand 8656 states and 14001 transitions. Second operand 7 states. [2019-09-08 03:53:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:36,348 INFO L93 Difference]: Finished difference Result 17317 states and 28602 transitions. [2019-09-08 03:53:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:53:36,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-08 03:53:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:36,396 INFO L225 Difference]: With dead ends: 17317 [2019-09-08 03:53:36,396 INFO L226 Difference]: Without dead ends: 8656 [2019-09-08 03:53:36,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2019-09-08 03:53:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8656. [2019-09-08 03:53:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8656 states. [2019-09-08 03:53:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 13825 transitions. [2019-09-08 03:53:36,809 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 13825 transitions. Word has length 182 [2019-09-08 03:53:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:36,810 INFO L475 AbstractCegarLoop]: Abstraction has 8656 states and 13825 transitions. [2019-09-08 03:53:36,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 13825 transitions. [2019-09-08 03:53:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 03:53:36,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:36,816 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:36,816 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -304839906, now seen corresponding path program 1 times [2019-09-08 03:53:36,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:36,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:53:36,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:36,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:36,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:36,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:36,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:36,976 INFO L87 Difference]: Start difference. First operand 8656 states and 13825 transitions. Second operand 7 states. [2019-09-08 03:53:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:41,413 INFO L93 Difference]: Finished difference Result 16949 states and 27239 transitions. [2019-09-08 03:53:41,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:53:41,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-09-08 03:53:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:41,461 INFO L225 Difference]: With dead ends: 16949 [2019-09-08 03:53:41,462 INFO L226 Difference]: Without dead ends: 9331 [2019-09-08 03:53:41,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:53:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9331 states. [2019-09-08 03:53:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9331 to 9120. [2019-09-08 03:53:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9120 states. [2019-09-08 03:53:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9120 states to 9120 states and 14451 transitions. [2019-09-08 03:53:41,926 INFO L78 Accepts]: Start accepts. Automaton has 9120 states and 14451 transitions. Word has length 187 [2019-09-08 03:53:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:41,927 INFO L475 AbstractCegarLoop]: Abstraction has 9120 states and 14451 transitions. [2019-09-08 03:53:41,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9120 states and 14451 transitions. [2019-09-08 03:53:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 03:53:41,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:41,933 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:41,933 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash -666387387, now seen corresponding path program 1 times [2019-09-08 03:53:41,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:41,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:53:42,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:42,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:53:42,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:53:42,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:53:42,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:53:42,160 INFO L87 Difference]: Start difference. First operand 9120 states and 14451 transitions. Second operand 11 states. [2019-09-08 03:53:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:49,640 INFO L93 Difference]: Finished difference Result 19926 states and 31647 transitions. [2019-09-08 03:53:49,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:53:49,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2019-09-08 03:53:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:49,716 INFO L225 Difference]: With dead ends: 19926 [2019-09-08 03:53:49,717 INFO L226 Difference]: Without dead ends: 11711 [2019-09-08 03:53:49,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:53:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11711 states. [2019-09-08 03:53:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11711 to 11448. [2019-09-08 03:53:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11448 states. [2019-09-08 03:53:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11448 states to 11448 states and 17845 transitions. [2019-09-08 03:53:50,489 INFO L78 Accepts]: Start accepts. Automaton has 11448 states and 17845 transitions. Word has length 194 [2019-09-08 03:53:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:50,489 INFO L475 AbstractCegarLoop]: Abstraction has 11448 states and 17845 transitions. [2019-09-08 03:53:50,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:53:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11448 states and 17845 transitions. [2019-09-08 03:53:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 03:53:50,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:50,495 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:50,496 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 102782628, now seen corresponding path program 1 times [2019-09-08 03:53:50,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:50,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:50,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:53:50,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:50,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:53:50,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:50,677 INFO L87 Difference]: Start difference. First operand 11448 states and 17845 transitions. Second operand 6 states. [2019-09-08 03:53:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:51,188 INFO L93 Difference]: Finished difference Result 27237 states and 42943 transitions. [2019-09-08 03:53:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:53:51,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-09-08 03:53:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:51,281 INFO L225 Difference]: With dead ends: 27237 [2019-09-08 03:53:51,282 INFO L226 Difference]: Without dead ends: 16827 [2019-09-08 03:53:51,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16827 states. [2019-09-08 03:53:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16827 to 13986. [2019-09-08 03:53:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13986 states. [2019-09-08 03:53:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13986 states to 13986 states and 21979 transitions. [2019-09-08 03:53:52,000 INFO L78 Accepts]: Start accepts. Automaton has 13986 states and 21979 transitions. Word has length 194 [2019-09-08 03:53:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:52,000 INFO L475 AbstractCegarLoop]: Abstraction has 13986 states and 21979 transitions. [2019-09-08 03:53:52,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13986 states and 21979 transitions. [2019-09-08 03:53:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 03:53:52,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:52,008 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:52,008 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:52,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash 804382502, now seen corresponding path program 1 times [2019-09-08 03:53:52,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:52,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:52,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:52,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:53:52,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:52,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:53:52,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:53:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:53:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:53:52,393 INFO L87 Difference]: Start difference. First operand 13986 states and 21979 transitions. Second operand 4 states. [2019-09-08 03:53:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:53,609 INFO L93 Difference]: Finished difference Result 27724 states and 44042 transitions. [2019-09-08 03:53:53,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:53:53,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-08 03:53:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:53,676 INFO L225 Difference]: With dead ends: 27724 [2019-09-08 03:53:53,676 INFO L226 Difference]: Without dead ends: 13847 [2019-09-08 03:53:53,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:53:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2019-09-08 03:53:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 13847. [2019-09-08 03:53:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13847 states. [2019-09-08 03:53:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13847 states to 13847 states and 21701 transitions. [2019-09-08 03:53:54,328 INFO L78 Accepts]: Start accepts. Automaton has 13847 states and 21701 transitions. Word has length 194 [2019-09-08 03:53:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:54,329 INFO L475 AbstractCegarLoop]: Abstraction has 13847 states and 21701 transitions. [2019-09-08 03:53:54,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:53:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 13847 states and 21701 transitions. [2019-09-08 03:53:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 03:53:54,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:54,335 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:54,335 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash -834237155, now seen corresponding path program 1 times [2019-09-08 03:53:54,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:54,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:54,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:53:54,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:54,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:53:54,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:54,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:54,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:54,502 INFO L87 Difference]: Start difference. First operand 13847 states and 21701 transitions. Second operand 6 states. [2019-09-08 03:53:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:55,570 INFO L93 Difference]: Finished difference Result 13918 states and 21824 transitions. [2019-09-08 03:53:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:53:55,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 03:53:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:55,624 INFO L225 Difference]: With dead ends: 13918 [2019-09-08 03:53:55,624 INFO L226 Difference]: Without dead ends: 13902 [2019-09-08 03:53:55,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13902 states. [2019-09-08 03:53:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13902 to 13859. [2019-09-08 03:53:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13859 states. [2019-09-08 03:53:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 21713 transitions. [2019-09-08 03:53:56,219 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 21713 transitions. Word has length 195 [2019-09-08 03:53:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:56,220 INFO L475 AbstractCegarLoop]: Abstraction has 13859 states and 21713 transitions. [2019-09-08 03:53:56,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:53:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 21713 transitions. [2019-09-08 03:53:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 03:53:56,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:56,223 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:56,223 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -794202489, now seen corresponding path program 1 times [2019-09-08 03:53:56,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:56,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:56,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:56,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:56,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:53:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:53:56,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:53:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:53:56,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:56,384 INFO L87 Difference]: Start difference. First operand 13859 states and 21713 transitions. Second operand 8 states. [2019-09-08 03:53:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:56,765 INFO L93 Difference]: Finished difference Result 13883 states and 21743 transitions. [2019-09-08 03:53:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:53:56,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2019-09-08 03:53:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:56,816 INFO L225 Difference]: With dead ends: 13883 [2019-09-08 03:53:56,816 INFO L226 Difference]: Without dead ends: 13867 [2019-09-08 03:53:56,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13867 states. [2019-09-08 03:53:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13867 to 13859. [2019-09-08 03:53:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13859 states. [2019-09-08 03:53:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 21689 transitions. [2019-09-08 03:53:57,566 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 21689 transitions. Word has length 199 [2019-09-08 03:53:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:57,567 INFO L475 AbstractCegarLoop]: Abstraction has 13859 states and 21689 transitions. [2019-09-08 03:53:57,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 21689 transitions. [2019-09-08 03:53:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 03:53:57,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:57,571 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:57,571 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1316707384, now seen corresponding path program 1 times [2019-09-08 03:53:57,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:57,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:57,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:57,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:53:57,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:57,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:53:57,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:53:57,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:53:57,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:53:57,787 INFO L87 Difference]: Start difference. First operand 13859 states and 21689 transitions. Second operand 9 states. [2019-09-08 03:54:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:01,345 INFO L93 Difference]: Finished difference Result 27667 states and 43545 transitions. [2019-09-08 03:54:01,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:01,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-09-08 03:54:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:01,426 INFO L225 Difference]: With dead ends: 27667 [2019-09-08 03:54:01,426 INFO L226 Difference]: Without dead ends: 13933 [2019-09-08 03:54:01,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:54:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2019-09-08 03:54:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 13859. [2019-09-08 03:54:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13859 states. [2019-09-08 03:54:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 21665 transitions. [2019-09-08 03:54:02,374 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 21665 transitions. Word has length 219 [2019-09-08 03:54:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:02,375 INFO L475 AbstractCegarLoop]: Abstraction has 13859 states and 21665 transitions. [2019-09-08 03:54:02,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:54:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 21665 transitions. [2019-09-08 03:54:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 03:54:02,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:02,382 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 03:54:02,382 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1120146052, now seen corresponding path program 1 times [2019-09-08 03:54:02,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:02,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:02,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:02,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:02,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:54:02,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:02,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:02,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:03,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 3429 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:54:03,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:03,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:54:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:03,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:03,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 03:54:03,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:54:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:54:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:54:03,239 INFO L87 Difference]: Start difference. First operand 13859 states and 21665 transitions. Second operand 14 states. [2019-09-08 03:54:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:13,298 INFO L93 Difference]: Finished difference Result 29392 states and 46157 transitions. [2019-09-08 03:54:13,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:54:13,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 228 [2019-09-08 03:54:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:13,357 INFO L225 Difference]: With dead ends: 29392 [2019-09-08 03:54:13,357 INFO L226 Difference]: Without dead ends: 16456 [2019-09-08 03:54:13,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:54:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16456 states. [2019-09-08 03:54:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16456 to 16153. [2019-09-08 03:54:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16153 states. [2019-09-08 03:54:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16153 states to 16153 states and 24625 transitions. [2019-09-08 03:54:13,919 INFO L78 Accepts]: Start accepts. Automaton has 16153 states and 24625 transitions. Word has length 228 [2019-09-08 03:54:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:13,920 INFO L475 AbstractCegarLoop]: Abstraction has 16153 states and 24625 transitions. [2019-09-08 03:54:13,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:54:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 16153 states and 24625 transitions. [2019-09-08 03:54:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 03:54:13,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:13,928 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 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] [2019-09-08 03:54:13,928 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:13,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2013864679, now seen corresponding path program 1 times [2019-09-08 03:54:13,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:13,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:13,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:13,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:13,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-08 03:54:14,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:14,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:14,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 3481 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:54:14,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:15,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:54:15,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:54:15,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:54:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:54:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:54:15,073 INFO L87 Difference]: Start difference. First operand 16153 states and 24625 transitions. Second operand 19 states. [2019-09-08 03:54:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:28,599 INFO L93 Difference]: Finished difference Result 49837 states and 77008 transitions. [2019-09-08 03:54:28,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:54:28,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 254 [2019-09-08 03:54:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:28,761 INFO L225 Difference]: With dead ends: 49837 [2019-09-08 03:54:28,761 INFO L226 Difference]: Without dead ends: 33807 [2019-09-08 03:54:28,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:54:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33807 states. [2019-09-08 03:54:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33807 to 33499. [2019-09-08 03:54:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33499 states. [2019-09-08 03:54:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33499 states to 33499 states and 51641 transitions. [2019-09-08 03:54:30,056 INFO L78 Accepts]: Start accepts. Automaton has 33499 states and 51641 transitions. Word has length 254 [2019-09-08 03:54:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:30,057 INFO L475 AbstractCegarLoop]: Abstraction has 33499 states and 51641 transitions. [2019-09-08 03:54:30,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:54:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 33499 states and 51641 transitions. [2019-09-08 03:54:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 03:54:30,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:30,065 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 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] [2019-09-08 03:54:30,065 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash 619920153, now seen corresponding path program 1 times [2019-09-08 03:54:30,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:30,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:30,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 03:54:30,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:30,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:30,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:31,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 3482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:31,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:54:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:32,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:54:32,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:54:32,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:54:32,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:54:32,059 INFO L87 Difference]: Start difference. First operand 33499 states and 51641 transitions. Second operand 6 states. [2019-09-08 03:54:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:33,400 INFO L93 Difference]: Finished difference Result 68015 states and 106243 transitions. [2019-09-08 03:54:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:54:33,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-08 03:54:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:33,561 INFO L225 Difference]: With dead ends: 68015 [2019-09-08 03:54:33,562 INFO L226 Difference]: Without dead ends: 34019 [2019-09-08 03:54:33,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34019 states. [2019-09-08 03:54:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34019 to 33989. [2019-09-08 03:54:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33989 states. [2019-09-08 03:54:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33989 states to 33989 states and 51504 transitions. [2019-09-08 03:54:35,084 INFO L78 Accepts]: Start accepts. Automaton has 33989 states and 51504 transitions. Word has length 255 [2019-09-08 03:54:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:35,085 INFO L475 AbstractCegarLoop]: Abstraction has 33989 states and 51504 transitions. [2019-09-08 03:54:35,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 33989 states and 51504 transitions. [2019-09-08 03:54:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 03:54:35,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:35,099 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:35,099 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash -839833393, now seen corresponding path program 1 times [2019-09-08 03:54:35,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:35,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:35,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:35,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:35,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-08 03:54:35,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:35,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:35,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:35,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 4170 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:54:35,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 03:54:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:35,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 03:54:35,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:54:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:54:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:54:35,922 INFO L87 Difference]: Start difference. First operand 33989 states and 51504 transitions. Second operand 7 states. [2019-09-08 03:54:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:37,382 INFO L93 Difference]: Finished difference Result 69161 states and 105931 transitions. [2019-09-08 03:54:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:54:37,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2019-09-08 03:54:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:37,560 INFO L225 Difference]: With dead ends: 69161 [2019-09-08 03:54:37,560 INFO L226 Difference]: Without dead ends: 35289 [2019-09-08 03:54:37,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:54:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35289 states. [2019-09-08 03:54:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35289 to 35289. [2019-09-08 03:54:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35289 states. [2019-09-08 03:54:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35289 states to 35289 states and 53776 transitions. [2019-09-08 03:54:39,372 INFO L78 Accepts]: Start accepts. Automaton has 35289 states and 53776 transitions. Word has length 336 [2019-09-08 03:54:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:39,373 INFO L475 AbstractCegarLoop]: Abstraction has 35289 states and 53776 transitions. [2019-09-08 03:54:39,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:54:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 35289 states and 53776 transitions. [2019-09-08 03:54:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 03:54:39,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:39,387 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:39,387 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:39,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash 841461537, now seen corresponding path program 1 times [2019-09-08 03:54:39,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:39,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:39,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-08 03:54:39,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:39,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:39,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:40,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 4175 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:54:40,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-08 03:54:40,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:54:40,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:54:40,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:54:40,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:54:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:54:40,420 INFO L87 Difference]: Start difference. First operand 35289 states and 53776 transitions. Second operand 15 states. [2019-09-08 03:54:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:56,604 INFO L93 Difference]: Finished difference Result 135182 states and 214269 transitions. [2019-09-08 03:54:56,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:54:56,605 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-09-08 03:54:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:57,104 INFO L225 Difference]: With dead ends: 135182 [2019-09-08 03:54:57,104 INFO L226 Difference]: Without dead ends: 99439 [2019-09-08 03:54:57,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:54:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99439 states. [2019-09-08 03:55:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99439 to 96833. [2019-09-08 03:55:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96833 states. [2019-09-08 03:55:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96833 states to 96833 states and 149725 transitions. [2019-09-08 03:55:01,113 INFO L78 Accepts]: Start accepts. Automaton has 96833 states and 149725 transitions. Word has length 343 [2019-09-08 03:55:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:01,115 INFO L475 AbstractCegarLoop]: Abstraction has 96833 states and 149725 transitions. [2019-09-08 03:55:01,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:55:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 96833 states and 149725 transitions. [2019-09-08 03:55:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 03:55:01,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:01,126 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:01,126 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash 257327854, now seen corresponding path program 1 times [2019-09-08 03:55:01,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:01,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:01,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 31 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-08 03:55:01,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:01,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:01,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:01,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 3811 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:55:01,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 03:55:04,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:04,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:55:04,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:55:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:55:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:55:04,396 INFO L87 Difference]: Start difference. First operand 96833 states and 149725 transitions. Second operand 14 states. [2019-09-08 03:55:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:21,613 INFO L93 Difference]: Finished difference Result 276203 states and 447567 transitions. [2019-09-08 03:55:21,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 03:55:21,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 292 [2019-09-08 03:55:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:26,864 INFO L225 Difference]: With dead ends: 276203 [2019-09-08 03:55:26,864 INFO L226 Difference]: Without dead ends: 178905 [2019-09-08 03:55:27,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=2179, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 03:55:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178905 states. [2019-09-08 03:55:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178905 to 164189. [2019-09-08 03:55:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164189 states. [2019-09-08 03:55:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164189 states to 164189 states and 257473 transitions. [2019-09-08 03:55:34,814 INFO L78 Accepts]: Start accepts. Automaton has 164189 states and 257473 transitions. Word has length 292 [2019-09-08 03:55:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:34,815 INFO L475 AbstractCegarLoop]: Abstraction has 164189 states and 257473 transitions. [2019-09-08 03:55:34,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:55:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 164189 states and 257473 transitions. [2019-09-08 03:55:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 03:55:34,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:34,837 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:34,837 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash 917888860, now seen corresponding path program 1 times [2019-09-08 03:55:34,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:55:35,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:35,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:55:35,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:35,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 3857 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:55:35,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-08 03:55:39,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:55:39,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-09-08 03:55:39,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:55:39,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:55:39,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:55:39,674 INFO L87 Difference]: Start difference. First operand 164189 states and 257473 transitions. Second operand 15 states. [2019-09-08 03:56:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:21,621 INFO L93 Difference]: Finished difference Result 718340 states and 1173482 transitions. [2019-09-08 03:56:21,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 03:56:21,622 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2019-09-08 03:56:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:24,756 INFO L225 Difference]: With dead ends: 718340 [2019-09-08 03:56:24,756 INFO L226 Difference]: Without dead ends: 524924 [2019-09-08 03:56:25,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=634, Invalid=2906, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 03:56:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524924 states. [2019-09-08 03:57:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524924 to 426534. [2019-09-08 03:57:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426534 states. [2019-09-08 03:57:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426534 states to 426534 states and 662404 transitions. [2019-09-08 03:57:03,617 INFO L78 Accepts]: Start accepts. Automaton has 426534 states and 662404 transitions. Word has length 303 [2019-09-08 03:57:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:57:03,617 INFO L475 AbstractCegarLoop]: Abstraction has 426534 states and 662404 transitions. [2019-09-08 03:57:03,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:57:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 426534 states and 662404 transitions. [2019-09-08 03:57:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 03:57:03,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:57:03,632 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:57:03,632 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:57:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:57:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1720814574, now seen corresponding path program 1 times [2019-09-08 03:57:03,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:57:03,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:57:03,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:03,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:57:03,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:57:03,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:57:03,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:04,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 3858 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:57:04,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:57:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 03:57:04,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:57:04,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-09-08 03:57:04,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:57:04,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:57:04,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:57:04,634 INFO L87 Difference]: Start difference. First operand 426534 states and 662404 transitions. Second operand 15 states. [2019-09-08 03:59:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:59:33,714 INFO L93 Difference]: Finished difference Result 2098512 states and 3664919 transitions. [2019-09-08 03:59:33,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 03:59:33,714 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 304 [2019-09-08 03:59:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:11,517 INFO L225 Difference]: With dead ends: 2098512 [2019-09-08 04:00:11,517 INFO L226 Difference]: Without dead ends: 1629049 [2019-09-08 04:00:14,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=596, Invalid=2710, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 04:00:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629049 states.