java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:19:58,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:19:58,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:19:58,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:19:58,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:19:58,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:19:58,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:19:58,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:19:58,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:19:58,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:19:58,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:19:58,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:19:58,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:19:58,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:19:58,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:19:58,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:19:58,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:19:58,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:19:58,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:19:58,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:19:58,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:19:58,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:19:58,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:19:58,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:19:58,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:19:58,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:19:58,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:19:58,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:19:58,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:19:58,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:19:58,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:19:58,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:19:58,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:19:58,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:19:58,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:19:58,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:19:58,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:19:58,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:19:58,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:19:58,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:19:58,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:19:58,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:19:58,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:19:58,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:19:58,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:19:58,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:19:58,725 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:19:58,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:19:58,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:19:58,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:19:58,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:19:58,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:19:58,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:19:58,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:19:58,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:19:58,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:19:58,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:19:58,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:19:58,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:19:58,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:19:58,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:19:58,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:19:58,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:19:58,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:19:58,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:19:58,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:19:58,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:19:58,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:19:58,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:19:58,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:19:58,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:19:58,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:19:58,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:19:58,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:19:58,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:19:58,815 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:19:58,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c [2019-09-08 04:19:58,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd13f6649/4b12f14f01044ee1a4798910f8524f74/FLAG49ab066db [2019-09-08 04:19:59,535 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:19:59,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c [2019-09-08 04:19:59,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd13f6649/4b12f14f01044ee1a4798910f8524f74/FLAG49ab066db [2019-09-08 04:19:59,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd13f6649/4b12f14f01044ee1a4798910f8524f74 [2019-09-08 04:19:59,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:19:59,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:19:59,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:19:59,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:19:59,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:19:59,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:19:59" (1/1) ... [2019-09-08 04:19:59,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141a0718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:59, skipping insertion in model container [2019-09-08 04:19:59,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:19:59" (1/1) ... [2019-09-08 04:19:59,771 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:19:59,857 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:20:00,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:20:00,579 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:20:00,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:20:00,851 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:20:00,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00 WrapperNode [2019-09-08 04:20:00,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:20:00,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:20:00,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:20:00,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:20:00,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... [2019-09-08 04:20:00,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... [2019-09-08 04:20:00,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... [2019-09-08 04:20:00,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... [2019-09-08 04:20:00,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... [2019-09-08 04:20:01,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... [2019-09-08 04:20:01,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... [2019-09-08 04:20:01,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:20:01,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:20:01,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:20:01,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:20:01,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:20:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:20:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:20:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:20:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:20:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:20:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:20:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:20:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:20:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:20:01,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:20:01,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:20:01,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:20:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:20:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:20:01,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:20:01,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:20:01,117 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:20:01,118 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:20:01,118 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:20:01,118 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:20:01,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:20:01,119 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:20:01,119 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:20:01,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:20:01,119 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:20:01,120 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:20:01,120 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:20:01,120 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:20:01,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:20:01,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:20:01,121 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:20:01,121 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:20:01,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:20:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:20:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:20:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:20:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:20:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:20:01,123 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:20:01,123 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:20:01,123 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:20:01,123 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:20:01,123 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:20:01,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:20:01,124 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:20:01,124 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:20:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:20:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:20:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 04:20:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:20:01,125 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:20:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:20:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:20:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 04:20:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:20:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:20:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:20:01,127 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:20:01,127 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:20:01,127 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:20:01,127 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:20:01,128 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:20:01,128 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:20:01,128 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:20:01,128 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:20:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:20:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:20:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:20:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:20:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:20:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:20:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:20:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:20:01,131 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:20:01,131 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:20:01,132 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:20:01,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:20:01,132 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:20:01,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:20:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:20:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:20:01,133 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:20:01,133 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:20:01,134 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:20:01,134 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:20:01,134 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:20:01,134 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:20:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:20:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:20:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:20:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:20:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:20:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:20:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:20:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:20:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:20:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:20:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:20:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:20:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:20:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:20:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:20:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:20:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:20:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:20:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:20:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:20:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:20:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:20:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:20:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:20:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:20:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:20:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:20:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:20:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:20:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:20:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:20:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:20:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:20:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:20:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:20:01,142 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:20:01,142 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:20:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:20:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:20:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:20:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:20:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:20:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:20:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:20:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:20:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:20:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:20:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:20:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:20:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:20:01,151 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:20:01,151 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:20:01,152 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:20:01,152 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:20:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:20:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:20:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 04:20:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:20:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:20:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:20:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 04:20:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:20:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:20:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:20:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:20:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:20:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:20:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:20:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:20:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:20:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:20:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:20:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:20:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:20:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:20:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:20:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:20:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:20:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:20:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:20:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:20:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:20:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:20:03,579 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:20:03,579 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:20:03,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:20:03 BoogieIcfgContainer [2019-09-08 04:20:03,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:20:03,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:20:03,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:20:03,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:20:03,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:19:59" (1/3) ... [2019-09-08 04:20:03,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfe9df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:20:03, skipping insertion in model container [2019-09-08 04:20:03,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:20:00" (2/3) ... [2019-09-08 04:20:03,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfe9df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:20:03, skipping insertion in model container [2019-09-08 04:20:03,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:20:03" (3/3) ... [2019-09-08 04:20:03,591 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product31.cil.c [2019-09-08 04:20:03,601 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:20:03,612 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:20:03,629 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:20:03,691 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:20:03,692 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:20:03,692 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:20:03,692 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:20:03,692 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:20:03,692 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:20:03,692 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:20:03,693 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:20:03,693 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:20:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states. [2019-09-08 04:20:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:20:03,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:03,766 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:03,769 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash -734738765, now seen corresponding path program 1 times [2019-09-08 04:20:03,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:03,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:03,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:03,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:03,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:04,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:04,532 INFO L87 Difference]: Start difference. First operand 837 states. Second operand 7 states. [2019-09-08 04:20:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:04,853 INFO L93 Difference]: Finished difference Result 1353 states and 2166 transitions. [2019-09-08 04:20:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:20:04,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 04:20:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:04,896 INFO L225 Difference]: With dead ends: 1353 [2019-09-08 04:20:04,896 INFO L226 Difference]: Without dead ends: 685 [2019-09-08 04:20:04,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:20:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-08 04:20:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 683. [2019-09-08 04:20:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-08 04:20:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1078 transitions. [2019-09-08 04:20:05,068 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1078 transitions. Word has length 141 [2019-09-08 04:20:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:05,069 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 1078 transitions. [2019-09-08 04:20:05,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1078 transitions. [2019-09-08 04:20:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:20:05,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:05,078 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:05,078 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash -843585886, now seen corresponding path program 1 times [2019-09-08 04:20:05,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:05,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:05,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:05,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:05,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:20:05,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:20:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:20:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:20:05,300 INFO L87 Difference]: Start difference. First operand 683 states and 1078 transitions. Second operand 4 states. [2019-09-08 04:20:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:05,368 INFO L93 Difference]: Finished difference Result 1332 states and 2121 transitions. [2019-09-08 04:20:05,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:20:05,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-08 04:20:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:05,374 INFO L225 Difference]: With dead ends: 1332 [2019-09-08 04:20:05,375 INFO L226 Difference]: Without dead ends: 665 [2019-09-08 04:20:05,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-08 04:20:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2019-09-08 04:20:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-08 04:20:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1045 transitions. [2019-09-08 04:20:05,420 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1045 transitions. Word has length 142 [2019-09-08 04:20:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:05,426 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 1045 transitions. [2019-09-08 04:20:05,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:20:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1045 transitions. [2019-09-08 04:20:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:20:05,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:05,439 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:05,439 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash -71062830, now seen corresponding path program 1 times [2019-09-08 04:20:05,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:05,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:05,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:05,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:05,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:05,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:05,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:05,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:05,800 INFO L87 Difference]: Start difference. First operand 665 states and 1045 transitions. Second operand 7 states. [2019-09-08 04:20:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:05,917 INFO L93 Difference]: Finished difference Result 1301 states and 2063 transitions. [2019-09-08 04:20:05,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:20:05,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-08 04:20:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:05,922 INFO L225 Difference]: With dead ends: 1301 [2019-09-08 04:20:05,923 INFO L226 Difference]: Without dead ends: 659 [2019-09-08 04:20:05,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:20:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-08 04:20:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-09-08 04:20:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-08 04:20:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1032 transitions. [2019-09-08 04:20:05,951 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1032 transitions. Word has length 142 [2019-09-08 04:20:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:05,951 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 1032 transitions. [2019-09-08 04:20:05,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1032 transitions. [2019-09-08 04:20:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:20:05,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:05,956 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:05,956 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:05,956 INFO L82 PathProgramCache]: Analyzing trace with hash 406921655, now seen corresponding path program 1 times [2019-09-08 04:20:05,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:05,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:05,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:05,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:05,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:06,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:06,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:06,108 INFO L87 Difference]: Start difference. First operand 659 states and 1032 transitions. Second operand 7 states. [2019-09-08 04:20:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:06,239 INFO L93 Difference]: Finished difference Result 1289 states and 2037 transitions. [2019-09-08 04:20:06,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:20:06,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 04:20:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:06,248 INFO L225 Difference]: With dead ends: 1289 [2019-09-08 04:20:06,248 INFO L226 Difference]: Without dead ends: 653 [2019-09-08 04:20:06,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:20:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-08 04:20:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-09-08 04:20:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-08 04:20:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1019 transitions. [2019-09-08 04:20:06,290 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1019 transitions. Word has length 143 [2019-09-08 04:20:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:06,290 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 1019 transitions. [2019-09-08 04:20:06,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1019 transitions. [2019-09-08 04:20:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:20:06,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:06,298 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:20:06,298 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash -576561514, now seen corresponding path program 1 times [2019-09-08 04:20:06,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:06,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:06,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:06,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:06,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:06,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:06,472 INFO L87 Difference]: Start difference. First operand 653 states and 1019 transitions. Second operand 7 states. [2019-09-08 04:20:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:06,584 INFO L93 Difference]: Finished difference Result 1277 states and 2011 transitions. [2019-09-08 04:20:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:20:06,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-09-08 04:20:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:06,603 INFO L225 Difference]: With dead ends: 1277 [2019-09-08 04:20:06,603 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 04:20:06,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:20:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 04:20:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-08 04:20:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-08 04:20:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1006 transitions. [2019-09-08 04:20:06,639 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1006 transitions. Word has length 144 [2019-09-08 04:20:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:06,640 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1006 transitions. [2019-09-08 04:20:06,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1006 transitions. [2019-09-08 04:20:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:20:06,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:06,645 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:20:06,645 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1815508329, now seen corresponding path program 1 times [2019-09-08 04:20:06,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:06,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:06,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:06,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:06,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:06,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:06,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:06,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:06,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:06,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:06,892 INFO L87 Difference]: Start difference. First operand 647 states and 1006 transitions. Second operand 7 states. [2019-09-08 04:20:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:06,975 INFO L93 Difference]: Finished difference Result 1265 states and 1985 transitions. [2019-09-08 04:20:06,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:20:06,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-09-08 04:20:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:06,982 INFO L225 Difference]: With dead ends: 1265 [2019-09-08 04:20:06,982 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 04:20:06,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:20:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 04:20:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-08 04:20:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-08 04:20:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1005 transitions. [2019-09-08 04:20:07,013 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1005 transitions. Word has length 144 [2019-09-08 04:20:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:07,016 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1005 transitions. [2019-09-08 04:20:07,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1005 transitions. [2019-09-08 04:20:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:20:07,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:07,020 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:20:07,021 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash 379098299, now seen corresponding path program 1 times [2019-09-08 04:20:07,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:07,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:07,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:07,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:20:07,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:20:07,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:20:07,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:07,168 INFO L87 Difference]: Start difference. First operand 647 states and 1005 transitions. Second operand 5 states. [2019-09-08 04:20:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:07,252 INFO L93 Difference]: Finished difference Result 1264 states and 1982 transitions. [2019-09-08 04:20:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:07,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-08 04:20:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:07,258 INFO L225 Difference]: With dead ends: 1264 [2019-09-08 04:20:07,258 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 04:20:07,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:20:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 04:20:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-08 04:20:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-08 04:20:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1004 transitions. [2019-09-08 04:20:07,288 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1004 transitions. Word has length 145 [2019-09-08 04:20:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:07,289 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1004 transitions. [2019-09-08 04:20:07,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:20:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1004 transitions. [2019-09-08 04:20:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 04:20:07,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:07,295 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:20:07,296 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1077265188, now seen corresponding path program 1 times [2019-09-08 04:20:07,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:07,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:07,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:20:07,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:20:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:20:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:07,442 INFO L87 Difference]: Start difference. First operand 647 states and 1004 transitions. Second operand 5 states. [2019-09-08 04:20:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:07,524 INFO L93 Difference]: Finished difference Result 1264 states and 1980 transitions. [2019-09-08 04:20:07,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:07,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-08 04:20:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:07,530 INFO L225 Difference]: With dead ends: 1264 [2019-09-08 04:20:07,531 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 04:20:07,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:20:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 04:20:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-08 04:20:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-08 04:20:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1003 transitions. [2019-09-08 04:20:07,564 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1003 transitions. Word has length 146 [2019-09-08 04:20:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:07,565 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1003 transitions. [2019-09-08 04:20:07,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:20:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1003 transitions. [2019-09-08 04:20:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 04:20:07,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:07,569 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:07,570 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1621721034, now seen corresponding path program 1 times [2019-09-08 04:20:07,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:07,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:07,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:07,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:20:07,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:20:07,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:20:07,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:07,753 INFO L87 Difference]: Start difference. First operand 647 states and 1003 transitions. Second operand 5 states. [2019-09-08 04:20:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:07,819 INFO L93 Difference]: Finished difference Result 1264 states and 1978 transitions. [2019-09-08 04:20:07,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:07,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-08 04:20:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:07,825 INFO L225 Difference]: With dead ends: 1264 [2019-09-08 04:20:07,825 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 04:20:07,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:20:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 04:20:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-08 04:20:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-08 04:20:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1002 transitions. [2019-09-08 04:20:07,852 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1002 transitions. Word has length 147 [2019-09-08 04:20:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:07,853 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1002 transitions. [2019-09-08 04:20:07,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:20:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1002 transitions. [2019-09-08 04:20:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 04:20:07,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:07,858 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:20:07,858 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:07,858 INFO L82 PathProgramCache]: Analyzing trace with hash 333156215, now seen corresponding path program 1 times [2019-09-08 04:20:07,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:07,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:07,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:07,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:20:07,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:20:07,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:20:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:07,989 INFO L87 Difference]: Start difference. First operand 647 states and 1002 transitions. Second operand 5 states. [2019-09-08 04:20:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:08,051 INFO L93 Difference]: Finished difference Result 1264 states and 1976 transitions. [2019-09-08 04:20:08,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:08,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-08 04:20:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:08,057 INFO L225 Difference]: With dead ends: 1264 [2019-09-08 04:20:08,058 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 04:20:08,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:20:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 04:20:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-09-08 04:20:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-08 04:20:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1001 transitions. [2019-09-08 04:20:08,083 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1001 transitions. Word has length 148 [2019-09-08 04:20:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:08,083 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1001 transitions. [2019-09-08 04:20:08,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:20:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1001 transitions. [2019-09-08 04:20:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 04:20:08,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:08,088 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:08,089 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1837019215, now seen corresponding path program 1 times [2019-09-08 04:20:08,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:08,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:08,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:08,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:08,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:20:08,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:20:08,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:20:08,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:08,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:20:08,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:20:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:20:09,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:20:09,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:20:09,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:20:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:20:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:20:09,112 INFO L87 Difference]: Start difference. First operand 647 states and 1001 transitions. Second operand 12 states. [2019-09-08 04:20:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:15,707 INFO L93 Difference]: Finished difference Result 3645 states and 5844 transitions. [2019-09-08 04:20:15,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:20:15,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2019-09-08 04:20:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:15,731 INFO L225 Difference]: With dead ends: 3645 [2019-09-08 04:20:15,731 INFO L226 Difference]: Without dead ends: 3032 [2019-09-08 04:20:15,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:20:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-09-08 04:20:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2898. [2019-09-08 04:20:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-09-08 04:20:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4583 transitions. [2019-09-08 04:20:15,886 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4583 transitions. Word has length 149 [2019-09-08 04:20:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:15,887 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4583 transitions. [2019-09-08 04:20:15,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:20:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4583 transitions. [2019-09-08 04:20:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 04:20:15,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:15,894 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:15,894 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:15,894 INFO L82 PathProgramCache]: Analyzing trace with hash 392378366, now seen corresponding path program 1 times [2019-09-08 04:20:15,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:15,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:16,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:16,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:16,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:16,051 INFO L87 Difference]: Start difference. First operand 2898 states and 4583 transitions. Second operand 7 states. [2019-09-08 04:20:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:18,963 INFO L93 Difference]: Finished difference Result 8580 states and 13922 transitions. [2019-09-08 04:20:18,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:20:18,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-08 04:20:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:19,009 INFO L225 Difference]: With dead ends: 8580 [2019-09-08 04:20:19,009 INFO L226 Difference]: Without dead ends: 5716 [2019-09-08 04:20:19,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:20:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-09-08 04:20:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5620. [2019-09-08 04:20:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5620 states. [2019-09-08 04:20:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 8967 transitions. [2019-09-08 04:20:19,353 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 8967 transitions. Word has length 153 [2019-09-08 04:20:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:19,354 INFO L475 AbstractCegarLoop]: Abstraction has 5620 states and 8967 transitions. [2019-09-08 04:20:19,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 8967 transitions. [2019-09-08 04:20:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:20:19,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:19,362 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:19,362 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1167003307, now seen corresponding path program 1 times [2019-09-08 04:20:19,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:19,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:19,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:19,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:20:19,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:20:19,718 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 04:20:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:20,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 3066 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:20:20,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:20:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:20:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:20:20,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 04:20:20,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:20:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:20:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:20:20,234 INFO L87 Difference]: Start difference. First operand 5620 states and 8967 transitions. Second operand 9 states. [2019-09-08 04:20:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:24,829 INFO L93 Difference]: Finished difference Result 20122 states and 32565 transitions. [2019-09-08 04:20:24,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:20:24,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-09-08 04:20:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:24,980 INFO L225 Difference]: With dead ends: 20122 [2019-09-08 04:20:24,980 INFO L226 Difference]: Without dead ends: 14536 [2019-09-08 04:20:25,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-09-08 04:20:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14536 states. [2019-09-08 04:20:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14536 to 9760. [2019-09-08 04:20:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9760 states. [2019-09-08 04:20:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 15378 transitions. [2019-09-08 04:20:26,360 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 15378 transitions. Word has length 150 [2019-09-08 04:20:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:26,361 INFO L475 AbstractCegarLoop]: Abstraction has 9760 states and 15378 transitions. [2019-09-08 04:20:26,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:20:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 15378 transitions. [2019-09-08 04:20:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 04:20:26,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:26,366 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:26,366 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash 672411, now seen corresponding path program 1 times [2019-09-08 04:20:26,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:26,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:26,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:26,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:26,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:20:26,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:26,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:20:26,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:20:26,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:20:26,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:20:26,530 INFO L87 Difference]: Start difference. First operand 9760 states and 15378 transitions. Second operand 4 states. [2019-09-08 04:20:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:26,946 INFO L93 Difference]: Finished difference Result 19055 states and 30349 transitions. [2019-09-08 04:20:26,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:26,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-08 04:20:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:27,010 INFO L225 Difference]: With dead ends: 19055 [2019-09-08 04:20:27,011 INFO L226 Difference]: Without dead ends: 9317 [2019-09-08 04:20:27,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2019-09-08 04:20:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9259. [2019-09-08 04:20:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9259 states. [2019-09-08 04:20:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9259 states to 9259 states and 14570 transitions. [2019-09-08 04:20:27,542 INFO L78 Accepts]: Start accepts. Automaton has 9259 states and 14570 transitions. Word has length 153 [2019-09-08 04:20:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:27,543 INFO L475 AbstractCegarLoop]: Abstraction has 9259 states and 14570 transitions. [2019-09-08 04:20:27,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:20:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9259 states and 14570 transitions. [2019-09-08 04:20:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:20:27,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:27,548 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:27,548 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1409498317, now seen corresponding path program 1 times [2019-09-08 04:20:27,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:27,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 04:20:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:27,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:27,744 INFO L87 Difference]: Start difference. First operand 9259 states and 14570 transitions. Second operand 7 states. [2019-09-08 04:20:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:30,920 INFO L93 Difference]: Finished difference Result 27658 states and 44655 transitions. [2019-09-08 04:20:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:20:30,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-08 04:20:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:31,061 INFO L225 Difference]: With dead ends: 27658 [2019-09-08 04:20:31,061 INFO L226 Difference]: Without dead ends: 18433 [2019-09-08 04:20:31,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:20:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18433 states. [2019-09-08 04:20:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18433 to 18301. [2019-09-08 04:20:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18301 states. [2019-09-08 04:20:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18301 states to 18301 states and 29161 transitions. [2019-09-08 04:20:32,132 INFO L78 Accepts]: Start accepts. Automaton has 18301 states and 29161 transitions. Word has length 161 [2019-09-08 04:20:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:32,133 INFO L475 AbstractCegarLoop]: Abstraction has 18301 states and 29161 transitions. [2019-09-08 04:20:32,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 18301 states and 29161 transitions. [2019-09-08 04:20:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:20:32,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:32,138 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:20:32,138 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1208852276, now seen corresponding path program 1 times [2019-09-08 04:20:32,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:32,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:32,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:20:32,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:32,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:20:32,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:20:32,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:20:32,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:20:32,267 INFO L87 Difference]: Start difference. First operand 18301 states and 29161 transitions. Second operand 4 states. [2019-09-08 04:20:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:32,805 INFO L93 Difference]: Finished difference Result 36189 states and 58382 transitions. [2019-09-08 04:20:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:32,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-08 04:20:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:32,918 INFO L225 Difference]: With dead ends: 36189 [2019-09-08 04:20:32,919 INFO L226 Difference]: Without dead ends: 17910 [2019-09-08 04:20:32,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2019-09-08 04:20:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 17826. [2019-09-08 04:20:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-09-08 04:20:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 28360 transitions. [2019-09-08 04:20:34,583 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 28360 transitions. Word has length 162 [2019-09-08 04:20:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:34,584 INFO L475 AbstractCegarLoop]: Abstraction has 17826 states and 28360 transitions. [2019-09-08 04:20:34,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:20:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 28360 transitions. [2019-09-08 04:20:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 04:20:34,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:34,589 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:34,590 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:34,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1184889081, now seen corresponding path program 1 times [2019-09-08 04:20:34,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:34,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:34,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:20:34,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:34,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:34,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:34,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:34,735 INFO L87 Difference]: Start difference. First operand 17826 states and 28360 transitions. Second operand 7 states. [2019-09-08 04:20:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:38,103 INFO L93 Difference]: Finished difference Result 53500 states and 87771 transitions. [2019-09-08 04:20:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:20:38,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-09-08 04:20:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:38,367 INFO L225 Difference]: With dead ends: 53500 [2019-09-08 04:20:38,367 INFO L226 Difference]: Without dead ends: 35708 [2019-09-08 04:20:38,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:20:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35708 states. [2019-09-08 04:20:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35708 to 35508. [2019-09-08 04:20:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35508 states. [2019-09-08 04:20:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35508 states to 35508 states and 57685 transitions. [2019-09-08 04:20:41,073 INFO L78 Accepts]: Start accepts. Automaton has 35508 states and 57685 transitions. Word has length 171 [2019-09-08 04:20:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:41,074 INFO L475 AbstractCegarLoop]: Abstraction has 35508 states and 57685 transitions. [2019-09-08 04:20:41,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 35508 states and 57685 transitions. [2019-09-08 04:20:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 04:20:41,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:41,079 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:41,079 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:41,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 364480526, now seen corresponding path program 1 times [2019-09-08 04:20:41,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:41,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:41,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 04:20:41,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:41,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:20:41,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:20:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:20:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:20:41,197 INFO L87 Difference]: Start difference. First operand 35508 states and 57685 transitions. Second operand 4 states. [2019-09-08 04:20:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:42,175 INFO L93 Difference]: Finished difference Result 70659 states and 116767 transitions. [2019-09-08 04:20:42,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:42,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-08 04:20:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:42,710 INFO L225 Difference]: With dead ends: 70659 [2019-09-08 04:20:42,711 INFO L226 Difference]: Without dead ends: 35173 [2019-09-08 04:20:42,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35173 states. [2019-09-08 04:20:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35173 to 35041. [2019-09-08 04:20:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35041 states. [2019-09-08 04:20:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35041 states to 35041 states and 56837 transitions. [2019-09-08 04:20:44,250 INFO L78 Accepts]: Start accepts. Automaton has 35041 states and 56837 transitions. Word has length 172 [2019-09-08 04:20:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:44,250 INFO L475 AbstractCegarLoop]: Abstraction has 35041 states and 56837 transitions. [2019-09-08 04:20:44,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:20:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 35041 states and 56837 transitions. [2019-09-08 04:20:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 04:20:44,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:44,255 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:44,255 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -315972202, now seen corresponding path program 1 times [2019-09-08 04:20:44,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:44,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:44,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 04:20:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:20:44,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:20:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:20:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:20:44,392 INFO L87 Difference]: Start difference. First operand 35041 states and 56837 transitions. Second operand 7 states. [2019-09-08 04:20:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:49,585 INFO L93 Difference]: Finished difference Result 105350 states and 178238 transitions. [2019-09-08 04:20:49,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:20:49,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-08 04:20:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:50,010 INFO L225 Difference]: With dead ends: 105350 [2019-09-08 04:20:50,011 INFO L226 Difference]: Without dead ends: 70343 [2019-09-08 04:20:50,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:20:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70343 states. [2019-09-08 04:20:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70343 to 70027. [2019-09-08 04:20:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70027 states. [2019-09-08 04:20:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70027 states to 70027 states and 117803 transitions. [2019-09-08 04:20:52,850 INFO L78 Accepts]: Start accepts. Automaton has 70027 states and 117803 transitions. Word has length 182 [2019-09-08 04:20:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:52,850 INFO L475 AbstractCegarLoop]: Abstraction has 70027 states and 117803 transitions. [2019-09-08 04:20:52,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 70027 states and 117803 transitions. [2019-09-08 04:20:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 04:20:52,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:52,855 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:52,855 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:52,855 INFO L82 PathProgramCache]: Analyzing trace with hash -460844199, now seen corresponding path program 1 times [2019-09-08 04:20:52,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:52,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:52,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:52,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:52,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 04:20:52,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:52,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:20:52,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:20:52,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:20:52,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:20:52,969 INFO L87 Difference]: Start difference. First operand 70027 states and 117803 transitions. Second operand 4 states. [2019-09-08 04:20:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:57,117 INFO L93 Difference]: Finished difference Result 139436 states and 240917 transitions. [2019-09-08 04:20:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:57,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-09-08 04:20:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:57,447 INFO L225 Difference]: With dead ends: 139436 [2019-09-08 04:20:57,447 INFO L226 Difference]: Without dead ends: 69425 [2019-09-08 04:20:57,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:20:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69425 states. [2019-09-08 04:20:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69425 to 69157. [2019-09-08 04:20:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69157 states. [2019-09-08 04:21:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69157 states to 69157 states and 116134 transitions. [2019-09-08 04:21:00,038 INFO L78 Accepts]: Start accepts. Automaton has 69157 states and 116134 transitions. Word has length 183 [2019-09-08 04:21:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:00,039 INFO L475 AbstractCegarLoop]: Abstraction has 69157 states and 116134 transitions. [2019-09-08 04:21:00,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:21:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 69157 states and 116134 transitions. [2019-09-08 04:21:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:21:00,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:00,067 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:00,068 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash 722143069, now seen corresponding path program 1 times [2019-09-08 04:21:00,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:00,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:00,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-08 04:21:00,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:21:00,306 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:21:00,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:00,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 3623 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:21:00,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:21:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:21:00,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:21:00,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:21:00,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:21:00,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:21:00,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:21:00,965 INFO L87 Difference]: Start difference. First operand 69157 states and 116134 transitions. Second operand 15 states. [2019-09-08 04:21:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:04,903 INFO L93 Difference]: Finished difference Result 138724 states and 243537 transitions. [2019-09-08 04:21:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:21:04,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2019-09-08 04:21:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:05,310 INFO L225 Difference]: With dead ends: 138724 [2019-09-08 04:21:05,310 INFO L226 Difference]: Without dead ends: 69601 [2019-09-08 04:21:08,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:21:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69601 states. [2019-09-08 04:21:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69601 to 69601. [2019-09-08 04:21:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69601 states. [2019-09-08 04:21:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69601 states to 69601 states and 116387 transitions. [2019-09-08 04:21:10,589 INFO L78 Accepts]: Start accepts. Automaton has 69601 states and 116387 transitions. Word has length 277 [2019-09-08 04:21:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:10,589 INFO L475 AbstractCegarLoop]: Abstraction has 69601 states and 116387 transitions. [2019-09-08 04:21:10,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:21:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 69601 states and 116387 transitions. [2019-09-08 04:21:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-08 04:21:10,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:10,604 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:21:10,604 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash 568373059, now seen corresponding path program 1 times [2019-09-08 04:21:10,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 23 proven. 47 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-08 04:21:11,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:21:11,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:21:11,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:11,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 4473 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:21:11,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:21:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-08 04:21:12,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:21:12,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:21:12,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:21:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:21:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:21:12,090 INFO L87 Difference]: Start difference. First operand 69601 states and 116387 transitions. Second operand 15 states. [2019-09-08 04:21:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:17,927 INFO L93 Difference]: Finished difference Result 139755 states and 243866 transitions. [2019-09-08 04:21:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:21:17,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 438 [2019-09-08 04:21:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:18,249 INFO L225 Difference]: With dead ends: 139755 [2019-09-08 04:21:18,249 INFO L226 Difference]: Without dead ends: 70188 [2019-09-08 04:21:18,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:21:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70188 states. [2019-09-08 04:21:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70188 to 70188. [2019-09-08 04:21:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70188 states. [2019-09-08 04:21:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70188 states to 70188 states and 116879 transitions. [2019-09-08 04:21:20,911 INFO L78 Accepts]: Start accepts. Automaton has 70188 states and 116879 transitions. Word has length 438 [2019-09-08 04:21:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:20,911 INFO L475 AbstractCegarLoop]: Abstraction has 70188 states and 116879 transitions. [2019-09-08 04:21:20,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:21:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 70188 states and 116879 transitions. [2019-09-08 04:21:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-08 04:21:20,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:20,935 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:20,935 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1228193699, now seen corresponding path program 1 times [2019-09-08 04:21:20,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:20,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:20,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-08 04:21:21,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:21:21,174 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) [2019-09-08 04:21:21,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:21:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:21,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 3631 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:21:21,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:21:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:21:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:21:21,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:21:21,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:21:21,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:21:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:21:21,862 INFO L87 Difference]: Start difference. First operand 70188 states and 116879 transitions. Second operand 15 states. [2019-09-08 04:21:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:25,956 INFO L93 Difference]: Finished difference Result 141040 states and 244753 transitions. [2019-09-08 04:21:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:21:25,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 285 [2019-09-08 04:21:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:26,292 INFO L225 Difference]: With dead ends: 141040 [2019-09-08 04:21:26,292 INFO L226 Difference]: Without dead ends: 70886 [2019-09-08 04:21:26,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:21:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70886 states. [2019-09-08 04:21:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70886 to 70886. [2019-09-08 04:21:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70886 states. [2019-09-08 04:21:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70886 states to 70886 states and 117530 transitions. [2019-09-08 04:21:32,563 INFO L78 Accepts]: Start accepts. Automaton has 70886 states and 117530 transitions. Word has length 285 [2019-09-08 04:21:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:32,564 INFO L475 AbstractCegarLoop]: Abstraction has 70886 states and 117530 transitions. [2019-09-08 04:21:32,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:21:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 70886 states and 117530 transitions. [2019-09-08 04:21:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 04:21:32,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:32,582 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:32,583 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:32,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1611552349, now seen corresponding path program 1 times [2019-09-08 04:21:32,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:32,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:32,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:32,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:32,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-09-08 04:21:32,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:21:32,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:21:32,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:21:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:33,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 3635 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:21:33,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:21:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:21:33,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:21:33,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:21:33,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:21:33,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:21:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:21:33,440 INFO L87 Difference]: Start difference. First operand 70886 states and 117530 transitions. Second operand 15 states. [2019-09-08 04:21:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:37,641 INFO L93 Difference]: Finished difference Result 142539 states and 246014 transitions. [2019-09-08 04:21:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:21:37,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 289 [2019-09-08 04:21:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:38,046 INFO L225 Difference]: With dead ends: 142539 [2019-09-08 04:21:38,046 INFO L226 Difference]: Without dead ends: 71687 [2019-09-08 04:21:38,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:21:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2019-09-08 04:21:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 71687. [2019-09-08 04:21:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71687 states. [2019-09-08 04:21:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71687 states to 71687 states and 118308 transitions. [2019-09-08 04:21:41,064 INFO L78 Accepts]: Start accepts. Automaton has 71687 states and 118308 transitions. Word has length 289 [2019-09-08 04:21:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:41,064 INFO L475 AbstractCegarLoop]: Abstraction has 71687 states and 118308 transitions. [2019-09-08 04:21:41,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:21:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 71687 states and 118308 transitions. [2019-09-08 04:21:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 04:21:41,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:41,081 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:21:41,081 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1965605784, now seen corresponding path program 1 times [2019-09-08 04:21:41,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:41,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:41,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:41,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:41,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-09-08 04:21:41,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:21:41,325 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:21:41,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:41,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 4488 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 04:21:41,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:21:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 264 proven. 20 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-08 04:21:42,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:21:42,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 04:21:42,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:21:42,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:21:42,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:21:42,271 INFO L87 Difference]: Start difference. First operand 71687 states and 118308 transitions. Second operand 19 states. [2019-09-08 04:22:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:41,753 INFO L93 Difference]: Finished difference Result 443265 states and 938207 transitions. [2019-09-08 04:22:41,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 04:22:41,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 453 [2019-09-08 04:22:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:44,103 INFO L225 Difference]: With dead ends: 443265 [2019-09-08 04:22:44,104 INFO L226 Difference]: Without dead ends: 353636 [2019-09-08 04:22:46,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2507 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1141, Invalid=6515, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 04:22:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353636 states. [2019-09-08 04:23:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353636 to 334622. [2019-09-08 04:23:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334622 states. [2019-09-08 04:23:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334622 states to 334622 states and 583696 transitions. [2019-09-08 04:23:22,272 INFO L78 Accepts]: Start accepts. Automaton has 334622 states and 583696 transitions. Word has length 453 [2019-09-08 04:23:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:22,273 INFO L475 AbstractCegarLoop]: Abstraction has 334622 states and 583696 transitions. [2019-09-08 04:23:22,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:23:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 334622 states and 583696 transitions. [2019-09-08 04:23:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-08 04:23:22,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:22,284 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:23:22,284 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1847362994, now seen corresponding path program 1 times [2019-09-08 04:23:22,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:22,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:22,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:22,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:22,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 23 proven. 38 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2019-09-08 04:23:23,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:23:23,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:23:23,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:24,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 4566 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 04:23:24,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:23:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-09-08 04:23:24,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:23:24,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2019-09-08 04:23:24,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 04:23:24,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 04:23:24,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:23:24,750 INFO L87 Difference]: Start difference. First operand 334622 states and 583696 transitions. Second operand 24 states. [2019-09-08 04:25:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:11,945 INFO L93 Difference]: Finished difference Result 1063489 states and 2068289 transitions. [2019-09-08 04:25:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:25:11,945 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 481 [2019-09-08 04:25:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:18,245 INFO L225 Difference]: With dead ends: 1063489 [2019-09-08 04:25:18,245 INFO L226 Difference]: Without dead ends: 728901 [2019-09-08 04:25:25,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:25:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728901 states.