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_spec9_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:35:04,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:35:04,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:35:04,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:35:04,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:35:04,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:35:04,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:35:04,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:35:04,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:35:04,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:35:04,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:35:04,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:35:04,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:35:04,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:35:04,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:35:04,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:35:04,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:35:04,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:35:04,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:35:04,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:35:04,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:35:04,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:35:04,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:35:04,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:35:04,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:35:04,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:35:04,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:35:04,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:35:04,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:35:04,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:35:04,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:35:04,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:35:04,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:35:04,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:35:04,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:35:04,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:35:04,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:35:04,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:35:04,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:35:04,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:35:04,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:35:04,648 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-10-02 12:35:04,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:35:04,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:35:04,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:35:04,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:35:04,678 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:35:04,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:35:04,679 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:35:04,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:35:04,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:35:04,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:35:04,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:35:04,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:35:04,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:35:04,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:35:04,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:35:04,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:35:04,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:35:04,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:35:04,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:35:04,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:35:04,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:35:04,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:35:04,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:35:04,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:35:04,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:35:04,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:35:04,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:35:04,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:35:04,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:35:04,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:35:04,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:35:04,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:35:04,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:35:04,763 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:35:04,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product11.cil.c [2019-10-02 12:35:04,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3270084a8/b2a6c32d0d8d4dc2a96d89e6d597a420/FLAGe476761e0 [2019-10-02 12:35:05,506 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:35:05,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product11.cil.c [2019-10-02 12:35:05,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3270084a8/b2a6c32d0d8d4dc2a96d89e6d597a420/FLAGe476761e0 [2019-10-02 12:35:05,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3270084a8/b2a6c32d0d8d4dc2a96d89e6d597a420 [2019-10-02 12:35:05,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:35:05,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:35:05,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:35:05,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:35:05,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:35:05,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:35:05" (1/1) ... [2019-10-02 12:35:05,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32777701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:05, skipping insertion in model container [2019-10-02 12:35:05,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:35:05" (1/1) ... [2019-10-02 12:35:05,685 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:35:05,778 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:35:06,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:35:06,607 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:35:06,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:35:06,862 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:35:06,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06 WrapperNode [2019-10-02 12:35:06,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:35:06,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:35:06,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:35:06,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:35:06,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (1/1) ... [2019-10-02 12:35:06,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (1/1) ... [2019-10-02 12:35:06,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (1/1) ... [2019-10-02 12:35:06,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (1/1) ... [2019-10-02 12:35:07,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (1/1) ... [2019-10-02 12:35:07,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (1/1) ... [2019-10-02 12:35:07,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (1/1) ... [2019-10-02 12:35:07,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:35:07,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:35:07,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:35:07,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:35:07,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (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-10-02 12:35:07,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:35:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:35:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:35:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:35:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:35:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:35:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:35:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:35:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:35:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:35:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:35:07,203 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:35:07,203 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:35:07,204 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:35:07,205 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:35:07,205 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:35:07,208 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:35:07,209 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:35:07,209 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:35:07,210 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:35:07,210 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:35:07,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:35:07,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:35:07,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:35:07,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:35:07,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:35:07,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:35:07,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:35:07,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:35:07,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:35:07,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:35:07,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:35:07,213 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:35:07,213 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:35:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:35:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:35:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:35:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:35:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:35:07,214 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:35:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:35:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:35:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:35:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:35:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:35:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:35:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:35:07,217 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:35:07,217 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:35:07,217 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:35:07,218 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:35:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:35:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:35:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:35:07,219 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:35:07,220 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:35:07,220 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:35:07,220 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:35:07,220 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:35:07,221 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:35:07,221 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:35:07,221 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:35:07,221 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:35:07,221 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:35:07,221 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:35:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:35:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:35:07,223 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:35:07,223 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:35:07,223 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:35:07,224 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:35:07,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:35:07,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:35:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:35:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:35:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:35:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:35:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:35:07,227 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:35:07,227 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:35:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:35:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:35:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:35:07,229 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:35:07,230 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:35:07,230 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:35:07,230 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:35:07,231 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:35:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:35:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:35:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:35:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:35:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:35:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:35:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:35:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:35:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:35:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:35:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:35:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:35:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:35:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:35:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:35:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:35:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:35:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:35:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:35:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:35:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:35:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:35:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:35:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:35:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:35:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:35:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:35:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:35:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:35:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:35:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:35:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:35:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:35:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:35:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:35:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:35:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:35:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:35:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:35:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:35:07,245 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:35:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:35:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:35:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:35:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:35:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:35:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:35:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:35:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:35:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:35:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:35:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:35:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:35:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:35:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:35:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:35:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:35:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:35:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:35:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:35:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:35:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:35:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:35:09,887 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:35:09,888 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:35:09,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:35:09 BoogieIcfgContainer [2019-10-02 12:35:09,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:35:09,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:35:09,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:35:09,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:35:09,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:35:05" (1/3) ... [2019-10-02 12:35:09,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcc8b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:35:09, skipping insertion in model container [2019-10-02 12:35:09,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:06" (2/3) ... [2019-10-02 12:35:09,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcc8b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:35:09, skipping insertion in model container [2019-10-02 12:35:09,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:35:09" (3/3) ... [2019-10-02 12:35:09,898 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product11.cil.c [2019-10-02 12:35:09,907 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:35:09,919 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:35:09,936 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:35:09,979 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:35:09,979 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:35:09,979 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:35:09,980 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:35:09,980 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:35:09,980 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:35:09,980 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:35:09,980 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:35:09,980 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:35:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states. [2019-10-02 12:35:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:35:10,069 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:10,070 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:35:10,074 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1577724025, now seen corresponding path program 1 times [2019-10-02 12:35:10,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:10,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:10,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:10,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:10,734 INFO L87 Difference]: Start difference. First operand 756 states. Second operand 4 states. [2019-10-02 12:35:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:10,936 INFO L93 Difference]: Finished difference Result 1175 states and 1903 transitions. [2019-10-02 12:35:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:35:10,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 12:35:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:10,963 INFO L225 Difference]: With dead ends: 1175 [2019-10-02 12:35:10,963 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 12:35:10,972 INFO L640 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-10-02 12:35:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 12:35:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 12:35:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:35:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 953 transitions. [2019-10-02 12:35:11,118 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 953 transitions. Word has length 135 [2019-10-02 12:35:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:11,119 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 953 transitions. [2019-10-02 12:35:11,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 953 transitions. [2019-10-02 12:35:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:35:11,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:11,136 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:11,137 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:11,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1074929416, now seen corresponding path program 1 times [2019-10-02 12:35:11,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:11,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:11,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:11,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:11,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:11,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:11,421 INFO L87 Difference]: Start difference. First operand 596 states and 953 transitions. Second operand 4 states. [2019-10-02 12:35:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:11,538 INFO L93 Difference]: Finished difference Result 1155 states and 1864 transitions. [2019-10-02 12:35:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:35:11,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:35:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:11,547 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:35:11,547 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 12:35:11,553 INFO L640 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-10-02 12:35:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 12:35:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 12:35:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:35:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 952 transitions. [2019-10-02 12:35:11,606 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 952 transitions. Word has length 138 [2019-10-02 12:35:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:11,608 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 952 transitions. [2019-10-02 12:35:11,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 952 transitions. [2019-10-02 12:35:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:35:11,620 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:11,621 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:11,621 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:11,625 INFO L82 PathProgramCache]: Analyzing trace with hash 894123030, now seen corresponding path program 1 times [2019-10-02 12:35:11,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:11,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:11,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:11,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:11,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:11,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:11,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:11,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:11,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:11,920 INFO L87 Difference]: Start difference. First operand 596 states and 952 transitions. Second operand 4 states. [2019-10-02 12:35:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:12,002 INFO L93 Difference]: Finished difference Result 1155 states and 1863 transitions. [2019-10-02 12:35:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:35:12,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 12:35:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:12,008 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:35:12,008 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 12:35:12,011 INFO L640 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-10-02 12:35:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 12:35:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 12:35:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:35:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 951 transitions. [2019-10-02 12:35:12,036 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 951 transitions. Word has length 139 [2019-10-02 12:35:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:12,037 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 951 transitions. [2019-10-02 12:35:12,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 951 transitions. [2019-10-02 12:35:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:35:12,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:12,042 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:12,042 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:12,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash 558643508, now seen corresponding path program 1 times [2019-10-02 12:35:12,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:12,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:12,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:12,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:12,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:12,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:12,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:12,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:12,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:12,181 INFO L87 Difference]: Start difference. First operand 596 states and 951 transitions. Second operand 4 states. [2019-10-02 12:35:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:12,263 INFO L93 Difference]: Finished difference Result 1155 states and 1862 transitions. [2019-10-02 12:35:12,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:35:12,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 12:35:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:12,272 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:35:12,273 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 12:35:12,276 INFO L640 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-10-02 12:35:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 12:35:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 12:35:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:35:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-10-02 12:35:12,308 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 140 [2019-10-02 12:35:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:12,309 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-10-02 12:35:12,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-10-02 12:35:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:35:12,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:12,316 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:12,316 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1797117010, now seen corresponding path program 1 times [2019-10-02 12:35:12,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:12,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:12,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:12,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:12,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:12,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:12,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:12,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:12,449 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-10-02 12:35:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:12,515 INFO L93 Difference]: Finished difference Result 1155 states and 1861 transitions. [2019-10-02 12:35:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:35:12,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-02 12:35:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:12,521 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:35:12,521 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 12:35:12,525 INFO L640 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-10-02 12:35:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 12:35:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 12:35:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:35:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 949 transitions. [2019-10-02 12:35:12,550 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 949 transitions. Word has length 141 [2019-10-02 12:35:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:12,551 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 949 transitions. [2019-10-02 12:35:12,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 949 transitions. [2019-10-02 12:35:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:35:12,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:12,556 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:12,556 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:12,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2124369551, now seen corresponding path program 1 times [2019-10-02 12:35:12,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:12,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:12,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:12,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:12,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:35:12,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:35:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:35:12,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:35:12,745 INFO L87 Difference]: Start difference. First operand 596 states and 949 transitions. Second operand 4 states. [2019-10-02 12:35:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:12,804 INFO L93 Difference]: Finished difference Result 1155 states and 1860 transitions. [2019-10-02 12:35:12,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:35:12,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-02 12:35:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:12,813 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:35:12,813 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 12:35:12,820 INFO L640 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-10-02 12:35:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 12:35:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 12:35:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:35:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 948 transitions. [2019-10-02 12:35:12,844 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 948 transitions. Word has length 142 [2019-10-02 12:35:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:12,844 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 948 transitions. [2019-10-02 12:35:12,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 948 transitions. [2019-10-02 12:35:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:35:12,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:12,849 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:12,849 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash 288526704, now seen corresponding path program 1 times [2019-10-02 12:35:12,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:12,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:12,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:12,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:35:13,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:35:13,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:35:13,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:35:13,053 INFO L87 Difference]: Start difference. First operand 596 states and 948 transitions. Second operand 10 states. [2019-10-02 12:35:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:13,211 INFO L93 Difference]: Finished difference Result 1107 states and 1772 transitions. [2019-10-02 12:35:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:13,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-10-02 12:35:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:13,221 INFO L225 Difference]: With dead ends: 1107 [2019-10-02 12:35:13,221 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:35:13,224 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:35:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:35:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:35:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:35:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 935 transitions. [2019-10-02 12:35:13,257 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 935 transitions. Word has length 142 [2019-10-02 12:35:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:13,258 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 935 transitions. [2019-10-02 12:35:13,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:35:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 935 transitions. [2019-10-02 12:35:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:35:13,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:13,265 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:13,266 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:13,266 INFO L82 PathProgramCache]: Analyzing trace with hash 647383892, now seen corresponding path program 1 times [2019-10-02 12:35:13,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:13,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:13,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:13,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:35:13,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:35:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:35:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:35:13,585 INFO L87 Difference]: Start difference. First operand 590 states and 935 transitions. Second operand 6 states. [2019-10-02 12:35:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:13,838 INFO L93 Difference]: Finished difference Result 1101 states and 1759 transitions. [2019-10-02 12:35:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:35:13,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:35:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:13,844 INFO L225 Difference]: With dead ends: 1101 [2019-10-02 12:35:13,844 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:35:13,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:35:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:35:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:35:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:35:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 931 transitions. [2019-10-02 12:35:13,870 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 931 transitions. Word has length 143 [2019-10-02 12:35:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:13,872 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 931 transitions. [2019-10-02 12:35:13,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:35:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 931 transitions. [2019-10-02 12:35:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:35:13,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:13,879 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:13,879 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2083725933, now seen corresponding path program 1 times [2019-10-02 12:35:13,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:13,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:13,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:13,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:14,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:14,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:35:14,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:35:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:35:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:35:14,035 INFO L87 Difference]: Start difference. First operand 590 states and 931 transitions. Second operand 6 states. [2019-10-02 12:35:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:14,251 INFO L93 Difference]: Finished difference Result 1101 states and 1755 transitions. [2019-10-02 12:35:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:35:14,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:35:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:14,256 INFO L225 Difference]: With dead ends: 1101 [2019-10-02 12:35:14,256 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:35:14,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:35:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:35:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:35:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:35:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-10-02 12:35:14,291 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 144 [2019-10-02 12:35:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:14,291 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-10-02 12:35:14,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:35:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-10-02 12:35:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:35:14,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:14,296 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:14,296 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:14,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1728817657, now seen corresponding path program 1 times [2019-10-02 12:35:14,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:14,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:14,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:14,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:14,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:14,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:14,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:35:14,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:35:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:35:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:35:14,459 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-10-02 12:35:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:14,663 INFO L93 Difference]: Finished difference Result 1101 states and 1751 transitions. [2019-10-02 12:35:14,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:35:14,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:35:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:14,669 INFO L225 Difference]: With dead ends: 1101 [2019-10-02 12:35:14,669 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 12:35:14,673 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:35:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 12:35:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 12:35:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 12:35:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 923 transitions. [2019-10-02 12:35:14,732 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 923 transitions. Word has length 145 [2019-10-02 12:35:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:14,732 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 923 transitions. [2019-10-02 12:35:14,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:35:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 923 transitions. [2019-10-02 12:35:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:35:14,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:14,738 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:14,738 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1465419385, now seen corresponding path program 1 times [2019-10-02 12:35:14,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:14,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:14,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:14,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:14,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:14,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:14,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:35:14,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:14,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:14,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:14,873 INFO L87 Difference]: Start difference. First operand 590 states and 923 transitions. Second operand 7 states. [2019-10-02 12:35:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:14,963 INFO L93 Difference]: Finished difference Result 1101 states and 1747 transitions. [2019-10-02 12:35:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:35:14,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-02 12:35:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:14,968 INFO L225 Difference]: With dead ends: 1101 [2019-10-02 12:35:14,968 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 12:35:14,971 INFO L640 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-10-02 12:35:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 12:35:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-02 12:35:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 12:35:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 889 transitions. [2019-10-02 12:35:14,990 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 889 transitions. Word has length 145 [2019-10-02 12:35:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:14,990 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 889 transitions. [2019-10-02 12:35:14,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 889 transitions. [2019-10-02 12:35:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:35:14,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:14,995 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:14,995 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2058780392, now seen corresponding path program 1 times [2019-10-02 12:35:14,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:14,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:14,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:15,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:15,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:35:15,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:35:15,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:35:15,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:35:15,121 INFO L87 Difference]: Start difference. First operand 569 states and 889 transitions. Second operand 6 states. [2019-10-02 12:35:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:15,220 INFO L93 Difference]: Finished difference Result 1080 states and 1713 transitions. [2019-10-02 12:35:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:35:15,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 12:35:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:15,226 INFO L225 Difference]: With dead ends: 1080 [2019-10-02 12:35:15,226 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 12:35:15,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:35:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 12:35:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-02 12:35:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 12:35:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 888 transitions. [2019-10-02 12:35:15,246 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 888 transitions. Word has length 146 [2019-10-02 12:35:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:15,247 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 888 transitions. [2019-10-02 12:35:15,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:35:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 888 transitions. [2019-10-02 12:35:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:35:15,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:15,251 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:35:15,251 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash -932600674, now seen corresponding path program 1 times [2019-10-02 12:35:15,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:15,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:15,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:15,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:15,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:15,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:35:15,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:35:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:35:15,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:35:15,373 INFO L87 Difference]: Start difference. First operand 569 states and 888 transitions. Second operand 6 states. [2019-10-02 12:35:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:15,472 INFO L93 Difference]: Finished difference Result 1080 states and 1712 transitions. [2019-10-02 12:35:15,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:35:15,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-02 12:35:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:15,477 INFO L225 Difference]: With dead ends: 1080 [2019-10-02 12:35:15,477 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 12:35:15,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:35:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 12:35:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-02 12:35:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 12:35:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 887 transitions. [2019-10-02 12:35:15,527 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 887 transitions. Word has length 147 [2019-10-02 12:35:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:15,529 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 887 transitions. [2019-10-02 12:35:15,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:35:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 887 transitions. [2019-10-02 12:35:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:35:15,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:15,533 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:15,534 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2098132835, now seen corresponding path program 1 times [2019-10-02 12:35:15,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:15,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:15,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:15,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:35:15,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:35:15,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:35:15,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:35:15,745 INFO L87 Difference]: Start difference. First operand 569 states and 887 transitions. Second operand 12 states. [2019-10-02 12:35:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:16,036 INFO L93 Difference]: Finished difference Result 1081 states and 1711 transitions. [2019-10-02 12:35:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:35:16,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-10-02 12:35:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:16,041 INFO L225 Difference]: With dead ends: 1081 [2019-10-02 12:35:16,041 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 12:35:16,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:35:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 12:35:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-02 12:35:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 12:35:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 886 transitions. [2019-10-02 12:35:16,063 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 886 transitions. Word has length 148 [2019-10-02 12:35:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:16,064 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 886 transitions. [2019-10-02 12:35:16,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:35:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 886 transitions. [2019-10-02 12:35:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:35:16,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:16,071 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:35:16,072 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1812854929, now seen corresponding path program 1 times [2019-10-02 12:35:16,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:16,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:16,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:16,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:35:16,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:16,271 INFO L224 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-10-02 12:35:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:16,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:35:16,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:35:17,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:17,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:35:17,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:17,071 INFO L87 Difference]: Start difference. First operand 569 states and 886 transitions. Second operand 7 states. [2019-10-02 12:35:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:18,579 INFO L93 Difference]: Finished difference Result 1574 states and 2576 transitions. [2019-10-02 12:35:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:18,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-10-02 12:35:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:18,595 INFO L225 Difference]: With dead ends: 1574 [2019-10-02 12:35:18,596 INFO L226 Difference]: Without dead ends: 1071 [2019-10-02 12:35:18,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:35:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-02 12:35:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1069. [2019-10-02 12:35:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-02 12:35:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1705 transitions. [2019-10-02 12:35:18,673 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1705 transitions. Word has length 149 [2019-10-02 12:35:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:18,673 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1705 transitions. [2019-10-02 12:35:18,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1705 transitions. [2019-10-02 12:35:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:35:18,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:18,679 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:18,679 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1294937315, now seen corresponding path program 1 times [2019-10-02 12:35:18,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:18,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:18,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:18,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:18,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:35:18,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:18,878 INFO L224 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-10-02 12:35:19,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:19,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:35:19,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:35:19,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:19,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:35:19,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:19,694 INFO L87 Difference]: Start difference. First operand 1069 states and 1705 transitions. Second operand 7 states. [2019-10-02 12:35:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:21,167 INFO L93 Difference]: Finished difference Result 3088 states and 5115 transitions. [2019-10-02 12:35:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:21,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-10-02 12:35:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:21,192 INFO L225 Difference]: With dead ends: 3088 [2019-10-02 12:35:21,192 INFO L226 Difference]: Without dead ends: 2085 [2019-10-02 12:35:21,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:35:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2019-10-02 12:35:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2082. [2019-10-02 12:35:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-10-02 12:35:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3373 transitions. [2019-10-02 12:35:21,327 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3373 transitions. Word has length 152 [2019-10-02 12:35:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:21,328 INFO L475 AbstractCegarLoop]: Abstraction has 2082 states and 3373 transitions. [2019-10-02 12:35:21,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3373 transitions. [2019-10-02 12:35:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:35:21,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:21,334 INFO L411 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, 1, 1] [2019-10-02 12:35:21,335 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 712731539, now seen corresponding path program 1 times [2019-10-02 12:35:21,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:21,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:21,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:21,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:35:21,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:21,572 INFO L224 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-10-02 12:35:21,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:22,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 2770 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:35:22,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:35:22,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:22,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:35:22,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:22,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:22,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:22,215 INFO L87 Difference]: Start difference. First operand 2082 states and 3373 transitions. Second operand 7 states. [2019-10-02 12:35:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:23,853 INFO L93 Difference]: Finished difference Result 6157 states and 10306 transitions. [2019-10-02 12:35:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:23,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-10-02 12:35:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:23,890 INFO L225 Difference]: With dead ends: 6157 [2019-10-02 12:35:23,890 INFO L226 Difference]: Without dead ends: 4141 [2019-10-02 12:35:23,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:35:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2019-10-02 12:35:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4137. [2019-10-02 12:35:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-10-02 12:35:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 6787 transitions. [2019-10-02 12:35:24,124 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 6787 transitions. Word has length 155 [2019-10-02 12:35:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:24,124 INFO L475 AbstractCegarLoop]: Abstraction has 4137 states and 6787 transitions. [2019-10-02 12:35:24,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 6787 transitions. [2019-10-02 12:35:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:35:24,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:24,130 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:35:24,131 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash 489400109, now seen corresponding path program 1 times [2019-10-02 12:35:24,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:24,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:24,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:35:24,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:24,340 INFO L224 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-10-02 12:35:24,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:24,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 2774 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:35:24,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:35:25,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:25,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:35:25,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:35:25,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:35:25,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:35:25,012 INFO L87 Difference]: Start difference. First operand 4137 states and 6787 transitions. Second operand 7 states. [2019-10-02 12:35:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:26,801 INFO L93 Difference]: Finished difference Result 12388 states and 21025 transitions. [2019-10-02 12:35:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:35:26,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-02 12:35:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:26,868 INFO L225 Difference]: With dead ends: 12388 [2019-10-02 12:35:26,869 INFO L226 Difference]: Without dead ends: 8317 [2019-10-02 12:35:26,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:35:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8317 states. [2019-10-02 12:35:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8317 to 8312. [2019-10-02 12:35:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8312 states. [2019-10-02 12:35:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8312 states to 8312 states and 13837 transitions. [2019-10-02 12:35:27,263 INFO L78 Accepts]: Start accepts. Automaton has 8312 states and 13837 transitions. Word has length 158 [2019-10-02 12:35:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:27,264 INFO L475 AbstractCegarLoop]: Abstraction has 8312 states and 13837 transitions. [2019-10-02 12:35:27,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:35:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 8312 states and 13837 transitions. [2019-10-02 12:35:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:35:27,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:27,271 INFO L411 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-10-02 12:35:27,271 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1719962475, now seen corresponding path program 1 times [2019-10-02 12:35:27,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:27,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:27,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:35:27,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:27,541 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:35:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:28,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 2778 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:35:28,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:35:28,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:28,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:35:28,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:35:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:35:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:35:28,336 INFO L87 Difference]: Start difference. First operand 8312 states and 13837 transitions. Second operand 12 states. [2019-10-02 12:35:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:45,351 INFO L93 Difference]: Finished difference Result 43863 states and 79561 transitions. [2019-10-02 12:35:45,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 12:35:45,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2019-10-02 12:35:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:45,615 INFO L225 Difference]: With dead ends: 43863 [2019-10-02 12:35:45,615 INFO L226 Difference]: Without dead ends: 35593 [2019-10-02 12:35:45,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:35:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35593 states. [2019-10-02 12:35:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35593 to 35076. [2019-10-02 12:35:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35076 states. [2019-10-02 12:35:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35076 states to 35076 states and 63147 transitions. [2019-10-02 12:35:48,402 INFO L78 Accepts]: Start accepts. Automaton has 35076 states and 63147 transitions. Word has length 161 [2019-10-02 12:35:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:48,402 INFO L475 AbstractCegarLoop]: Abstraction has 35076 states and 63147 transitions. [2019-10-02 12:35:48,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:35:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35076 states and 63147 transitions. [2019-10-02 12:35:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 12:35:48,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:48,474 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:35:48,474 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:48,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1424538458, now seen corresponding path program 1 times [2019-10-02 12:35:48,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:48,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:48,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:48,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:48,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-02 12:35:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:35:49,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:35:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:35:49,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:35:49,005 INFO L87 Difference]: Start difference. First operand 35076 states and 63147 transitions. Second operand 9 states. [2019-10-02 12:35:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:49,603 INFO L93 Difference]: Finished difference Result 51400 states and 91147 transitions. [2019-10-02 12:35:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:35:49,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 342 [2019-10-02 12:35:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:49,704 INFO L225 Difference]: With dead ends: 51400 [2019-10-02 12:35:49,704 INFO L226 Difference]: Without dead ends: 16378 [2019-10-02 12:35:49,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:35:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16378 states. [2019-10-02 12:35:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16378 to 16378. [2019-10-02 12:35:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-10-02 12:35:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 28055 transitions. [2019-10-02 12:35:52,125 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 28055 transitions. Word has length 342 [2019-10-02 12:35:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:52,129 INFO L475 AbstractCegarLoop]: Abstraction has 16378 states and 28055 transitions. [2019-10-02 12:35:52,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:35:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 28055 transitions. [2019-10-02 12:35:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 12:35:52,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:52,145 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:52,146 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:52,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:52,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1194573026, now seen corresponding path program 1 times [2019-10-02 12:35:52,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:52,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:52,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:52,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-02 12:35:52,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:52,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:35:52,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:35:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:35:52,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:35:52,395 INFO L87 Difference]: Start difference. First operand 16378 states and 28055 transitions. Second operand 9 states. [2019-10-02 12:35:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:57,156 INFO L93 Difference]: Finished difference Result 32885 states and 57486 transitions. [2019-10-02 12:35:57,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:35:57,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 234 [2019-10-02 12:35:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:57,300 INFO L225 Difference]: With dead ends: 32885 [2019-10-02 12:35:57,300 INFO L226 Difference]: Without dead ends: 16570 [2019-10-02 12:35:57,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:35:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16570 states. [2019-10-02 12:35:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16570 to 16506. [2019-10-02 12:35:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16506 states. [2019-10-02 12:35:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16506 states to 16506 states and 28311 transitions. [2019-10-02 12:35:58,874 INFO L78 Accepts]: Start accepts. Automaton has 16506 states and 28311 transitions. Word has length 234 [2019-10-02 12:35:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:58,875 INFO L475 AbstractCegarLoop]: Abstraction has 16506 states and 28311 transitions. [2019-10-02 12:35:58,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:35:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 16506 states and 28311 transitions. [2019-10-02 12:35:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 12:35:58,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:58,900 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:35:58,900 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1962515694, now seen corresponding path program 1 times [2019-10-02 12:35:58,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:58,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:58,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:58,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-02 12:35:59,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:59,324 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:35:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:00,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 4012 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:36:00,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:36:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-10-02 12:36:00,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:36:00,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-02 12:36:00,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:36:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:36:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:36:00,876 INFO L87 Difference]: Start difference. First operand 16506 states and 28311 transitions. Second operand 13 states. [2019-10-02 12:36:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:27,190 INFO L93 Difference]: Finished difference Result 123598 states and 270863 transitions. [2019-10-02 12:36:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 12:36:27,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 353 [2019-10-02 12:36:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:28,547 INFO L225 Difference]: With dead ends: 123598 [2019-10-02 12:36:28,547 INFO L226 Difference]: Without dead ends: 107155 [2019-10-02 12:36:28,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=562, Invalid=2744, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 12:36:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107155 states. [2019-10-02 12:36:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107155 to 100437. [2019-10-02 12:36:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100437 states. [2019-10-02 12:36:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100437 states to 100437 states and 189599 transitions. [2019-10-02 12:36:39,192 INFO L78 Accepts]: Start accepts. Automaton has 100437 states and 189599 transitions. Word has length 353 [2019-10-02 12:36:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:39,192 INFO L475 AbstractCegarLoop]: Abstraction has 100437 states and 189599 transitions. [2019-10-02 12:36:39,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:36:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 100437 states and 189599 transitions. [2019-10-02 12:36:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 12:36:39,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:39,259 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:39,259 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:39,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1636858103, now seen corresponding path program 1 times [2019-10-02 12:36:39,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:39,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:39,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:39,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:36:39,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:39,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:36:39,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:36:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:36:39,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:36:39,602 INFO L87 Difference]: Start difference. First operand 100437 states and 189599 transitions. Second operand 7 states. [2019-10-02 12:36:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:46,735 INFO L93 Difference]: Finished difference Result 202160 states and 397250 transitions. [2019-10-02 12:36:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:36:46,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2019-10-02 12:36:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:47,397 INFO L225 Difference]: With dead ends: 202160 [2019-10-02 12:36:47,397 INFO L226 Difference]: Without dead ends: 101787 [2019-10-02 12:36:47,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:36:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101787 states. [2019-10-02 12:36:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101787 to 101781. [2019-10-02 12:36:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101781 states. [2019-10-02 12:36:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101781 states to 101781 states and 191071 transitions. [2019-10-02 12:36:52,940 INFO L78 Accepts]: Start accepts. Automaton has 101781 states and 191071 transitions. Word has length 241 [2019-10-02 12:36:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:52,940 INFO L475 AbstractCegarLoop]: Abstraction has 101781 states and 191071 transitions. [2019-10-02 12:36:52,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:36:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 101781 states and 191071 transitions. [2019-10-02 12:36:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 12:36:52,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:52,968 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:52,968 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1806001878, now seen corresponding path program 1 times [2019-10-02 12:36:52,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:52,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:52,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:36:53,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:53,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:36:53,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:36:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:36:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:36:53,199 INFO L87 Difference]: Start difference. First operand 101781 states and 191071 transitions. Second operand 9 states. [2019-10-02 12:37:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:17,345 INFO L93 Difference]: Finished difference Result 346366 states and 855107 transitions. [2019-10-02 12:37:17,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:37:17,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2019-10-02 12:37:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:20,475 INFO L225 Difference]: With dead ends: 346366 [2019-10-02 12:37:20,475 INFO L226 Difference]: Without dead ends: 244648 [2019-10-02 12:37:20,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:37:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244648 states. [2019-10-02 12:37:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244648 to 226223. [2019-10-02 12:37:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226223 states. [2019-10-02 12:37:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226223 states to 226223 states and 478503 transitions. [2019-10-02 12:37:42,170 INFO L78 Accepts]: Start accepts. Automaton has 226223 states and 478503 transitions. Word has length 241 [2019-10-02 12:37:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:42,170 INFO L475 AbstractCegarLoop]: Abstraction has 226223 states and 478503 transitions. [2019-10-02 12:37:42,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:37:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 226223 states and 478503 transitions. [2019-10-02 12:37:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:37:42,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:42,224 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:42,224 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1141460143, now seen corresponding path program 1 times [2019-10-02 12:37:42,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:42,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:42,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:37:42,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:42,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:37:42,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:37:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:37:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:42,433 INFO L87 Difference]: Start difference. First operand 226223 states and 478503 transitions. Second operand 8 states. [2019-10-02 12:38:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:17,041 INFO L93 Difference]: Finished difference Result 535881 states and 1212983 transitions. [2019-10-02 12:38:17,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:38:17,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-10-02 12:38:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:19,366 INFO L225 Difference]: With dead ends: 535881 [2019-10-02 12:38:19,366 INFO L226 Difference]: Without dead ends: 309459 [2019-10-02 12:38:21,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:38:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309459 states. [2019-10-02 12:38:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309459 to 308468. [2019-10-02 12:38:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308468 states. [2019-10-02 12:38:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308468 states to 308468 states and 701517 transitions. [2019-10-02 12:38:59,008 INFO L78 Accepts]: Start accepts. Automaton has 308468 states and 701517 transitions. Word has length 242 [2019-10-02 12:38:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:59,008 INFO L475 AbstractCegarLoop]: Abstraction has 308468 states and 701517 transitions. [2019-10-02 12:38:59,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:38:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 308468 states and 701517 transitions. [2019-10-02 12:38:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-10-02 12:38:59,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:59,073 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:38:59,074 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash 350789453, now seen corresponding path program 1 times [2019-10-02 12:38:59,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:59,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:59,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-02 12:38:59,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:38:59,358 INFO L224 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-10-02 12:38:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:01,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 4034 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:39:01,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-10-02 12:39:02,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:39:02,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-10-02 12:39:02,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:39:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:39:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:02,008 INFO L87 Difference]: Start difference. First operand 308468 states and 701517 transitions. Second operand 16 states. [2019-10-02 12:41:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:13,997 INFO L93 Difference]: Finished difference Result 1063426 states and 4067243 transitions. [2019-10-02 12:41:13,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:41:13,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 360 [2019-10-02 12:41:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted.