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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:38,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:38,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:38,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:38,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:38,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:38,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:38,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:38,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:38,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:38,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:38,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:38,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:38,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:38,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:38,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:38,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:38,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:38,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:38,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:38,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:38,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:38,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:38,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:38,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:38,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:38,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:38,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:38,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:38,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:38,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:38,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:38,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:38,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:38,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:38,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:38,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:38,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:38,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:38,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:38,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:38,687 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-15 01:10:38,701 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:38,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:38,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:38,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:38,703 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:38,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:38,704 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:38,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:38,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:38,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:38,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:38,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:38,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:38,705 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:38,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:38,706 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:38,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:38,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:38,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:38,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:38,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:38,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:38,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:38,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:38,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:38,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:38,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:38,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:38,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:10:39,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:39,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:39,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:39,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:39,070 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:39,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product22.cil.c [2019-10-15 01:10:39,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc1b01b9/51ec4a1f026245ab91f8d4be0d32213c/FLAGa861e886a [2019-10-15 01:10:39,705 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:39,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product22.cil.c [2019-10-15 01:10:39,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc1b01b9/51ec4a1f026245ab91f8d4be0d32213c/FLAGa861e886a [2019-10-15 01:10:39,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc1b01b9/51ec4a1f026245ab91f8d4be0d32213c [2019-10-15 01:10:39,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:39,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:39,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:39,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:39,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:39,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:39" (1/1) ... [2019-10-15 01:10:39,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667357e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:39, skipping insertion in model container [2019-10-15 01:10:39,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:39" (1/1) ... [2019-10-15 01:10:39,980 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:40,070 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:40,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:40,910 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:41,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:41,194 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:41,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41 WrapperNode [2019-10-15 01:10:41,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:41,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:41,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:41,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:41,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (1/1) ... [2019-10-15 01:10:41,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (1/1) ... [2019-10-15 01:10:41,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (1/1) ... [2019-10-15 01:10:41,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (1/1) ... [2019-10-15 01:10:41,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (1/1) ... [2019-10-15 01:10:41,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (1/1) ... [2019-10-15 01:10:41,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (1/1) ... [2019-10-15 01:10:41,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:41,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:41,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:41,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:41,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (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-15 01:10:41,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:41,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:41,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:41,530 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:41,530 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:41,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:41,534 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:41,535 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:41,535 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:41,535 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:41,537 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:41,537 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:41,537 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:41,537 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:41,538 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:41,539 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:41,539 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:41,539 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:41,539 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:41,539 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:41,540 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:41,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:41,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:41,540 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:41,540 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:10:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:10:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:41,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-15 01:10:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-15 01:10:41,545 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:41,546 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:41,546 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:41,547 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:41,548 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:41,556 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:41,558 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:10:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:10:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-15 01:10:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-15 01:10:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:44,034 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:44,034 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:44,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:44 BoogieIcfgContainer [2019-10-15 01:10:44,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:44,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:44,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:44,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:44,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:39" (1/3) ... [2019-10-15 01:10:44,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b20e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:44, skipping insertion in model container [2019-10-15 01:10:44,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:41" (2/3) ... [2019-10-15 01:10:44,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b20e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:44, skipping insertion in model container [2019-10-15 01:10:44,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:44" (3/3) ... [2019-10-15 01:10:44,045 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product22.cil.c [2019-10-15 01:10:44,055 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:44,065 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:44,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:44,124 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:44,124 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:44,124 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:44,124 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:44,125 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:44,125 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:44,125 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:44,125 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states. [2019-10-15 01:10:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:10:44,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:44,204 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:44,208 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1780237072, now seen corresponding path program 1 times [2019-10-15 01:10:44,227 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:44,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079411682] [2019-10-15 01:10:44,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:44,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:44,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:44,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079411682] [2019-10-15 01:10:44,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:44,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:44,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396079068] [2019-10-15 01:10:44,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:44,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:45,008 INFO L87 Difference]: Start difference. First operand 812 states. Second operand 7 states. [2019-10-15 01:10:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:45,322 INFO L93 Difference]: Finished difference Result 1289 states and 2078 transitions. [2019-10-15 01:10:45,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:45,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-15 01:10:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:45,373 INFO L225 Difference]: With dead ends: 1289 [2019-10-15 01:10:45,373 INFO L226 Difference]: Without dead ends: 653 [2019-10-15 01:10:45,390 INFO L600 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-15 01:10:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-15 01:10:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 651. [2019-10-15 01:10:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:10:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1034 transitions. [2019-10-15 01:10:45,597 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1034 transitions. Word has length 93 [2019-10-15 01:10:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:45,598 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1034 transitions. [2019-10-15 01:10:45,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1034 transitions. [2019-10-15 01:10:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:45,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:45,619 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:45,624 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:45,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1958663701, now seen corresponding path program 1 times [2019-10-15 01:10:45,624 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:45,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837487891] [2019-10-15 01:10:45,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:45,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:45,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:45,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837487891] [2019-10-15 01:10:45,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:45,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:45,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106163372] [2019-10-15 01:10:45,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:45,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:45,910 INFO L87 Difference]: Start difference. First operand 651 states and 1034 transitions. Second operand 4 states. [2019-10-15 01:10:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:46,078 INFO L93 Difference]: Finished difference Result 1268 states and 2033 transitions. [2019-10-15 01:10:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:46,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-15 01:10:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:46,084 INFO L225 Difference]: With dead ends: 1268 [2019-10-15 01:10:46,084 INFO L226 Difference]: Without dead ends: 633 [2019-10-15 01:10:46,088 INFO L600 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-15 01:10:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-15 01:10:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-10-15 01:10:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-15 01:10:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1001 transitions. [2019-10-15 01:10:46,122 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1001 transitions. Word has length 94 [2019-10-15 01:10:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:46,122 INFO L462 AbstractCegarLoop]: Abstraction has 633 states and 1001 transitions. [2019-10-15 01:10:46,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1001 transitions. [2019-10-15 01:10:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:46,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:46,126 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:46,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:46,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1392133917, now seen corresponding path program 1 times [2019-10-15 01:10:46,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:46,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071899068] [2019-10-15 01:10:46,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:46,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071899068] [2019-10-15 01:10:46,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:46,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:46,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041190792] [2019-10-15 01:10:46,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:46,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:46,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:46,358 INFO L87 Difference]: Start difference. First operand 633 states and 1001 transitions. Second operand 7 states. [2019-10-15 01:10:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:46,487 INFO L93 Difference]: Finished difference Result 1237 states and 1975 transitions. [2019-10-15 01:10:46,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:46,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:10:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:46,497 INFO L225 Difference]: With dead ends: 1237 [2019-10-15 01:10:46,497 INFO L226 Difference]: Without dead ends: 627 [2019-10-15 01:10:46,501 INFO L600 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-15 01:10:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-15 01:10:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-15 01:10:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-15 01:10:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 988 transitions. [2019-10-15 01:10:46,541 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 988 transitions. Word has length 94 [2019-10-15 01:10:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:46,543 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 988 transitions. [2019-10-15 01:10:46,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 988 transitions. [2019-10-15 01:10:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:10:46,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:46,546 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:46,546 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1203424844, now seen corresponding path program 1 times [2019-10-15 01:10:46,547 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:46,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836416217] [2019-10-15 01:10:46,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:46,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836416217] [2019-10-15 01:10:46,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:46,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:46,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207134908] [2019-10-15 01:10:46,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:46,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:46,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:46,729 INFO L87 Difference]: Start difference. First operand 627 states and 988 transitions. Second operand 7 states. [2019-10-15 01:10:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:46,834 INFO L93 Difference]: Finished difference Result 1225 states and 1949 transitions. [2019-10-15 01:10:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:46,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:10:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:46,840 INFO L225 Difference]: With dead ends: 1225 [2019-10-15 01:10:46,840 INFO L226 Difference]: Without dead ends: 621 [2019-10-15 01:10:46,844 INFO L600 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-15 01:10:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-15 01:10:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-15 01:10:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 01:10:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 975 transitions. [2019-10-15 01:10:46,872 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 975 transitions. Word has length 95 [2019-10-15 01:10:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:46,872 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 975 transitions. [2019-10-15 01:10:46,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 975 transitions. [2019-10-15 01:10:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:46,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:46,875 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:46,875 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2078787873, now seen corresponding path program 1 times [2019-10-15 01:10:46,876 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:46,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417414484] [2019-10-15 01:10:46,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:47,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417414484] [2019-10-15 01:10:47,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:47,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:47,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205383111] [2019-10-15 01:10:47,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:47,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:47,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:47,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:47,111 INFO L87 Difference]: Start difference. First operand 621 states and 975 transitions. Second operand 7 states. [2019-10-15 01:10:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:47,214 INFO L93 Difference]: Finished difference Result 1213 states and 1923 transitions. [2019-10-15 01:10:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:47,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:10:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:47,225 INFO L225 Difference]: With dead ends: 1213 [2019-10-15 01:10:47,225 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:47,232 INFO L600 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-15 01:10:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 962 transitions. [2019-10-15 01:10:47,260 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 962 transitions. Word has length 96 [2019-10-15 01:10:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:47,261 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 962 transitions. [2019-10-15 01:10:47,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 962 transitions. [2019-10-15 01:10:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:47,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:47,264 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:47,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash -827237598, now seen corresponding path program 1 times [2019-10-15 01:10:47,266 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:47,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69222654] [2019-10-15 01:10:47,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:47,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69222654] [2019-10-15 01:10:47,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:47,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:47,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371873468] [2019-10-15 01:10:47,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:47,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:47,419 INFO L87 Difference]: Start difference. First operand 615 states and 962 transitions. Second operand 7 states. [2019-10-15 01:10:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:47,533 INFO L93 Difference]: Finished difference Result 1201 states and 1897 transitions. [2019-10-15 01:10:47,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:47,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:10:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:47,543 INFO L225 Difference]: With dead ends: 1201 [2019-10-15 01:10:47,543 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:47,548 INFO L600 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-15 01:10:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 961 transitions. [2019-10-15 01:10:47,584 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 961 transitions. Word has length 96 [2019-10-15 01:10:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:47,585 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 961 transitions. [2019-10-15 01:10:47,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 961 transitions. [2019-10-15 01:10:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:10:47,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:47,587 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:47,587 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1406644616, now seen corresponding path program 1 times [2019-10-15 01:10:47,588 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:47,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474020302] [2019-10-15 01:10:47,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:47,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474020302] [2019-10-15 01:10:47,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:47,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:47,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007595064] [2019-10-15 01:10:47,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:47,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:47,780 INFO L87 Difference]: Start difference. First operand 615 states and 961 transitions. Second operand 5 states. [2019-10-15 01:10:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,006 INFO L93 Difference]: Finished difference Result 1200 states and 1894 transitions. [2019-10-15 01:10:48,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:48,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-15 01:10:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,015 INFO L225 Difference]: With dead ends: 1200 [2019-10-15 01:10:48,015 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:48,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 960 transitions. [2019-10-15 01:10:48,058 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 960 transitions. Word has length 97 [2019-10-15 01:10:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,058 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 960 transitions. [2019-10-15 01:10:48,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 960 transitions. [2019-10-15 01:10:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:10:48,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,060 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,061 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1540636153, now seen corresponding path program 1 times [2019-10-15 01:10:48,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382879928] [2019-10-15 01:10:48,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:48,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382879928] [2019-10-15 01:10:48,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:48,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:48,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016343596] [2019-10-15 01:10:48,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:48,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:48,254 INFO L87 Difference]: Start difference. First operand 615 states and 960 transitions. Second operand 5 states. [2019-10-15 01:10:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,351 INFO L93 Difference]: Finished difference Result 1200 states and 1892 transitions. [2019-10-15 01:10:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:48,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-15 01:10:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,358 INFO L225 Difference]: With dead ends: 1200 [2019-10-15 01:10:48,358 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:48,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 959 transitions. [2019-10-15 01:10:48,390 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 959 transitions. Word has length 98 [2019-10-15 01:10:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,390 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 959 transitions. [2019-10-15 01:10:48,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 959 transitions. [2019-10-15 01:10:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:10:48,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,396 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,397 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash -846468685, now seen corresponding path program 1 times [2019-10-15 01:10:48,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929165236] [2019-10-15 01:10:48,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:48,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929165236] [2019-10-15 01:10:48,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:48,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:48,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437511074] [2019-10-15 01:10:48,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:48,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:48,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:48,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:48,543 INFO L87 Difference]: Start difference. First operand 615 states and 959 transitions. Second operand 5 states. [2019-10-15 01:10:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,626 INFO L93 Difference]: Finished difference Result 1200 states and 1890 transitions. [2019-10-15 01:10:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:48,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-15 01:10:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,633 INFO L225 Difference]: With dead ends: 1200 [2019-10-15 01:10:48,633 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:48,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 958 transitions. [2019-10-15 01:10:48,664 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 958 transitions. Word has length 99 [2019-10-15 01:10:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,664 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 958 transitions. [2019-10-15 01:10:48,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 958 transitions. [2019-10-15 01:10:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:10:48,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,666 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,667 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,667 INFO L82 PathProgramCache]: Analyzing trace with hash -249175838, now seen corresponding path program 1 times [2019-10-15 01:10:48,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419692996] [2019-10-15 01:10:48,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:48,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419692996] [2019-10-15 01:10:48,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:48,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:48,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344784275] [2019-10-15 01:10:48,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:48,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:48,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:48,809 INFO L87 Difference]: Start difference. First operand 615 states and 958 transitions. Second operand 5 states. [2019-10-15 01:10:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,897 INFO L93 Difference]: Finished difference Result 1200 states and 1888 transitions. [2019-10-15 01:10:48,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:48,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-15 01:10:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,914 INFO L225 Difference]: With dead ends: 1200 [2019-10-15 01:10:48,915 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:48,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 957 transitions. [2019-10-15 01:10:49,021 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 957 transitions. Word has length 100 [2019-10-15 01:10:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:49,022 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 957 transitions. [2019-10-15 01:10:49,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 957 transitions. [2019-10-15 01:10:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:49,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:49,025 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:49,026 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash -715834196, now seen corresponding path program 1 times [2019-10-15 01:10:49,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:49,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967044183] [2019-10-15 01:10:49,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:49,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967044183] [2019-10-15 01:10:49,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:49,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:49,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832545305] [2019-10-15 01:10:49,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:49,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:49,198 INFO L87 Difference]: Start difference. First operand 615 states and 957 transitions. Second operand 9 states. [2019-10-15 01:10:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:49,367 INFO L93 Difference]: Finished difference Result 1202 states and 1887 transitions. [2019-10-15 01:10:49,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:10:49,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-15 01:10:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:49,375 INFO L225 Difference]: With dead ends: 1202 [2019-10-15 01:10:49,375 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:49,380 INFO L600 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-15 01:10:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 956 transitions. [2019-10-15 01:10:49,417 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 956 transitions. Word has length 101 [2019-10-15 01:10:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:49,418 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 956 transitions. [2019-10-15 01:10:49,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 956 transitions. [2019-10-15 01:10:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:49,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:49,421 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:49,422 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:49,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1639971054, now seen corresponding path program 1 times [2019-10-15 01:10:49,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:49,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103143750] [2019-10-15 01:10:49,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:49,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103143750] [2019-10-15 01:10:49,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338149392] [2019-10-15 01:10:49,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:50,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:50,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:50,519 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:50,649 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:50,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:50,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953379391] [2019-10-15 01:10:50,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:50,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:50,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:50,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:50,651 INFO L87 Difference]: Start difference. First operand 615 states and 956 transitions. Second operand 3 states. [2019-10-15 01:10:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:50,743 INFO L93 Difference]: Finished difference Result 1724 states and 2728 transitions. [2019-10-15 01:10:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:50,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-15 01:10:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:50,755 INFO L225 Difference]: With dead ends: 1724 [2019-10-15 01:10:50,755 INFO L226 Difference]: Without dead ends: 1143 [2019-10-15 01:10:50,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2019-10-15 01:10:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1130. [2019-10-15 01:10:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-15 01:10:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1775 transitions. [2019-10-15 01:10:50,819 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1775 transitions. Word has length 101 [2019-10-15 01:10:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:50,820 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1775 transitions. [2019-10-15 01:10:50,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1775 transitions. [2019-10-15 01:10:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:10:50,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:50,822 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:51,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:51,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1592774854, now seen corresponding path program 1 times [2019-10-15 01:10:51,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:51,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625916429] [2019-10-15 01:10:51,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:51,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:51,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:51,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625916429] [2019-10-15 01:10:51,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117158263] [2019-10-15 01:10:51,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:52,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:52,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:52,198 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:52,323 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:52,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:52,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683898373] [2019-10-15 01:10:52,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:52,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:52,328 INFO L87 Difference]: Start difference. First operand 1130 states and 1775 transitions. Second operand 3 states. [2019-10-15 01:10:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:52,457 INFO L93 Difference]: Finished difference Result 2754 states and 4368 transitions. [2019-10-15 01:10:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:52,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-15 01:10:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:52,472 INFO L225 Difference]: With dead ends: 2754 [2019-10-15 01:10:52,472 INFO L226 Difference]: Without dead ends: 1658 [2019-10-15 01:10:52,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-10-15 01:10:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1609. [2019-10-15 01:10:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-10-15 01:10:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2548 transitions. [2019-10-15 01:10:52,578 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2548 transitions. Word has length 102 [2019-10-15 01:10:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:52,579 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 2548 transitions. [2019-10-15 01:10:52,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2548 transitions. [2019-10-15 01:10:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:10:52,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:52,581 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:52,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:52,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:52,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2036688864, now seen corresponding path program 1 times [2019-10-15 01:10:52,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:52,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119650710] [2019-10-15 01:10:52,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:52,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:52,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:52,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119650710] [2019-10-15 01:10:52,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:52,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:52,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775650028] [2019-10-15 01:10:52,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:52,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:52,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:52,958 INFO L87 Difference]: Start difference. First operand 1609 states and 2548 transitions. Second operand 7 states. [2019-10-15 01:10:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:56,222 INFO L93 Difference]: Finished difference Result 4737 states and 7695 transitions. [2019-10-15 01:10:56,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:56,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-10-15 01:10:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:56,261 INFO L225 Difference]: With dead ends: 4737 [2019-10-15 01:10:56,262 INFO L226 Difference]: Without dead ends: 3162 [2019-10-15 01:10:56,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2019-10-15 01:10:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3092. [2019-10-15 01:10:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-10-15 01:10:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4974 transitions. [2019-10-15 01:10:56,600 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4974 transitions. Word has length 104 [2019-10-15 01:10:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:56,601 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4974 transitions. [2019-10-15 01:10:56,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4974 transitions. [2019-10-15 01:10:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:10:56,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:56,605 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:56,606 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2032550312, now seen corresponding path program 1 times [2019-10-15 01:10:56,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:56,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698135013] [2019-10-15 01:10:56,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:56,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698135013] [2019-10-15 01:10:56,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974938921] [2019-10-15 01:10:56,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:57,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 2970 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 01:10:57,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:57,601 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:57,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:10:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:57,933 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:57,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [11] total 20 [2019-10-15 01:10:57,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549908459] [2019-10-15 01:10:57,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:10:57,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:57,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:10:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:10:57,935 INFO L87 Difference]: Start difference. First operand 3092 states and 4974 transitions. Second operand 11 states. [2019-10-15 01:11:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:03,060 INFO L93 Difference]: Finished difference Result 13830 states and 22741 transitions. [2019-10-15 01:11:03,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:11:03,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-10-15 01:11:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:03,174 INFO L225 Difference]: With dead ends: 13830 [2019-10-15 01:11:03,175 INFO L226 Difference]: Without dead ends: 10772 [2019-10-15 01:11:03,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:11:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10772 states. [2019-10-15 01:11:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10772 to 10652. [2019-10-15 01:11:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10652 states. [2019-10-15 01:11:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10652 states to 10652 states and 17065 transitions. [2019-10-15 01:11:03,767 INFO L78 Accepts]: Start accepts. Automaton has 10652 states and 17065 transitions. Word has length 105 [2019-10-15 01:11:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:03,767 INFO L462 AbstractCegarLoop]: Abstraction has 10652 states and 17065 transitions. [2019-10-15 01:11:03,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:11:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 10652 states and 17065 transitions. [2019-10-15 01:11:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:11:03,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:03,770 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:03,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:03,980 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2040401702, now seen corresponding path program 1 times [2019-10-15 01:11:03,981 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:03,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897427580] [2019-10-15 01:11:03,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:04,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897427580] [2019-10-15 01:11:04,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:04,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:04,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292993587] [2019-10-15 01:11:04,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:04,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:04,154 INFO L87 Difference]: Start difference. First operand 10652 states and 17065 transitions. Second operand 4 states. [2019-10-15 01:11:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:04,663 INFO L93 Difference]: Finished difference Result 21288 states and 34429 transitions. [2019-10-15 01:11:04,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:04,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:11:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:04,768 INFO L225 Difference]: With dead ends: 21288 [2019-10-15 01:11:04,768 INFO L226 Difference]: Without dead ends: 10670 [2019-10-15 01:11:04,839 INFO L600 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-15 01:11:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10670 states. [2019-10-15 01:11:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10670 to 10634. [2019-10-15 01:11:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10634 states. [2019-10-15 01:11:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10634 states to 10634 states and 16964 transitions. [2019-10-15 01:11:05,395 INFO L78 Accepts]: Start accepts. Automaton has 10634 states and 16964 transitions. Word has length 105 [2019-10-15 01:11:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:05,395 INFO L462 AbstractCegarLoop]: Abstraction has 10634 states and 16964 transitions. [2019-10-15 01:11:05,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 10634 states and 16964 transitions. [2019-10-15 01:11:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:11:05,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:05,398 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:05,398 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash -431539305, now seen corresponding path program 1 times [2019-10-15 01:11:05,399 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:05,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839484162] [2019-10-15 01:11:05,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:05,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:05,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:11:05,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839484162] [2019-10-15 01:11:05,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:05,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:05,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564276863] [2019-10-15 01:11:05,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:05,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:05,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:05,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:05,583 INFO L87 Difference]: Start difference. First operand 10634 states and 16964 transitions. Second operand 7 states. [2019-10-15 01:11:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:09,289 INFO L93 Difference]: Finished difference Result 31882 states and 52630 transitions. [2019-10-15 01:11:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:09,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-15 01:11:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:09,521 INFO L225 Difference]: With dead ends: 31882 [2019-10-15 01:11:09,522 INFO L226 Difference]: Without dead ends: 21282 [2019-10-15 01:11:09,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21282 states.