java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:09,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:09,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:09,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:09,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:09,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:09,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:09,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:09,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:09,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:09,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:09,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:09,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:09,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:09,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:09,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:09,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:09,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:09,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:09,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:09,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:09,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:09,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:09,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:09,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:09,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:09,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:09,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:09,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:09,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:09,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:09,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:09,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:09,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:09,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:09,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:09,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:09,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:09,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:09,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:09,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:09,464 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-13 21:11:09,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:09,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:09,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:09,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:09,480 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:09,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:09,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:09,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:09,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:09,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:09,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:09,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:09,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:09,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:09,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:09,482 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:09,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:09,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:09,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:09,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:09,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:09,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:09,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:09,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:09,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:09,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:09,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:09,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:09,484 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-13 21:11:09,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:09,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:09,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:09,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:09,809 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:09,810 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product01.cil.c [2019-10-13 21:11:09,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e02a0f29/d4288bddffcd454eb2c6b23f8c555e69/FLAG9d25ec315 [2019-10-13 21:11:10,514 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:10,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product01.cil.c [2019-10-13 21:11:10,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e02a0f29/d4288bddffcd454eb2c6b23f8c555e69/FLAG9d25ec315 [2019-10-13 21:11:10,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e02a0f29/d4288bddffcd454eb2c6b23f8c555e69 [2019-10-13 21:11:10,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:10,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:10,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:10,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:10,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:10,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b97192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10, skipping insertion in model container [2019-10-13 21:11:10,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,783 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:10,870 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:11,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:11,594 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:11,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:11,802 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:11,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11 WrapperNode [2019-10-13 21:11:11,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:11,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:11,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:11,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:11,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:11,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:11,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:11,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:11,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (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-13 21:11:12,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:12,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:12,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:12,072 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:12,073 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:12,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:12,073 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:12,073 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:12,073 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:12,076 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:12,077 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:12,078 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:12,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:12,080 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:12,083 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:12,084 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:12,087 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:12,087 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:12,087 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:12,087 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:12,087 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:12,088 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:12,090 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:12,090 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:12,090 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:12,090 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:12,090 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:12,103 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:12,109 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:12,109 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:12,110 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:12,118 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:12,118 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:12,118 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:12,119 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:14,591 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:14,592 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:14,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:14 BoogieIcfgContainer [2019-10-13 21:11:14,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:14,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:14,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:14,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:14,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:10" (1/3) ... [2019-10-13 21:11:14,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3067e3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:14, skipping insertion in model container [2019-10-13 21:11:14,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11" (2/3) ... [2019-10-13 21:11:14,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3067e3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:14, skipping insertion in model container [2019-10-13 21:11:14,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:14" (3/3) ... [2019-10-13 21:11:14,602 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product01.cil.c [2019-10-13 21:11:14,612 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:14,622 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:14,634 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:14,665 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:14,665 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:14,665 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:14,666 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:14,666 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:14,666 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:14,666 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:14,666 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-10-13 21:11:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:11:14,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:14,723 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:14,725 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:14,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1682345477, now seen corresponding path program 1 times [2019-10-13 21:11:14,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:14,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624095908] [2019-10-13 21:11:14,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:15,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624095908] [2019-10-13 21:11:15,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:15,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:15,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457207458] [2019-10-13 21:11:15,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:15,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:15,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:15,465 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 7 states. [2019-10-13 21:11:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:15,703 INFO L93 Difference]: Finished difference Result 1161 states and 1906 transitions. [2019-10-13 21:11:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:15,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-10-13 21:11:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:15,737 INFO L225 Difference]: With dead ends: 1161 [2019-10-13 21:11:15,738 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:11:15,753 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-13 21:11:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:11:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-10-13 21:11:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:11:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 948 transitions. [2019-10-13 21:11:15,917 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 948 transitions. Word has length 115 [2019-10-13 21:11:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:15,918 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 948 transitions. [2019-10-13 21:11:15,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 948 transitions. [2019-10-13 21:11:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:11:15,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:15,926 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:15,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash 492962916, now seen corresponding path program 1 times [2019-10-13 21:11:15,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:15,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530916482] [2019-10-13 21:11:15,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:16,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530916482] [2019-10-13 21:11:16,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:16,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805418297] [2019-10-13 21:11:16,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:16,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:16,195 INFO L87 Difference]: Start difference. First operand 587 states and 948 transitions. Second operand 4 states. [2019-10-13 21:11:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:16,265 INFO L93 Difference]: Finished difference Result 1140 states and 1861 transitions. [2019-10-13 21:11:16,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:16,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-13 21:11:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:16,271 INFO L225 Difference]: With dead ends: 1140 [2019-10-13 21:11:16,271 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:11:16,275 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-13 21:11:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:11:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:11:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:11:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 915 transitions. [2019-10-13 21:11:16,353 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 915 transitions. Word has length 116 [2019-10-13 21:11:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:16,356 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 915 transitions. [2019-10-13 21:11:16,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 915 transitions. [2019-10-13 21:11:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:11:16,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:16,361 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:16,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:16,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1591926986, now seen corresponding path program 1 times [2019-10-13 21:11:16,362 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:16,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024156874] [2019-10-13 21:11:16,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:16,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024156874] [2019-10-13 21:11:16,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:16,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909942057] [2019-10-13 21:11:16,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:16,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:16,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:16,539 INFO L87 Difference]: Start difference. First operand 569 states and 915 transitions. Second operand 7 states. [2019-10-13 21:11:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:16,674 INFO L93 Difference]: Finished difference Result 1109 states and 1803 transitions. [2019-10-13 21:11:16,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:16,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-10-13 21:11:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:16,684 INFO L225 Difference]: With dead ends: 1109 [2019-10-13 21:11:16,684 INFO L226 Difference]: Without dead ends: 563 [2019-10-13 21:11:16,687 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-13 21:11:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-13 21:11:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-13 21:11:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-13 21:11:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 902 transitions. [2019-10-13 21:11:16,725 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 902 transitions. Word has length 116 [2019-10-13 21:11:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:16,727 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 902 transitions. [2019-10-13 21:11:16,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 902 transitions. [2019-10-13 21:11:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:11:16,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:16,733 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:16,734 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1250073911, now seen corresponding path program 1 times [2019-10-13 21:11:16,734 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:16,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863641683] [2019-10-13 21:11:16,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:16,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863641683] [2019-10-13 21:11:16,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:16,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129974288] [2019-10-13 21:11:16,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:16,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:16,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:16,954 INFO L87 Difference]: Start difference. First operand 563 states and 902 transitions. Second operand 7 states. [2019-10-13 21:11:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,070 INFO L93 Difference]: Finished difference Result 1097 states and 1777 transitions. [2019-10-13 21:11:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:17,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-13 21:11:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,077 INFO L225 Difference]: With dead ends: 1097 [2019-10-13 21:11:17,077 INFO L226 Difference]: Without dead ends: 557 [2019-10-13 21:11:17,083 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-13 21:11:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-13 21:11:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-10-13 21:11:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-13 21:11:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 889 transitions. [2019-10-13 21:11:17,113 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 889 transitions. Word has length 117 [2019-10-13 21:11:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,114 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 889 transitions. [2019-10-13 21:11:17,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 889 transitions. [2019-10-13 21:11:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:11:17,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,120 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:17,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash 803183822, now seen corresponding path program 1 times [2019-10-13 21:11:17,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745609973] [2019-10-13 21:11:17,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:17,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745609973] [2019-10-13 21:11:17,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:17,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158381582] [2019-10-13 21:11:17,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:17,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:17,360 INFO L87 Difference]: Start difference. First operand 557 states and 889 transitions. Second operand 7 states. [2019-10-13 21:11:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,452 INFO L93 Difference]: Finished difference Result 1085 states and 1751 transitions. [2019-10-13 21:11:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:17,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-13 21:11:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,457 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:11:17,457 INFO L226 Difference]: Without dead ends: 551 [2019-10-13 21:11:17,460 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-13 21:11:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-13 21:11:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-13 21:11:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-13 21:11:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 876 transitions. [2019-10-13 21:11:17,480 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 876 transitions. Word has length 118 [2019-10-13 21:11:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,481 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 876 transitions. [2019-10-13 21:11:17,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 876 transitions. [2019-10-13 21:11:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:11:17,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,484 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:17,485 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash -377403377, now seen corresponding path program 1 times [2019-10-13 21:11:17,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379355742] [2019-10-13 21:11:17,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:17,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379355742] [2019-10-13 21:11:17,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:17,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20189912] [2019-10-13 21:11:17,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:17,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:17,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:17,641 INFO L87 Difference]: Start difference. First operand 551 states and 876 transitions. Second operand 7 states. [2019-10-13 21:11:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,720 INFO L93 Difference]: Finished difference Result 1073 states and 1725 transitions. [2019-10-13 21:11:17,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:17,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-13 21:11:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,727 INFO L225 Difference]: With dead ends: 1073 [2019-10-13 21:11:17,727 INFO L226 Difference]: Without dead ends: 551 [2019-10-13 21:11:17,733 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-13 21:11:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-13 21:11:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-13 21:11:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-13 21:11:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 875 transitions. [2019-10-13 21:11:17,756 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 875 transitions. Word has length 118 [2019-10-13 21:11:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,756 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 875 transitions. [2019-10-13 21:11:17,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 875 transitions. [2019-10-13 21:11:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:11:17,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,760 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:17,760 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash -9363571, now seen corresponding path program 1 times [2019-10-13 21:11:17,761 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577399388] [2019-10-13 21:11:17,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:17,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577399388] [2019-10-13 21:11:17,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:17,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102915965] [2019-10-13 21:11:17,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:17,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:17,970 INFO L87 Difference]: Start difference. First operand 551 states and 875 transitions. Second operand 5 states. [2019-10-13 21:11:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,066 INFO L93 Difference]: Finished difference Result 1072 states and 1722 transitions. [2019-10-13 21:11:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:18,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-13 21:11:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,077 INFO L225 Difference]: With dead ends: 1072 [2019-10-13 21:11:18,077 INFO L226 Difference]: Without dead ends: 551 [2019-10-13 21:11:18,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-13 21:11:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-13 21:11:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-13 21:11:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 874 transitions. [2019-10-13 21:11:18,114 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 874 transitions. Word has length 119 [2019-10-13 21:11:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,115 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 874 transitions. [2019-10-13 21:11:18,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 874 transitions. [2019-10-13 21:11:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:11:18,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,122 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:18,122 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1274402062, now seen corresponding path program 1 times [2019-10-13 21:11:18,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744515890] [2019-10-13 21:11:18,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:18,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744515890] [2019-10-13 21:11:18,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:18,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579831925] [2019-10-13 21:11:18,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:18,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:18,343 INFO L87 Difference]: Start difference. First operand 551 states and 874 transitions. Second operand 5 states. [2019-10-13 21:11:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,421 INFO L93 Difference]: Finished difference Result 1072 states and 1720 transitions. [2019-10-13 21:11:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:18,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-13 21:11:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,430 INFO L225 Difference]: With dead ends: 1072 [2019-10-13 21:11:18,430 INFO L226 Difference]: Without dead ends: 551 [2019-10-13 21:11:18,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-13 21:11:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-13 21:11:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-13 21:11:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 873 transitions. [2019-10-13 21:11:18,456 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 873 transitions. Word has length 120 [2019-10-13 21:11:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,457 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 873 transitions. [2019-10-13 21:11:18,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 873 transitions. [2019-10-13 21:11:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:11:18,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,461 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:18,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1402359096, now seen corresponding path program 1 times [2019-10-13 21:11:18,462 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84433100] [2019-10-13 21:11:18,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:18,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84433100] [2019-10-13 21:11:18,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:18,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125432144] [2019-10-13 21:11:18,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:18,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:18,594 INFO L87 Difference]: Start difference. First operand 551 states and 873 transitions. Second operand 5 states. [2019-10-13 21:11:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,662 INFO L93 Difference]: Finished difference Result 1072 states and 1718 transitions. [2019-10-13 21:11:18,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:18,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-13 21:11:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,667 INFO L225 Difference]: With dead ends: 1072 [2019-10-13 21:11:18,668 INFO L226 Difference]: Without dead ends: 551 [2019-10-13 21:11:18,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-13 21:11:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-13 21:11:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-13 21:11:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 872 transitions. [2019-10-13 21:11:18,697 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 872 transitions. Word has length 121 [2019-10-13 21:11:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,697 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 872 transitions. [2019-10-13 21:11:18,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 872 transitions. [2019-10-13 21:11:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:11:18,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,701 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:18,701 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1993568105, now seen corresponding path program 1 times [2019-10-13 21:11:18,702 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938499224] [2019-10-13 21:11:18,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:18,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938499224] [2019-10-13 21:11:18,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:18,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451545229] [2019-10-13 21:11:18,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:18,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:18,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:18,895 INFO L87 Difference]: Start difference. First operand 551 states and 872 transitions. Second operand 5 states. [2019-10-13 21:11:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,964 INFO L93 Difference]: Finished difference Result 1072 states and 1716 transitions. [2019-10-13 21:11:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:18,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-13 21:11:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,971 INFO L225 Difference]: With dead ends: 1072 [2019-10-13 21:11:18,972 INFO L226 Difference]: Without dead ends: 551 [2019-10-13 21:11:18,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-13 21:11:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-13 21:11:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-13 21:11:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 871 transitions. [2019-10-13 21:11:19,000 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 871 transitions. Word has length 122 [2019-10-13 21:11:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,000 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 871 transitions. [2019-10-13 21:11:19,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 871 transitions. [2019-10-13 21:11:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:11:19,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,004 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:19,004 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash 369306115, now seen corresponding path program 1 times [2019-10-13 21:11:19,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699470017] [2019-10-13 21:11:19,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:19,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699470017] [2019-10-13 21:11:19,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:11:19,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260652090] [2019-10-13 21:11:19,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:11:19,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:11:19,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:19,249 INFO L87 Difference]: Start difference. First operand 551 states and 871 transitions. Second operand 8 states. [2019-10-13 21:11:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:21,950 INFO L93 Difference]: Finished difference Result 1991 states and 3207 transitions. [2019-10-13 21:11:21,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:11:21,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-13 21:11:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:21,975 INFO L225 Difference]: With dead ends: 1991 [2019-10-13 21:11:21,975 INFO L226 Difference]: Without dead ends: 1474 [2019-10-13 21:11:21,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-10-13 21:11:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1462. [2019-10-13 21:11:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2019-10-13 21:11:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2316 transitions. [2019-10-13 21:11:22,051 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2316 transitions. Word has length 123 [2019-10-13 21:11:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:22,052 INFO L462 AbstractCegarLoop]: Abstraction has 1462 states and 2316 transitions. [2019-10-13 21:11:22,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:11:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2316 transitions. [2019-10-13 21:11:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:11:22,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:22,055 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:22,056 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1777046166, now seen corresponding path program 1 times [2019-10-13 21:11:22,056 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:22,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624841638] [2019-10-13 21:11:22,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:11:22,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624841638] [2019-10-13 21:11:22,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427986691] [2019-10-13 21:11:22,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:22,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 2970 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:22,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:22,875 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:23,025 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:23,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:11:23,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96584054] [2019-10-13 21:11:23,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:23,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:23,027 INFO L87 Difference]: Start difference. First operand 1462 states and 2316 transitions. Second operand 3 states. [2019-10-13 21:11:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:23,152 INFO L93 Difference]: Finished difference Result 4190 states and 6778 transitions. [2019-10-13 21:11:23,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:23,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-13 21:11:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:23,176 INFO L225 Difference]: With dead ends: 4190 [2019-10-13 21:11:23,176 INFO L226 Difference]: Without dead ends: 2762 [2019-10-13 21:11:23,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-10-13 21:11:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2656. [2019-10-13 21:11:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-10-13 21:11:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4276 transitions. [2019-10-13 21:11:23,342 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4276 transitions. Word has length 128 [2019-10-13 21:11:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:23,343 INFO L462 AbstractCegarLoop]: Abstraction has 2656 states and 4276 transitions. [2019-10-13 21:11:23,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4276 transitions. [2019-10-13 21:11:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:11:23,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:23,348 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:23,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:23,557 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash -436249760, now seen corresponding path program 1 times [2019-10-13 21:11:23,558 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:23,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612021729] [2019-10-13 21:11:23,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:23,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:23,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:11:23,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612021729] [2019-10-13 21:11:23,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438615749] [2019-10-13 21:11:23,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:24,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 2971 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:24,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:24,528 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:24,677 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:24,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:11:24,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927209492] [2019-10-13 21:11:24,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:24,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:24,679 INFO L87 Difference]: Start difference. First operand 2656 states and 4276 transitions. Second operand 3 states. [2019-10-13 21:11:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:24,853 INFO L93 Difference]: Finished difference Result 5840 states and 9473 transitions. [2019-10-13 21:11:24,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:24,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-13 21:11:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:24,883 INFO L225 Difference]: With dead ends: 5840 [2019-10-13 21:11:24,883 INFO L226 Difference]: Without dead ends: 3218 [2019-10-13 21:11:24,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2019-10-13 21:11:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3124. [2019-10-13 21:11:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2019-10-13 21:11:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 5037 transitions. [2019-10-13 21:11:25,125 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 5037 transitions. Word has length 129 [2019-10-13 21:11:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:25,125 INFO L462 AbstractCegarLoop]: Abstraction has 3124 states and 5037 transitions. [2019-10-13 21:11:25,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5037 transitions. [2019-10-13 21:11:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:11:25,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:25,131 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:25,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:25,346 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1194427011, now seen corresponding path program 1 times [2019-10-13 21:11:25,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:25,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634133699] [2019-10-13 21:11:25,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:25,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:25,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:25,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634133699] [2019-10-13 21:11:25,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:25,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:25,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986306958] [2019-10-13 21:11:25,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:25,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:25,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:25,534 INFO L87 Difference]: Start difference. First operand 3124 states and 5037 transitions. Second operand 7 states. [2019-10-13 21:11:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:28,055 INFO L93 Difference]: Finished difference Result 9248 states and 15209 transitions. [2019-10-13 21:11:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:28,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-10-13 21:11:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:28,102 INFO L225 Difference]: With dead ends: 9248 [2019-10-13 21:11:28,102 INFO L226 Difference]: Without dead ends: 6158 [2019-10-13 21:11:28,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2019-10-13 21:11:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 6070. [2019-10-13 21:11:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6070 states. [2019-10-13 21:11:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6070 states to 6070 states and 9897 transitions. [2019-10-13 21:11:28,382 INFO L78 Accepts]: Start accepts. Automaton has 6070 states and 9897 transitions. Word has length 131 [2019-10-13 21:11:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:28,385 INFO L462 AbstractCegarLoop]: Abstraction has 6070 states and 9897 transitions. [2019-10-13 21:11:28,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 9897 transitions. [2019-10-13 21:11:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:11:28,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:28,389 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:28,389 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:28,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1363748022, now seen corresponding path program 1 times [2019-10-13 21:11:28,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:28,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164600561] [2019-10-13 21:11:28,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:28,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:28,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:11:28,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164600561] [2019-10-13 21:11:28,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:28,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:28,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147880907] [2019-10-13 21:11:28,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:28,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:28,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:28,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:28,534 INFO L87 Difference]: Start difference. First operand 6070 states and 9897 transitions. Second operand 4 states. [2019-10-13 21:11:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:28,826 INFO L93 Difference]: Finished difference Result 12098 states and 19931 transitions. [2019-10-13 21:11:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:28,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-13 21:11:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:28,889 INFO L225 Difference]: With dead ends: 12098 [2019-10-13 21:11:28,889 INFO L226 Difference]: Without dead ends: 6062 [2019-10-13 21:11:28,923 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-13 21:11:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2019-10-13 21:11:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 6040. [2019-10-13 21:11:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6040 states. [2019-10-13 21:11:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 9809 transitions. [2019-10-13 21:11:29,288 INFO L78 Accepts]: Start accepts. Automaton has 6040 states and 9809 transitions. Word has length 132 [2019-10-13 21:11:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:29,289 INFO L462 AbstractCegarLoop]: Abstraction has 6040 states and 9809 transitions. [2019-10-13 21:11:29,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6040 states and 9809 transitions. [2019-10-13 21:11:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:11:29,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:29,294 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:29,294 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:29,294 INFO L82 PathProgramCache]: Analyzing trace with hash -645502412, now seen corresponding path program 1 times [2019-10-13 21:11:29,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:29,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825655801] [2019-10-13 21:11:29,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:11:29,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825655801] [2019-10-13 21:11:29,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:29,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:29,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481426295] [2019-10-13 21:11:29,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:29,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:29,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:29,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:29,455 INFO L87 Difference]: Start difference. First operand 6040 states and 9809 transitions. Second operand 7 states. [2019-10-13 21:11:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:32,240 INFO L93 Difference]: Finished difference Result 18074 states and 30004 transitions. [2019-10-13 21:11:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:32,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-13 21:11:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:32,311 INFO L225 Difference]: With dead ends: 18074 [2019-10-13 21:11:32,311 INFO L226 Difference]: Without dead ends: 12068 [2019-10-13 21:11:32,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12068 states. [2019-10-13 21:11:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12068 to 11940. [2019-10-13 21:11:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2019-10-13 21:11:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 19689 transitions. [2019-10-13 21:11:32,800 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 19689 transitions. Word has length 140 [2019-10-13 21:11:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:32,800 INFO L462 AbstractCegarLoop]: Abstraction has 11940 states and 19689 transitions. [2019-10-13 21:11:32,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 19689 transitions. [2019-10-13 21:11:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:11:32,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:32,804 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:32,805 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:32,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1819027569, now seen corresponding path program 1 times [2019-10-13 21:11:32,806 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:32,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409511189] [2019-10-13 21:11:32,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:32,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:32,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:11:32,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409511189] [2019-10-13 21:11:32,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:32,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:32,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043820739] [2019-10-13 21:11:32,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:32,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:32,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:32,923 INFO L87 Difference]: Start difference. First operand 11940 states and 19689 transitions. Second operand 4 states. [2019-10-13 21:11:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:34,024 INFO L93 Difference]: Finished difference Result 23908 states and 39885 transitions. [2019-10-13 21:11:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:34,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-13 21:11:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:34,117 INFO L225 Difference]: With dead ends: 23908 [2019-10-13 21:11:34,117 INFO L226 Difference]: Without dead ends: 11996 [2019-10-13 21:11:34,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11996 states. [2019-10-13 21:11:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11996 to 11948. [2019-10-13 21:11:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11948 states. [2019-10-13 21:11:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11948 states to 11948 states and 19640 transitions. [2019-10-13 21:11:34,622 INFO L78 Accepts]: Start accepts. Automaton has 11948 states and 19640 transitions. Word has length 141 [2019-10-13 21:11:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:34,623 INFO L462 AbstractCegarLoop]: Abstraction has 11948 states and 19640 transitions. [2019-10-13 21:11:34,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11948 states and 19640 transitions. [2019-10-13 21:11:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:11:34,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:34,628 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:34,628 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1952473812, now seen corresponding path program 1 times [2019-10-13 21:11:34,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:34,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742718652] [2019-10-13 21:11:34,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:34,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:34,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:34,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742718652] [2019-10-13 21:11:34,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:34,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:34,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497195892] [2019-10-13 21:11:34,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:34,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:34,792 INFO L87 Difference]: Start difference. First operand 11948 states and 19640 transitions. Second operand 7 states. [2019-10-13 21:11:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:37,627 INFO L93 Difference]: Finished difference Result 35914 states and 60647 transitions. [2019-10-13 21:11:37,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:37,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-10-13 21:11:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:37,849 INFO L225 Difference]: With dead ends: 35914 [2019-10-13 21:11:37,850 INFO L226 Difference]: Without dead ends: 24000 [2019-10-13 21:11:37,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24000 states. [2019-10-13 21:11:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24000 to 23804. [2019-10-13 21:11:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23804 states. [2019-10-13 21:11:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23804 states to 23804 states and 39994 transitions. [2019-10-13 21:11:39,051 INFO L78 Accepts]: Start accepts. Automaton has 23804 states and 39994 transitions. Word has length 150 [2019-10-13 21:11:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,052 INFO L462 AbstractCegarLoop]: Abstraction has 23804 states and 39994 transitions. [2019-10-13 21:11:39,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 23804 states and 39994 transitions. [2019-10-13 21:11:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:11:39,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,057 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:39,057 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,058 INFO L82 PathProgramCache]: Analyzing trace with hash 48665393, now seen corresponding path program 1 times [2019-10-13 21:11:39,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261880462] [2019-10-13 21:11:39,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:11:39,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261880462] [2019-10-13 21:11:39,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:39,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136015881] [2019-10-13 21:11:39,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:39,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:39,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:39,175 INFO L87 Difference]: Start difference. First operand 23804 states and 39994 transitions. Second operand 4 states. [2019-10-13 21:11:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,064 INFO L93 Difference]: Finished difference Result 47704 states and 81377 transitions. [2019-10-13 21:11:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-13 21:11:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,270 INFO L225 Difference]: With dead ends: 47704 [2019-10-13 21:11:40,270 INFO L226 Difference]: Without dead ends: 23926 [2019-10-13 21:11:40,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23926 states. [2019-10-13 21:11:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23926 to 23826. [2019-10-13 21:11:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23826 states. [2019-10-13 21:11:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23826 states to 23826 states and 39950 transitions. [2019-10-13 21:11:41,308 INFO L78 Accepts]: Start accepts. Automaton has 23826 states and 39950 transitions. Word has length 151 [2019-10-13 21:11:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:41,309 INFO L462 AbstractCegarLoop]: Abstraction has 23826 states and 39950 transitions. [2019-10-13 21:11:41,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 23826 states and 39950 transitions. [2019-10-13 21:11:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:11:41,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:41,316 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:41,317 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1671445867, now seen corresponding path program 1 times [2019-10-13 21:11:41,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:41,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17204271] [2019-10-13 21:11:41,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:11:41,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17204271] [2019-10-13 21:11:41,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:41,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:41,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532538812] [2019-10-13 21:11:41,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:41,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:41,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:41,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:41,462 INFO L87 Difference]: Start difference. First operand 23826 states and 39950 transitions. Second operand 7 states.