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_spec14_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:07,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:07,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:07,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:07,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:07,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:07,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:07,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:07,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:07,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:07,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:07,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:07,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:07,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:07,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:07,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:07,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:07,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:07,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:07,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:07,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:07,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:07,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:07,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:07,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:07,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:07,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:07,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:07,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:07,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:07,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:07,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:07,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:07,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:07,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:07,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:07,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:07,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:07,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:07,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:07,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:07,102 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:09:07,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:07,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:07,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:07,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:07,122 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:07,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:07,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:07,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:07,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:07,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:07,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:07,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:07,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:07,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:07,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:07,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:07,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:07,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:07,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:07,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:07,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:07,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:07,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:07,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:07,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:07,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:07,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:07,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:07,126 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:09:07,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:07,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:07,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:07,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:07,401 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:07,402 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product27.cil.c [2019-10-13 21:09:07,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3735f72/b3e7c2050c76425d9ff6b50f62254a1b/FLAG7c9a03949 [2019-10-13 21:09:08,048 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:08,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product27.cil.c [2019-10-13 21:09:08,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3735f72/b3e7c2050c76425d9ff6b50f62254a1b/FLAG7c9a03949 [2019-10-13 21:09:08,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3735f72/b3e7c2050c76425d9ff6b50f62254a1b [2019-10-13 21:09:08,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:08,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:08,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:08,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:08,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:08,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af1711a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08, skipping insertion in model container [2019-10-13 21:09:08,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,318 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:08,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:09,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:09,097 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:09,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:09,311 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:09,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09 WrapperNode [2019-10-13 21:09:09,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:09,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:09,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:09,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:09,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:09,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:09,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:09,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:09,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (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:09:09,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:09,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:09,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:09,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:09,595 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:09,596 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:09,596 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:09,597 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:09:09,597 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:09,598 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:09:09,598 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:09:09,598 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:09,598 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:09,599 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:09,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:09,600 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:09,603 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:09,608 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:09,608 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:09,608 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:09,609 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:09,610 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:09,610 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:09,610 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:09,610 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:09,610 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:09,611 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:09,611 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:09,611 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:09,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:09,611 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:09,611 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:09,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:09,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:09,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:09,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:09,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:09,614 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:09,614 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:09,614 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:09,614 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:09,615 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:09,615 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:09,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:09,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:09,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:09,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:09,616 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:09,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:09,616 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:09,617 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:09,617 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:09,618 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:09,618 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:09,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:09,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:09,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:09:09,624 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:09:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:09:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:09,626 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:09,627 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:09,628 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:09,629 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:09,630 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:09,631 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:09,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:09,637 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:09,637 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:09,637 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:09,638 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:09,638 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:09,639 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:09,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:09,648 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:09,648 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:09,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:09,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:09,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:12,135 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:12,136 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:12,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:12 BoogieIcfgContainer [2019-10-13 21:09:12,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:12,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:12,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:12,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:12,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:09:08" (1/3) ... [2019-10-13 21:09:12,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6399b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:12, skipping insertion in model container [2019-10-13 21:09:12,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (2/3) ... [2019-10-13 21:09:12,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6399b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:12, skipping insertion in model container [2019-10-13 21:09:12,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:12" (3/3) ... [2019-10-13 21:09:12,147 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product27.cil.c [2019-10-13 21:09:12,156 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:12,164 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:12,174 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:12,206 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:12,206 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:12,206 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:12,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:12,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:12,207 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:12,207 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:12,207 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states. [2019-10-13 21:09:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:09:12,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:12,276 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:12,278 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1973380872, now seen corresponding path program 1 times [2019-10-13 21:09:12,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:12,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682682142] [2019-10-13 21:09:12,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:12,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682682142] [2019-10-13 21:09:12,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:12,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:12,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711550983] [2019-10-13 21:09:12,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:12,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:12,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:12,900 INFO L87 Difference]: Start difference. First operand 751 states. Second operand 4 states. [2019-10-13 21:09:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,134 INFO L93 Difference]: Finished difference Result 1200 states and 1920 transitions. [2019-10-13 21:09:13,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:13,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-13 21:09:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,167 INFO L225 Difference]: With dead ends: 1200 [2019-10-13 21:09:13,167 INFO L226 Difference]: Without dead ends: 603 [2019-10-13 21:09:13,179 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:09:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-13 21:09:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-13 21:09:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:09:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 951 transitions. [2019-10-13 21:09:13,274 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 951 transitions. Word has length 135 [2019-10-13 21:09:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,275 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 951 transitions. [2019-10-13 21:09:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 951 transitions. [2019-10-13 21:09:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:09:13,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,284 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:13,285 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1520755359, now seen corresponding path program 1 times [2019-10-13 21:09:13,285 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373714931] [2019-10-13 21:09:13,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373714931] [2019-10-13 21:09:13,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666298203] [2019-10-13 21:09:13,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,502 INFO L87 Difference]: Start difference. First operand 603 states and 951 transitions. Second operand 4 states. [2019-10-13 21:09:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,666 INFO L93 Difference]: Finished difference Result 1173 states and 1863 transitions. [2019-10-13 21:09:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:09:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,675 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:09:13,676 INFO L226 Difference]: Without dead ends: 603 [2019-10-13 21:09:13,681 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:09:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-13 21:09:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-13 21:09:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:09:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 950 transitions. [2019-10-13 21:09:13,745 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 950 transitions. Word has length 136 [2019-10-13 21:09:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,747 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 950 transitions. [2019-10-13 21:09:13,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 950 transitions. [2019-10-13 21:09:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:09:13,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,758 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:13,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -25629804, now seen corresponding path program 1 times [2019-10-13 21:09:13,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520691750] [2019-10-13 21:09:13,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520691750] [2019-10-13 21:09:13,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113833875] [2019-10-13 21:09:13,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,922 INFO L87 Difference]: Start difference. First operand 603 states and 950 transitions. Second operand 4 states. [2019-10-13 21:09:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,998 INFO L93 Difference]: Finished difference Result 1173 states and 1862 transitions. [2019-10-13 21:09:13,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:09:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,005 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:09:14,005 INFO L226 Difference]: Without dead ends: 603 [2019-10-13 21:09:14,009 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:09:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-13 21:09:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-13 21:09:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:09:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 949 transitions. [2019-10-13 21:09:14,041 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 949 transitions. Word has length 137 [2019-10-13 21:09:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,042 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 949 transitions. [2019-10-13 21:09:14,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 949 transitions. [2019-10-13 21:09:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:09:14,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,046 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:14,046 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -572741315, now seen corresponding path program 1 times [2019-10-13 21:09:14,047 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117723547] [2019-10-13 21:09:14,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:14,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117723547] [2019-10-13 21:09:14,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:14,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107166597] [2019-10-13 21:09:14,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:14,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:14,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:14,171 INFO L87 Difference]: Start difference. First operand 603 states and 949 transitions. Second operand 4 states. [2019-10-13 21:09:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,281 INFO L93 Difference]: Finished difference Result 1173 states and 1861 transitions. [2019-10-13 21:09:14,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:09:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,290 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:09:14,290 INFO L226 Difference]: Without dead ends: 603 [2019-10-13 21:09:14,295 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:09:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-13 21:09:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-13 21:09:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:09:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 948 transitions. [2019-10-13 21:09:14,340 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 948 transitions. Word has length 138 [2019-10-13 21:09:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,341 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 948 transitions. [2019-10-13 21:09:14,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 948 transitions. [2019-10-13 21:09:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:09:14,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,351 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:14,352 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash -4692432, now seen corresponding path program 1 times [2019-10-13 21:09:14,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187321863] [2019-10-13 21:09:14,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:14,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187321863] [2019-10-13 21:09:14,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:14,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115948375] [2019-10-13 21:09:14,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:14,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:14,598 INFO L87 Difference]: Start difference. First operand 603 states and 948 transitions. Second operand 4 states. [2019-10-13 21:09:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,663 INFO L93 Difference]: Finished difference Result 1173 states and 1860 transitions. [2019-10-13 21:09:14,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:09:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,675 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:09:14,675 INFO L226 Difference]: Without dead ends: 603 [2019-10-13 21:09:14,678 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:09:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-13 21:09:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-13 21:09:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-13 21:09:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 947 transitions. [2019-10-13 21:09:14,703 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 947 transitions. Word has length 139 [2019-10-13 21:09:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,704 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 947 transitions. [2019-10-13 21:09:14,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 947 transitions. [2019-10-13 21:09:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:14,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,708 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:14,708 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash 773590297, now seen corresponding path program 1 times [2019-10-13 21:09:14,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548739561] [2019-10-13 21:09:14,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:14,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548739561] [2019-10-13 21:09:14,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:09:14,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748500209] [2019-10-13 21:09:14,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:09:14,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:09:14,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:09:14,900 INFO L87 Difference]: Start difference. First operand 603 states and 947 transitions. Second operand 10 states. [2019-10-13 21:09:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,066 INFO L93 Difference]: Finished difference Result 1178 states and 1867 transitions. [2019-10-13 21:09:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:15,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:09:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,072 INFO L225 Difference]: With dead ends: 1178 [2019-10-13 21:09:15,072 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 21:09:15,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 21:09:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-13 21:09:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:09:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 957 transitions. [2019-10-13 21:09:15,152 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 957 transitions. Word has length 140 [2019-10-13 21:09:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,153 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 957 transitions. [2019-10-13 21:09:15,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:09:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 957 transitions. [2019-10-13 21:09:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:15,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,157 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:15,158 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,158 INFO L82 PathProgramCache]: Analyzing trace with hash -212992392, now seen corresponding path program 1 times [2019-10-13 21:09:15,158 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494272721] [2019-10-13 21:09:15,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:15,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494272721] [2019-10-13 21:09:15,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:15,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623736064] [2019-10-13 21:09:15,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:15,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:15,262 INFO L87 Difference]: Start difference. First operand 610 states and 957 transitions. Second operand 4 states. [2019-10-13 21:09:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,325 INFO L93 Difference]: Finished difference Result 1179 states and 1868 transitions. [2019-10-13 21:09:15,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:15,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:09:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,332 INFO L225 Difference]: With dead ends: 1179 [2019-10-13 21:09:15,332 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 21:09:15,335 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:09:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 21:09:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-13 21:09:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-13 21:09:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 950 transitions. [2019-10-13 21:09:15,358 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 950 transitions. Word has length 140 [2019-10-13 21:09:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,358 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 950 transitions. [2019-10-13 21:09:15,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 950 transitions. [2019-10-13 21:09:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:09:15,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,362 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:15,363 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -429509062, now seen corresponding path program 1 times [2019-10-13 21:09:15,363 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891984138] [2019-10-13 21:09:15,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:15,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891984138] [2019-10-13 21:09:15,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:15,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097005849] [2019-10-13 21:09:15,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:15,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:15,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:15,487 INFO L87 Difference]: Start difference. First operand 606 states and 950 transitions. Second operand 6 states. [2019-10-13 21:09:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,776 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2019-10-13 21:09:15,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:15,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:09:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,782 INFO L225 Difference]: With dead ends: 1192 [2019-10-13 21:09:15,782 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:09:15,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:09:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2019-10-13 21:09:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:09:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-10-13 21:09:15,814 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 141 [2019-10-13 21:09:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,814 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-10-13 21:09:15,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-10-13 21:09:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:09:15,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,819 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:15,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash 16704540, now seen corresponding path program 1 times [2019-10-13 21:09:15,820 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991070373] [2019-10-13 21:09:15,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991070373] [2019-10-13 21:09:16,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442076591] [2019-10-13 21:09:16,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,019 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 6 states. [2019-10-13 21:09:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,251 INFO L93 Difference]: Finished difference Result 1155 states and 1807 transitions. [2019-10-13 21:09:16,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:16,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:09:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,261 INFO L225 Difference]: With dead ends: 1155 [2019-10-13 21:09:16,261 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:09:16,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:09:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:09:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:09:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 947 transitions. [2019-10-13 21:09:16,286 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 947 transitions. Word has length 142 [2019-10-13 21:09:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,286 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 947 transitions. [2019-10-13 21:09:16,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 947 transitions. [2019-10-13 21:09:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:16,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,291 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:16,291 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash -155948033, now seen corresponding path program 1 times [2019-10-13 21:09:16,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601062053] [2019-10-13 21:09:16,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601062053] [2019-10-13 21:09:16,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540731233] [2019-10-13 21:09:16,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,442 INFO L87 Difference]: Start difference. First operand 611 states and 947 transitions. Second operand 6 states. [2019-10-13 21:09:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,670 INFO L93 Difference]: Finished difference Result 1155 states and 1803 transitions. [2019-10-13 21:09:16,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:16,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:09:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,676 INFO L225 Difference]: With dead ends: 1155 [2019-10-13 21:09:16,676 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:09:16,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:09:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:09:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:09:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 943 transitions. [2019-10-13 21:09:16,704 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 943 transitions. Word has length 143 [2019-10-13 21:09:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,705 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 943 transitions. [2019-10-13 21:09:16,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 943 transitions. [2019-10-13 21:09:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:16,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,709 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:16,709 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash 121383039, now seen corresponding path program 1 times [2019-10-13 21:09:16,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856525802] [2019-10-13 21:09:16,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856525802] [2019-10-13 21:09:16,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:16,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813690523] [2019-10-13 21:09:16,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:16,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:16,886 INFO L87 Difference]: Start difference. First operand 611 states and 943 transitions. Second operand 7 states. [2019-10-13 21:09:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,001 INFO L93 Difference]: Finished difference Result 1158 states and 1803 transitions. [2019-10-13 21:09:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:17,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:09:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,007 INFO L225 Difference]: With dead ends: 1158 [2019-10-13 21:09:17,007 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 21:09:17,010 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:09:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 21:09:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2019-10-13 21:09:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 906 transitions. [2019-10-13 21:09:17,030 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 906 transitions. Word has length 143 [2019-10-13 21:09:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,031 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 906 transitions. [2019-10-13 21:09:17,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 906 transitions. [2019-10-13 21:09:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:09:17,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,035 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:17,035 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1961384449, now seen corresponding path program 1 times [2019-10-13 21:09:17,036 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312641415] [2019-10-13 21:09:17,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:17,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312641415] [2019-10-13 21:09:17,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:17,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890005483] [2019-10-13 21:09:17,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:17,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:17,166 INFO L87 Difference]: Start difference. First operand 590 states and 906 transitions. Second operand 6 states. [2019-10-13 21:09:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,284 INFO L93 Difference]: Finished difference Result 1134 states and 1762 transitions. [2019-10-13 21:09:17,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:09:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,289 INFO L225 Difference]: With dead ends: 1134 [2019-10-13 21:09:17,289 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:09:17,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:09:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:09:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 905 transitions. [2019-10-13 21:09:17,311 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 905 transitions. Word has length 144 [2019-10-13 21:09:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,311 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 905 transitions. [2019-10-13 21:09:17,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 905 transitions. [2019-10-13 21:09:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:09:17,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,315 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:17,315 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2053809604, now seen corresponding path program 1 times [2019-10-13 21:09:17,316 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030264767] [2019-10-13 21:09:17,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:17,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030264767] [2019-10-13 21:09:17,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:17,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411829890] [2019-10-13 21:09:17,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:17,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:17,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:17,431 INFO L87 Difference]: Start difference. First operand 590 states and 905 transitions. Second operand 6 states. [2019-10-13 21:09:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,549 INFO L93 Difference]: Finished difference Result 1134 states and 1761 transitions. [2019-10-13 21:09:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:09:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,555 INFO L225 Difference]: With dead ends: 1134 [2019-10-13 21:09:17,555 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:09:17,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:09:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:09:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 904 transitions. [2019-10-13 21:09:17,579 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 904 transitions. Word has length 145 [2019-10-13 21:09:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,580 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 904 transitions. [2019-10-13 21:09:17,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 904 transitions. [2019-10-13 21:09:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:09:17,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,584 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:17,584 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash -496350234, now seen corresponding path program 1 times [2019-10-13 21:09:17,584 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306764243] [2019-10-13 21:09:17,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:17,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306764243] [2019-10-13 21:09:17,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:09:17,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282131658] [2019-10-13 21:09:17,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:09:17,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:09:17,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:17,800 INFO L87 Difference]: Start difference. First operand 590 states and 904 transitions. Second operand 12 states. [2019-10-13 21:09:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:18,040 INFO L93 Difference]: Finished difference Result 1140 states and 1771 transitions. [2019-10-13 21:09:18,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:09:18,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:09:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:18,046 INFO L225 Difference]: With dead ends: 1140 [2019-10-13 21:09:18,046 INFO L226 Difference]: Without dead ends: 597 [2019-10-13 21:09:18,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-13 21:09:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-10-13 21:09:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:09:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 910 transitions. [2019-10-13 21:09:18,071 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 910 transitions. Word has length 146 [2019-10-13 21:09:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:18,073 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 910 transitions. [2019-10-13 21:09:18,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:09:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 910 transitions. [2019-10-13 21:09:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:09:18,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:18,079 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:18,079 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 94623585, now seen corresponding path program 1 times [2019-10-13 21:09:18,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:18,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484279027] [2019-10-13 21:09:18,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:18,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484279027] [2019-10-13 21:09:18,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616178960] [2019-10-13 21:09:18,267 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:09:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:09:18,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:09:18,924 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:19,064 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:19,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-13 21:09:19,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456813381] [2019-10-13 21:09:19,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:19,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:19,068 INFO L87 Difference]: Start difference. First operand 595 states and 910 transitions. Second operand 3 states. [2019-10-13 21:09:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:19,169 INFO L93 Difference]: Finished difference Result 1674 states and 2637 transitions. [2019-10-13 21:09:19,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:19,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-13 21:09:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:19,178 INFO L225 Difference]: With dead ends: 1674 [2019-10-13 21:09:19,178 INFO L226 Difference]: Without dead ends: 1132 [2019-10-13 21:09:19,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-10-13 21:09:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1124. [2019-10-13 21:09:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-13 21:09:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1755 transitions. [2019-10-13 21:09:19,240 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1755 transitions. Word has length 147 [2019-10-13 21:09:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:19,241 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1755 transitions. [2019-10-13 21:09:19,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1755 transitions. [2019-10-13 21:09:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:09:19,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:19,245 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:19,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:19,458 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash -564907937, now seen corresponding path program 1 times [2019-10-13 21:09:19,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:19,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017205426] [2019-10-13 21:09:19,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:19,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:19,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:19,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017205426] [2019-10-13 21:09:19,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52410145] [2019-10-13 21:09:19,625 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:09:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:20,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:20,271 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:20,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:20,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:20,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466309093] [2019-10-13 21:09:20,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:20,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:20,607 INFO L87 Difference]: Start difference. First operand 1124 states and 1755 transitions. Second operand 5 states. [2019-10-13 21:09:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:21,486 INFO L93 Difference]: Finished difference Result 2211 states and 3542 transitions. [2019-10-13 21:09:21,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:21,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:09:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:21,495 INFO L225 Difference]: With dead ends: 2211 [2019-10-13 21:09:21,495 INFO L226 Difference]: Without dead ends: 1140 [2019-10-13 21:09:21,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-10-13 21:09:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2019-10-13 21:09:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2019-10-13 21:09:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1781 transitions. [2019-10-13 21:09:21,547 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1781 transitions. Word has length 147 [2019-10-13 21:09:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:21,547 INFO L462 AbstractCegarLoop]: Abstraction has 1140 states and 1781 transitions. [2019-10-13 21:09:21,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1781 transitions. [2019-10-13 21:09:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:09:21,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:21,551 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:21,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:21,759 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:21,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1245425385, now seen corresponding path program 1 times [2019-10-13 21:09:21,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:21,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633105957] [2019-10-13 21:09:21,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:21,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633105957] [2019-10-13 21:09:21,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884567759] [2019-10-13 21:09:21,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:22,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:22,690 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:22,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:22,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:22,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678962252] [2019-10-13 21:09:22,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:22,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:22,970 INFO L87 Difference]: Start difference. First operand 1140 states and 1781 transitions. Second operand 5 states. [2019-10-13 21:09:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:23,792 INFO L93 Difference]: Finished difference Result 2243 states and 3588 transitions. [2019-10-13 21:09:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:23,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:09:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:23,801 INFO L225 Difference]: With dead ends: 2243 [2019-10-13 21:09:23,801 INFO L226 Difference]: Without dead ends: 1156 [2019-10-13 21:09:23,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-10-13 21:09:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2019-10-13 21:09:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-10-13 21:09:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1807 transitions. [2019-10-13 21:09:23,853 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1807 transitions. Word has length 150 [2019-10-13 21:09:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,853 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1807 transitions. [2019-10-13 21:09:23,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1807 transitions. [2019-10-13 21:09:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:09:23,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,858 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:24,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:24,075 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1929351523, now seen corresponding path program 1 times [2019-10-13 21:09:24,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302394253] [2019-10-13 21:09:24,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-13 21:09:24,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302394253] [2019-10-13 21:09:24,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083757645] [2019-10-13 21:09:24,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 2637 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:24,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:24,983 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:25,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:25,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:25,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700411772] [2019-10-13 21:09:25,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:25,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:25,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:25,293 INFO L87 Difference]: Start difference. First operand 1156 states and 1807 transitions. Second operand 5 states. [2019-10-13 21:09:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:26,071 INFO L93 Difference]: Finished difference Result 2275 states and 3634 transitions. [2019-10-13 21:09:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:26,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:09:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:26,079 INFO L225 Difference]: With dead ends: 2275 [2019-10-13 21:09:26,080 INFO L226 Difference]: Without dead ends: 1172 [2019-10-13 21:09:26,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-10-13 21:09:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2019-10-13 21:09:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-10-13 21:09:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1833 transitions. [2019-10-13 21:09:26,129 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1833 transitions. Word has length 153 [2019-10-13 21:09:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:26,129 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1833 transitions. [2019-10-13 21:09:26,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1833 transitions. [2019-10-13 21:09:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:09:26,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:26,133 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:26,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:26,341 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash -998466541, now seen corresponding path program 1 times [2019-10-13 21:09:26,342 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:26,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452366071] [2019-10-13 21:09:26,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 21:09:26,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452366071] [2019-10-13 21:09:26,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62035792] [2019-10-13 21:09:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:26,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:27,048 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:27,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:27,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 16 [2019-10-13 21:09:27,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487708367] [2019-10-13 21:09:27,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:27,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:09:27,323 INFO L87 Difference]: Start difference. First operand 1172 states and 1833 transitions. Second operand 5 states. [2019-10-13 21:09:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:28,109 INFO L93 Difference]: Finished difference Result 2307 states and 3680 transitions. [2019-10-13 21:09:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:28,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-13 21:09:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:28,117 INFO L225 Difference]: With dead ends: 2307 [2019-10-13 21:09:28,117 INFO L226 Difference]: Without dead ends: 1188 [2019-10-13 21:09:28,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 312 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-10-13 21:09:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2019-10-13 21:09:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-10-13 21:09:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1859 transitions. [2019-10-13 21:09:28,163 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1859 transitions. Word has length 156 [2019-10-13 21:09:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:28,163 INFO L462 AbstractCegarLoop]: Abstraction has 1188 states and 1859 transitions. [2019-10-13 21:09:28,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1859 transitions. [2019-10-13 21:09:28,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:09:28,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:28,168 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:28,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:28,375 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1826937753, now seen corresponding path program 1 times [2019-10-13 21:09:28,376 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:28,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096730759] [2019-10-13 21:09:28,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:28,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096730759] [2019-10-13 21:09:28,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404765091] [2019-10-13 21:09:28,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:29,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 2643 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:09:29,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:09:29,176 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:29,308 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:29,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-13 21:09:29,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20190490] [2019-10-13 21:09:29,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:29,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:29,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:29,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:29,311 INFO L87 Difference]: Start difference. First operand 1188 states and 1859 transitions. Second operand 6 states. [2019-10-13 21:09:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,939 INFO L93 Difference]: Finished difference Result 2340 states and 3712 transitions. [2019-10-13 21:09:29,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:29,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-13 21:09:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,948 INFO L225 Difference]: With dead ends: 2340 [2019-10-13 21:09:29,948 INFO L226 Difference]: Without dead ends: 1205 [2019-10-13 21:09:29,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-10-13 21:09:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1198. [2019-10-13 21:09:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-10-13 21:09:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1876 transitions. [2019-10-13 21:09:29,995 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1876 transitions. Word has length 159 [2019-10-13 21:09:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,996 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1876 transitions. [2019-10-13 21:09:29,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1876 transitions. [2019-10-13 21:09:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:30,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:30,001 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:30,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:30,210 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1896832043, now seen corresponding path program 1 times [2019-10-13 21:09:30,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:30,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433392636] [2019-10-13 21:09:30,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:30,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433392636] [2019-10-13 21:09:30,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667889514] [2019-10-13 21:09:30,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:09:30,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:09:31,078 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:31,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:31,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-13 21:09:31,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731117042] [2019-10-13 21:09:31,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:31,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:09:31,447 INFO L87 Difference]: Start difference. First operand 1198 states and 1876 transitions. Second operand 9 states. [2019-10-13 21:09:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:37,061 INFO L93 Difference]: Finished difference Result 3657 states and 5841 transitions. [2019-10-13 21:09:37,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:37,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-13 21:09:37,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:37,079 INFO L225 Difference]: With dead ends: 3657 [2019-10-13 21:09:37,079 INFO L226 Difference]: Without dead ends: 2512 [2019-10-13 21:09:37,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:09:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-10-13 21:09:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2481. [2019-10-13 21:09:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-10-13 21:09:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3947 transitions. [2019-10-13 21:09:37,176 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3947 transitions. Word has length 164 [2019-10-13 21:09:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:37,176 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3947 transitions. [2019-10-13 21:09:37,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3947 transitions. [2019-10-13 21:09:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:09:37,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:37,184 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:37,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:37,391 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1312680122, now seen corresponding path program 1 times [2019-10-13 21:09:37,392 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:37,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781853484] [2019-10-13 21:09:37,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:37,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781853484] [2019-10-13 21:09:37,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:37,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:37,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597319747] [2019-10-13 21:09:37,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:37,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:37,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:37,529 INFO L87 Difference]: Start difference. First operand 2481 states and 3947 transitions. Second operand 9 states. [2019-10-13 21:09:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:37,756 INFO L93 Difference]: Finished difference Result 4834 states and 7730 transitions. [2019-10-13 21:09:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:37,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-13 21:09:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:37,772 INFO L225 Difference]: With dead ends: 4834 [2019-10-13 21:09:37,772 INFO L226 Difference]: Without dead ends: 2400 [2019-10-13 21:09:37,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-10-13 21:09:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2396. [2019-10-13 21:09:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2019-10-13 21:09:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3820 transitions. [2019-10-13 21:09:37,933 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3820 transitions. Word has length 167 [2019-10-13 21:09:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:37,933 INFO L462 AbstractCegarLoop]: Abstraction has 2396 states and 3820 transitions. [2019-10-13 21:09:37,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3820 transitions. [2019-10-13 21:09:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:09:37,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:37,938 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:37,938 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash 853816395, now seen corresponding path program 1 times [2019-10-13 21:09:37,939 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:37,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928578107] [2019-10-13 21:09:37,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:38,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928578107] [2019-10-13 21:09:38,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986719874] [2019-10-13 21:09:38,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:38,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 2678 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 21:09:38,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 21:09:38,699 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-13 21:09:38,933 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:38,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 13 [2019-10-13 21:09:38,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163369353] [2019-10-13 21:09:38,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:38,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:38,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:38,936 INFO L87 Difference]: Start difference. First operand 2396 states and 3820 transitions. Second operand 7 states. [2019-10-13 21:09:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:39,052 INFO L93 Difference]: Finished difference Result 4915 states and 7915 transitions. [2019-10-13 21:09:39,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:39,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-13 21:09:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:39,075 INFO L225 Difference]: With dead ends: 4915 [2019-10-13 21:09:39,075 INFO L226 Difference]: Without dead ends: 2572 [2019-10-13 21:09:39,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 341 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-10-13 21:09:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2564. [2019-10-13 21:09:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-10-13 21:09:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 4109 transitions. [2019-10-13 21:09:39,228 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 4109 transitions. Word has length 170 [2019-10-13 21:09:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:39,228 INFO L462 AbstractCegarLoop]: Abstraction has 2564 states and 4109 transitions. [2019-10-13 21:09:39,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 4109 transitions. [2019-10-13 21:09:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-13 21:09:39,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:39,237 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:39,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:39,446 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1438221946, now seen corresponding path program 1 times [2019-10-13 21:09:39,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:39,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382080730] [2019-10-13 21:09:39,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:09:39,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382080730] [2019-10-13 21:09:39,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043848751] [2019-10-13 21:09:39,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:40,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:09:40,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:09:40,341 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:09:40,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:40,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-13 21:09:40,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544043135] [2019-10-13 21:09:40,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:40,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:09:40,721 INFO L87 Difference]: Start difference. First operand 2564 states and 4109 transitions. Second operand 9 states.