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_spec2_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:02,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:02,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:02,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:02,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:02,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:02,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:02,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:02,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:02,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:02,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:02,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:02,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:02,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:02,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:02,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:02,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:02,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:02,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:02,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:02,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:02,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:02,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:02,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:02,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:02,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:02,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:02,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:02,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:02,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:02,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:02,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:02,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:02,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:02,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:02,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:02,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:02,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:02,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:02,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:02,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:02,748 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:02,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:02,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:02,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:02,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:02,788 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:02,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:02,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:02,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:02,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:02,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:02,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:02,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:02,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:02,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:02,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:02,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:02,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:02,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:02,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:02,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:02,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:02,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:02,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:02,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:02,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:02,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:02,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:02,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:02,796 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:03,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:03,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:03,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:03,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:03,103 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:03,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-10-15 01:10:03,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ffd759b/79d6bd7b51bb4ee499853f1cb75076a1/FLAGc31a31f07 [2019-10-15 01:10:03,811 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:03,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product30.cil.c [2019-10-15 01:10:03,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ffd759b/79d6bd7b51bb4ee499853f1cb75076a1/FLAGc31a31f07 [2019-10-15 01:10:03,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ffd759b/79d6bd7b51bb4ee499853f1cb75076a1 [2019-10-15 01:10:04,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:04,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:04,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:04,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:04,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:04,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:03" (1/1) ... [2019-10-15 01:10:04,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599a6431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:04, skipping insertion in model container [2019-10-15 01:10:04,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:03" (1/1) ... [2019-10-15 01:10:04,028 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:04,114 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:04,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:04,900 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:05,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:05,119 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:05,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05 WrapperNode [2019-10-15 01:10:05,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:05,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:05,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:05,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:05,131 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:05" (1/1) ... [2019-10-15 01:10:05,131 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:05" (1/1) ... [2019-10-15 01:10:05,169 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:05" (1/1) ... [2019-10-15 01:10:05,169 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:05" (1/1) ... [2019-10-15 01:10:05,245 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:05" (1/1) ... [2019-10-15 01:10:05,271 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:05" (1/1) ... [2019-10-15 01:10:05,281 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:05" (1/1) ... [2019-10-15 01:10:05,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:05,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:05,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:05,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:05,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (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:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:05,396 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:05,399 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:05,404 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:05,405 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:05,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:05,405 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:05,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:05,406 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:05,406 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:05,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:05,406 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:05,408 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:05,409 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:05,409 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:05,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:05,411 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:05,412 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:05,413 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:10:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:05,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:05,415 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:10:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-15 01:10:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:05,416 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-15 01:10:05,417 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:05,417 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:05,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:05,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:05,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:05,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:05,420 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:05,420 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:05,420 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:05,421 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:05,421 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:05,423 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:05,423 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:05,423 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:05,423 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:05,423 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:05,427 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:05,427 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:05,427 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:05,427 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:05,427 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:05,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:05,428 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:05,428 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:05,428 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:10:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:05,449 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:05,450 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:05,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:05,452 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:05,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:07,922 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:07,923 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:07,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:07 BoogieIcfgContainer [2019-10-15 01:10:07,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:07,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:07,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:07,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:07,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:03" (1/3) ... [2019-10-15 01:10:07,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fa56ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:07, skipping insertion in model container [2019-10-15 01:10:07,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (2/3) ... [2019-10-15 01:10:07,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fa56ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:07, skipping insertion in model container [2019-10-15 01:10:07,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:07" (3/3) ... [2019-10-15 01:10:07,934 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product30.cil.c [2019-10-15 01:10:07,946 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:07,958 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:07,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:08,013 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:08,014 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:08,014 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:08,014 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:08,014 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:08,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:08,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:08,014 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states. [2019-10-15 01:10:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 01:10:08,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,133 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash -157007896, now seen corresponding path program 1 times [2019-10-15 01:10:08,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193209545] [2019-10-15 01:10:08,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:08,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193209545] [2019-10-15 01:10:08,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:08,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143467154] [2019-10-15 01:10:08,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:08,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:08,749 INFO L87 Difference]: Start difference. First operand 805 states. Second operand 4 states. [2019-10-15 01:10:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,972 INFO L93 Difference]: Finished difference Result 1259 states and 2029 transitions. [2019-10-15 01:10:08,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:08,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-15 01:10:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:09,004 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 01:10:09,004 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:10:09,019 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:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:10:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-15 01:10:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-15 01:10:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1016 transitions. [2019-10-15 01:10:09,128 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1016 transitions. Word has length 85 [2019-10-15 01:10:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:09,129 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1016 transitions. [2019-10-15 01:10:09,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1016 transitions. [2019-10-15 01:10:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:10:09,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:09,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,136 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:09,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:09,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2067866645, now seen corresponding path program 1 times [2019-10-15 01:10:09,137 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:09,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548399008] [2019-10-15 01:10:09,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:09,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548399008] [2019-10-15 01:10:09,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:09,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:09,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663118061] [2019-10-15 01:10:09,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:09,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:09,400 INFO L87 Difference]: Start difference. First operand 638 states and 1016 transitions. Second operand 4 states. [2019-10-15 01:10:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:09,487 INFO L93 Difference]: Finished difference Result 1239 states and 1990 transitions. [2019-10-15 01:10:09,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:09,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 01:10:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:09,497 INFO L225 Difference]: With dead ends: 1239 [2019-10-15 01:10:09,498 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:10:09,505 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:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:10:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-15 01:10:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-15 01:10:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1015 transitions. [2019-10-15 01:10:09,575 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1015 transitions. Word has length 88 [2019-10-15 01:10:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:09,575 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1015 transitions. [2019-10-15 01:10:09,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1015 transitions. [2019-10-15 01:10:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 01:10:09,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:09,579 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1753669847, now seen corresponding path program 1 times [2019-10-15 01:10:09,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:09,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647183451] [2019-10-15 01:10:09,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:09,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647183451] [2019-10-15 01:10:09,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:09,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:09,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302708823] [2019-10-15 01:10:09,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:09,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:09,749 INFO L87 Difference]: Start difference. First operand 638 states and 1015 transitions. Second operand 4 states. [2019-10-15 01:10:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:09,838 INFO L93 Difference]: Finished difference Result 1239 states and 1989 transitions. [2019-10-15 01:10:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:09,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-15 01:10:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:09,848 INFO L225 Difference]: With dead ends: 1239 [2019-10-15 01:10:09,848 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:10:09,852 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:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:10:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-15 01:10:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-15 01:10:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1014 transitions. [2019-10-15 01:10:09,899 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1014 transitions. Word has length 89 [2019-10-15 01:10:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:09,900 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1014 transitions. [2019-10-15 01:10:09,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1014 transitions. [2019-10-15 01:10:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-15 01:10:09,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:09,903 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,903 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash 43566311, now seen corresponding path program 1 times [2019-10-15 01:10:09,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:09,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688673040] [2019-10-15 01:10:09,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:10,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688673040] [2019-10-15 01:10:10,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:10,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871050726] [2019-10-15 01:10:10,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:10,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:10,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:10,059 INFO L87 Difference]: Start difference. First operand 638 states and 1014 transitions. Second operand 4 states. [2019-10-15 01:10:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,133 INFO L93 Difference]: Finished difference Result 1239 states and 1988 transitions. [2019-10-15 01:10:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:10,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-15 01:10:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,140 INFO L225 Difference]: With dead ends: 1239 [2019-10-15 01:10:10,140 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:10:10,143 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:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:10:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-15 01:10:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-15 01:10:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1013 transitions. [2019-10-15 01:10:10,173 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1013 transitions. Word has length 90 [2019-10-15 01:10:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,174 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1013 transitions. [2019-10-15 01:10:10,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1013 transitions. [2019-10-15 01:10:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:10:10,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,178 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,178 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1348686253, now seen corresponding path program 1 times [2019-10-15 01:10:10,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277571360] [2019-10-15 01:10:10,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:10,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277571360] [2019-10-15 01:10:10,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:10,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411157884] [2019-10-15 01:10:10,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:10,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:10,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:10,379 INFO L87 Difference]: Start difference. First operand 638 states and 1013 transitions. Second operand 4 states. [2019-10-15 01:10:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,438 INFO L93 Difference]: Finished difference Result 1239 states and 1987 transitions. [2019-10-15 01:10:10,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:10,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-15 01:10:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,444 INFO L225 Difference]: With dead ends: 1239 [2019-10-15 01:10:10,445 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:10:10,448 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:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:10:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-15 01:10:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-15 01:10:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1012 transitions. [2019-10-15 01:10:10,475 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1012 transitions. Word has length 91 [2019-10-15 01:10:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,475 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1012 transitions. [2019-10-15 01:10:10,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1012 transitions. [2019-10-15 01:10:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:10:10,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,483 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1477493277, now seen corresponding path program 1 times [2019-10-15 01:10:10,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984482612] [2019-10-15 01:10:10,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:10,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984482612] [2019-10-15 01:10:10,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:10:10,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335868962] [2019-10-15 01:10:10,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:10:10,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:10:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:10,678 INFO L87 Difference]: Start difference. First operand 638 states and 1012 transitions. Second operand 10 states. [2019-10-15 01:10:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,870 INFO L93 Difference]: Finished difference Result 1197 states and 1907 transitions. [2019-10-15 01:10:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:10,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-15 01:10:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,876 INFO L225 Difference]: With dead ends: 1197 [2019-10-15 01:10:10,877 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 01:10:10,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 01:10:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-10-15 01:10:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-15 01:10:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1021 transitions. [2019-10-15 01:10:10,914 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1021 transitions. Word has length 92 [2019-10-15 01:10:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,915 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 1021 transitions. [2019-10-15 01:10:10,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:10:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1021 transitions. [2019-10-15 01:10:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:10:10,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,918 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,918 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1457155902, now seen corresponding path program 1 times [2019-10-15 01:10:10,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490502303] [2019-10-15 01:10:10,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:11,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490502303] [2019-10-15 01:10:11,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:11,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010607438] [2019-10-15 01:10:11,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:11,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:11,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:11,074 INFO L87 Difference]: Start difference. First operand 645 states and 1021 transitions. Second operand 4 states. [2019-10-15 01:10:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,129 INFO L93 Difference]: Finished difference Result 1245 states and 1993 transitions. [2019-10-15 01:10:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:11,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-15 01:10:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,137 INFO L225 Difference]: With dead ends: 1245 [2019-10-15 01:10:11,137 INFO L226 Difference]: Without dead ends: 632 [2019-10-15 01:10:11,141 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:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-15 01:10:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-15 01:10:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-15 01:10:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 998 transitions. [2019-10-15 01:10:11,168 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 998 transitions. Word has length 92 [2019-10-15 01:10:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,168 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 998 transitions. [2019-10-15 01:10:11,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 998 transitions. [2019-10-15 01:10:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:10:11,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,171 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,172 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1488514411, now seen corresponding path program 1 times [2019-10-15 01:10:11,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:11,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041086578] [2019-10-15 01:10:11,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:11,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041086578] [2019-10-15 01:10:11,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:11,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383244260] [2019-10-15 01:10:11,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:11,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:11,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:11,324 INFO L87 Difference]: Start difference. First operand 632 states and 998 transitions. Second operand 6 states. [2019-10-15 01:10:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,550 INFO L93 Difference]: Finished difference Result 1185 states and 1885 transitions. [2019-10-15 01:10:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:11,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-15 01:10:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,557 INFO L225 Difference]: With dead ends: 1185 [2019-10-15 01:10:11,557 INFO L226 Difference]: Without dead ends: 632 [2019-10-15 01:10:11,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-15 01:10:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-15 01:10:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-15 01:10:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 994 transitions. [2019-10-15 01:10:11,586 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 994 transitions. Word has length 93 [2019-10-15 01:10:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,588 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 994 transitions. [2019-10-15 01:10:11,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 994 transitions. [2019-10-15 01:10:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:11,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,590 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,590 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1742740858, now seen corresponding path program 1 times [2019-10-15 01:10:11,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:11,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580784395] [2019-10-15 01:10:11,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:11,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580784395] [2019-10-15 01:10:11,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:11,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454414804] [2019-10-15 01:10:11,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:11,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:11,747 INFO L87 Difference]: Start difference. First operand 632 states and 994 transitions. Second operand 6 states. [2019-10-15 01:10:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,972 INFO L93 Difference]: Finished difference Result 1185 states and 1881 transitions. [2019-10-15 01:10:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:11,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-15 01:10:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,978 INFO L225 Difference]: With dead ends: 1185 [2019-10-15 01:10:11,978 INFO L226 Difference]: Without dead ends: 632 [2019-10-15 01:10:11,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-15 01:10:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-15 01:10:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-15 01:10:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 990 transitions. [2019-10-15 01:10:12,009 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 990 transitions. Word has length 94 [2019-10-15 01:10:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,010 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 990 transitions. [2019-10-15 01:10:12,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 990 transitions. [2019-10-15 01:10:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:10:12,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,012 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1072622918, now seen corresponding path program 1 times [2019-10-15 01:10:12,013 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559316825] [2019-10-15 01:10:12,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:12,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559316825] [2019-10-15 01:10:12,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:12,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:12,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169356257] [2019-10-15 01:10:12,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:12,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:12,218 INFO L87 Difference]: Start difference. First operand 632 states and 990 transitions. Second operand 6 states. [2019-10-15 01:10:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,418 INFO L93 Difference]: Finished difference Result 1185 states and 1877 transitions. [2019-10-15 01:10:12,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:12,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-15 01:10:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,425 INFO L225 Difference]: With dead ends: 1185 [2019-10-15 01:10:12,425 INFO L226 Difference]: Without dead ends: 632 [2019-10-15 01:10:12,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-15 01:10:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-15 01:10:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-15 01:10:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 986 transitions. [2019-10-15 01:10:12,461 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 986 transitions. Word has length 95 [2019-10-15 01:10:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,462 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 986 transitions. [2019-10-15 01:10:12,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 986 transitions. [2019-10-15 01:10:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:10:12,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash -24768710, now seen corresponding path program 1 times [2019-10-15 01:10:12,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237331856] [2019-10-15 01:10:12,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:12,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237331856] [2019-10-15 01:10:12,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:12,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:12,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614987679] [2019-10-15 01:10:12,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:12,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:12,623 INFO L87 Difference]: Start difference. First operand 632 states and 986 transitions. Second operand 7 states. [2019-10-15 01:10:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,703 INFO L93 Difference]: Finished difference Result 1185 states and 1873 transitions. [2019-10-15 01:10:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:12,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:10:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,708 INFO L225 Difference]: With dead ends: 1185 [2019-10-15 01:10:12,709 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:10:12,712 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:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:10:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:10:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:10:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 952 transitions. [2019-10-15 01:10:12,732 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 952 transitions. Word has length 95 [2019-10-15 01:10:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,732 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 952 transitions. [2019-10-15 01:10:12,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 952 transitions. [2019-10-15 01:10:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:12,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,735 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1812600053, now seen corresponding path program 1 times [2019-10-15 01:10:12,735 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870017441] [2019-10-15 01:10:12,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:12,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870017441] [2019-10-15 01:10:12,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:12,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:12,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966240967] [2019-10-15 01:10:12,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:12,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:12,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:12,857 INFO L87 Difference]: Start difference. First operand 611 states and 952 transitions. Second operand 6 states. [2019-10-15 01:10:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,999 INFO L93 Difference]: Finished difference Result 1164 states and 1839 transitions. [2019-10-15 01:10:12,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:12,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-15 01:10:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,005 INFO L225 Difference]: With dead ends: 1164 [2019-10-15 01:10:13,005 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:10:13,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:10:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:10:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:10:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-10-15 01:10:13,032 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 96 [2019-10-15 01:10:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,033 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-10-15 01:10:13,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-10-15 01:10:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:10:13,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,035 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,036 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 979115743, now seen corresponding path program 1 times [2019-10-15 01:10:13,036 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887444293] [2019-10-15 01:10:13,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:13,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887444293] [2019-10-15 01:10:13,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:13,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691250822] [2019-10-15 01:10:13,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:13,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:13,167 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 6 states. [2019-10-15 01:10:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,260 INFO L93 Difference]: Finished difference Result 1164 states and 1838 transitions. [2019-10-15 01:10:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:13,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-15 01:10:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,265 INFO L225 Difference]: With dead ends: 1164 [2019-10-15 01:10:13,265 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:10:13,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:10:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:10:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:10:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 950 transitions. [2019-10-15 01:10:13,291 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 950 transitions. Word has length 97 [2019-10-15 01:10:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,291 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 950 transitions. [2019-10-15 01:10:13,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 950 transitions. [2019-10-15 01:10:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:10:13,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,294 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1568643986, now seen corresponding path program 1 times [2019-10-15 01:10:13,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306948472] [2019-10-15 01:10:13,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:13,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306948472] [2019-10-15 01:10:13,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:13,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628495412] [2019-10-15 01:10:13,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:13,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:13,430 INFO L87 Difference]: Start difference. First operand 611 states and 950 transitions. Second operand 4 states. [2019-10-15 01:10:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,477 INFO L93 Difference]: Finished difference Result 1164 states and 1837 transitions. [2019-10-15 01:10:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:13,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-15 01:10:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,483 INFO L225 Difference]: With dead ends: 1164 [2019-10-15 01:10:13,483 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:10:13,486 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:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:10:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:10:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:10:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 949 transitions. [2019-10-15 01:10:13,506 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 949 transitions. Word has length 98 [2019-10-15 01:10:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,507 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 949 transitions. [2019-10-15 01:10:13,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 949 transitions. [2019-10-15 01:10:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:10:13,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,509 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1584162704, now seen corresponding path program 1 times [2019-10-15 01:10:13,510 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748113996] [2019-10-15 01:10:13,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:13,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748113996] [2019-10-15 01:10:13,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:10:13,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21787627] [2019-10-15 01:10:13,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:10:13,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:10:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:13,708 INFO L87 Difference]: Start difference. First operand 611 states and 949 transitions. Second operand 12 states. [2019-10-15 01:10:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,947 INFO L93 Difference]: Finished difference Result 1165 states and 1836 transitions. [2019-10-15 01:10:13,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:10:13,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-15 01:10:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,953 INFO L225 Difference]: With dead ends: 1165 [2019-10-15 01:10:13,953 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:10:13,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:10:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:10:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:10:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 948 transitions. [2019-10-15 01:10:13,984 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 948 transitions. Word has length 98 [2019-10-15 01:10:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,984 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 948 transitions. [2019-10-15 01:10:13,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:10:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 948 transitions. [2019-10-15 01:10:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:10:13,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,987 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,988 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash -225790824, now seen corresponding path program 1 times [2019-10-15 01:10:13,989 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001529560] [2019-10-15 01:10:13,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:14,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001529560] [2019-10-15 01:10:14,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:14,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:14,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960530004] [2019-10-15 01:10:14,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:14,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:14,252 INFO L87 Difference]: Start difference. First operand 611 states and 948 transitions. Second operand 9 states. [2019-10-15 01:10:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:21,141 INFO L93 Difference]: Finished difference Result 1667 states and 2655 transitions. [2019-10-15 01:10:21,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:10:21,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-15 01:10:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:21,156 INFO L225 Difference]: With dead ends: 1667 [2019-10-15 01:10:21,156 INFO L226 Difference]: Without dead ends: 1122 [2019-10-15 01:10:21,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:10:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-10-15 01:10:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1090. [2019-10-15 01:10:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-10-15 01:10:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1688 transitions. [2019-10-15 01:10:21,209 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1688 transitions. Word has length 99 [2019-10-15 01:10:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:21,210 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1688 transitions. [2019-10-15 01:10:21,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1688 transitions. [2019-10-15 01:10:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:10:21,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:21,212 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,212 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:21,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash 238992682, now seen corresponding path program 1 times [2019-10-15 01:10:21,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:21,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853414848] [2019-10-15 01:10:21,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:21,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:21,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:21,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853414848] [2019-10-15 01:10:21,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:21,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:21,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090376787] [2019-10-15 01:10:21,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:21,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:21,341 INFO L87 Difference]: Start difference. First operand 1090 states and 1688 transitions. Second operand 5 states. [2019-10-15 01:10:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:23,593 INFO L93 Difference]: Finished difference Result 3272 states and 5205 transitions. [2019-10-15 01:10:23,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:23,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-15 01:10:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:23,616 INFO L225 Difference]: With dead ends: 3272 [2019-10-15 01:10:23,617 INFO L226 Difference]: Without dead ends: 2249 [2019-10-15 01:10:23,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-10-15 01:10:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2221. [2019-10-15 01:10:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-10-15 01:10:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3535 transitions. [2019-10-15 01:10:23,724 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3535 transitions. Word has length 100 [2019-10-15 01:10:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:23,724 INFO L462 AbstractCegarLoop]: Abstraction has 2221 states and 3535 transitions. [2019-10-15 01:10:23,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3535 transitions. [2019-10-15 01:10:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:23,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:23,726 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,727 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:23,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1182567146, now seen corresponding path program 1 times [2019-10-15 01:10:23,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:23,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138709426] [2019-10-15 01:10:23,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:23,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:23,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:23,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138709426] [2019-10-15 01:10:23,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:23,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:23,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643658624] [2019-10-15 01:10:23,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:23,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:23,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:23,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:23,841 INFO L87 Difference]: Start difference. First operand 2221 states and 3535 transitions. Second operand 4 states. [2019-10-15 01:10:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:25,899 INFO L93 Difference]: Finished difference Result 6897 states and 11306 transitions. [2019-10-15 01:10:25,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:25,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-15 01:10:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:25,938 INFO L225 Difference]: With dead ends: 6897 [2019-10-15 01:10:25,938 INFO L226 Difference]: Without dead ends: 4744 [2019-10-15 01:10:25,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2019-10-15 01:10:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4687. [2019-10-15 01:10:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2019-10-15 01:10:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 7714 transitions. [2019-10-15 01:10:26,185 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 7714 transitions. Word has length 101 [2019-10-15 01:10:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:26,186 INFO L462 AbstractCegarLoop]: Abstraction has 4687 states and 7714 transitions. [2019-10-15 01:10:26,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 7714 transitions. [2019-10-15 01:10:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:10:26,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:26,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,188 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1993722348, now seen corresponding path program 1 times [2019-10-15 01:10:26,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:26,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594573402] [2019-10-15 01:10:26,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:26,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:26,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:26,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594573402] [2019-10-15 01:10:26,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:26,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:26,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788837443] [2019-10-15 01:10:26,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:26,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:26,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:26,329 INFO L87 Difference]: Start difference. First operand 4687 states and 7714 transitions. Second operand 4 states. [2019-10-15 01:10:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:28,566 INFO L93 Difference]: Finished difference Result 14913 states and 25594 transitions. [2019-10-15 01:10:28,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:28,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-15 01:10:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:28,656 INFO L225 Difference]: With dead ends: 14913 [2019-10-15 01:10:28,656 INFO L226 Difference]: Without dead ends: 10296 [2019-10-15 01:10:28,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10296 states. [2019-10-15 01:10:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10296 to 10178. [2019-10-15 01:10:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10178 states. [2019-10-15 01:10:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10178 states to 10178 states and 17570 transitions. [2019-10-15 01:10:29,399 INFO L78 Accepts]: Start accepts. Automaton has 10178 states and 17570 transitions. Word has length 102 [2019-10-15 01:10:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:29,399 INFO L462 AbstractCegarLoop]: Abstraction has 10178 states and 17570 transitions. [2019-10-15 01:10:29,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10178 states and 17570 transitions. [2019-10-15 01:10:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:10:29,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:29,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,402 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1674452760, now seen corresponding path program 1 times [2019-10-15 01:10:29,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:29,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61652341] [2019-10-15 01:10:29,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:29,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:29,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:29,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61652341] [2019-10-15 01:10:29,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:29,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:29,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646775948] [2019-10-15 01:10:29,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:29,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:29,510 INFO L87 Difference]: Start difference. First operand 10178 states and 17570 transitions. Second operand 4 states. [2019-10-15 01:10:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:33,339 INFO L93 Difference]: Finished difference Result 33056 states and 60889 transitions. [2019-10-15 01:10:33,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:33,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-15 01:10:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:33,511 INFO L225 Difference]: With dead ends: 33056 [2019-10-15 01:10:33,511 INFO L226 Difference]: Without dead ends: 22952 [2019-10-15 01:10:33,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22952 states. [2019-10-15 01:10:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22952 to 22701. [2019-10-15 01:10:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22701 states. [2019-10-15 01:10:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22701 states to 22701 states and 42042 transitions. [2019-10-15 01:10:35,306 INFO L78 Accepts]: Start accepts. Automaton has 22701 states and 42042 transitions. Word has length 103 [2019-10-15 01:10:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:35,307 INFO L462 AbstractCegarLoop]: Abstraction has 22701 states and 42042 transitions. [2019-10-15 01:10:35,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 22701 states and 42042 transitions. [2019-10-15 01:10:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:10:35,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:35,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,310 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash 367034030, now seen corresponding path program 1 times [2019-10-15 01:10:35,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:35,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027498432] [2019-10-15 01:10:35,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:35,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:35,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:35,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027498432] [2019-10-15 01:10:35,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:35,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:35,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236193917] [2019-10-15 01:10:35,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:35,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:35,458 INFO L87 Difference]: Start difference. First operand 22701 states and 42042 transitions. Second operand 4 states.