java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:25,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:25,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:25,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:25,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:25,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:25,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:25,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:25,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:25,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:25,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:25,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:25,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:25,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:25,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:25,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:25,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:25,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:25,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:25,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:25,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:25,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:25,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:25,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:25,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:25,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:25,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:25,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:25,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:25,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:25,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:25,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:25,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:25,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:25,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:25,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:25,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:25,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:25,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:25,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:25,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:25,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-15 01:09:25,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:25,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:25,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:25,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:25,123 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:25,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:25,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:25,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:25,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:25,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:25,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:25,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:25,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:25,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:25,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:25,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:25,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:25,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:25,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:25,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:25,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:25,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:25,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:25,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:25,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:25,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:25,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:25,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:25,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:09:25,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:25,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:25,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:25,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:25,433 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:25,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-10-15 01:09:25,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed254a9b/6857cdb8fc914af4bbe0b65bb886ac46/FLAGcfbf5ef65 [2019-10-15 01:09:26,151 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:26,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-10-15 01:09:26,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed254a9b/6857cdb8fc914af4bbe0b65bb886ac46/FLAGcfbf5ef65 [2019-10-15 01:09:26,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed254a9b/6857cdb8fc914af4bbe0b65bb886ac46 [2019-10-15 01:09:26,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:26,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:26,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:26,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:26,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:26,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:26" (1/1) ... [2019-10-15 01:09:26,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74752006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:26, skipping insertion in model container [2019-10-15 01:09:26,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:26" (1/1) ... [2019-10-15 01:09:26,393 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:26,471 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:27,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:27,234 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:27,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:27,500 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:27,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27 WrapperNode [2019-10-15 01:09:27,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:27,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:27,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:27,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:27,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... [2019-10-15 01:09:27,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... [2019-10-15 01:09:27,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... [2019-10-15 01:09:27,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... [2019-10-15 01:09:27,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... [2019-10-15 01:09:27,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... [2019-10-15 01:09:27,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... [2019-10-15 01:09:27,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:09:27,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:09:27,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:09:27,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:09:27,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:27,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:09:27,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:09:27,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:27,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:09:27,767 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:09:27,768 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:09:27,768 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:09:27,768 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:09:27,768 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:09:27,769 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:09:27,769 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:09:27,769 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:09:27,769 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:09:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:09:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:09:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:09:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:09:27,770 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:09:27,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:09:27,771 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:09:27,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:09:27,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:09:27,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:09:27,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:09:27,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:27,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:27,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:27,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:09:27,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:09:27,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:09:27,773 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:09:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:09:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:09:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:09:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:09:27,774 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:09:27,775 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:09:27,775 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:09:27,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:09:27,775 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:09:27,775 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:09:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:09:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:09:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:09:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:09:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:09:27,777 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:09:27,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:09:27,777 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:09:27,777 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:09:27,777 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:09:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:09:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:09:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:09:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:09:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:09:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:09:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:09:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:09:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:09:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:09:27,780 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:09:27,781 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:09:27,781 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:09:27,781 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:09:27,781 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:09:27,781 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:09:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:09:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:09:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:09:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:09:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:09:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:09:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:09:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:09:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:09:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:09:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:09:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:09:27,784 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:09:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:09:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:09:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:09:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:09:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:09:27,785 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:09:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:09:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:09:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:09:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:09:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:09:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:09:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:09:27,788 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:09:27,788 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:09:27,788 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:09:27,788 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:09:27,789 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:09:27,789 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:27,789 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:27,789 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:09:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:09:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:09:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:09:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:09:27,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:09:27,791 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:09:27,791 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:09:27,791 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:09:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:09:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:09:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:09:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:09:27,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:09:27,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:09:27,793 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:27,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:09:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:09:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:09:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:09:27,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:09:27,795 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:09:27,795 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:09:27,795 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:09:27,795 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:09:27,795 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:09:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:09:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:09:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:09:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:09:27,796 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:09:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:09:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:09:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:09:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:09:27,797 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:09:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:09:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:09:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:09:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:09:27,798 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:09:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:09:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:09:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:09:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:09:27,799 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:09:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:09:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:09:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:09:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:09:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:09:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:09:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:09:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:09:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:09:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:09:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:09:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:09:30,228 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:09:30,229 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:09:30,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:30 BoogieIcfgContainer [2019-10-15 01:09:30,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:09:30,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:09:30,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:09:30,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:09:30,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:26" (1/3) ... [2019-10-15 01:09:30,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84059c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:30, skipping insertion in model container [2019-10-15 01:09:30,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:27" (2/3) ... [2019-10-15 01:09:30,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84059c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:30, skipping insertion in model container [2019-10-15 01:09:30,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:30" (3/3) ... [2019-10-15 01:09:30,241 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product11.cil.c [2019-10-15 01:09:30,251 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:09:30,262 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:09:30,273 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:09:30,305 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:09:30,305 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:09:30,306 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:09:30,306 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:09:30,306 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:09:30,306 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:09:30,306 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:09:30,306 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:09:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states. [2019-10-15 01:09:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:09:30,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:30,381 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:30,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash -353986784, now seen corresponding path program 1 times [2019-10-15 01:09:30,403 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:30,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337799278] [2019-10-15 01:09:30,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:31,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337799278] [2019-10-15 01:09:31,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:31,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:31,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716960216] [2019-10-15 01:09:31,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:31,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:31,136 INFO L87 Difference]: Start difference. First operand 765 states. Second operand 4 states. [2019-10-15 01:09:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:31,347 INFO L93 Difference]: Finished difference Result 1193 states and 1933 transitions. [2019-10-15 01:09:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:31,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-15 01:09:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:31,382 INFO L225 Difference]: With dead ends: 1193 [2019-10-15 01:09:31,382 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 01:09:31,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 01:09:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-15 01:09:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 01:09:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 968 transitions. [2019-10-15 01:09:31,546 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 968 transitions. Word has length 133 [2019-10-15 01:09:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:31,546 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 968 transitions. [2019-10-15 01:09:31,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 968 transitions. [2019-10-15 01:09:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:09:31,561 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:31,561 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:31,562 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash 253416708, now seen corresponding path program 1 times [2019-10-15 01:09:31,563 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:31,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466153811] [2019-10-15 01:09:31,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:31,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466153811] [2019-10-15 01:09:31,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:31,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:31,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886483043] [2019-10-15 01:09:31,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:31,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:31,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:31,792 INFO L87 Difference]: Start difference. First operand 605 states and 968 transitions. Second operand 4 states. [2019-10-15 01:09:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:31,895 INFO L93 Difference]: Finished difference Result 1173 states and 1894 transitions. [2019-10-15 01:09:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:31,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-15 01:09:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:31,903 INFO L225 Difference]: With dead ends: 1173 [2019-10-15 01:09:31,903 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 01:09:31,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 01:09:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-15 01:09:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 01:09:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 967 transitions. [2019-10-15 01:09:31,971 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 967 transitions. Word has length 136 [2019-10-15 01:09:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:31,972 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 967 transitions. [2019-10-15 01:09:31,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 967 transitions. [2019-10-15 01:09:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:09:31,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:31,978 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:31,978 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -602392881, now seen corresponding path program 1 times [2019-10-15 01:09:31,979 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:31,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631038694] [2019-10-15 01:09:31,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:32,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631038694] [2019-10-15 01:09:32,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:32,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197586989] [2019-10-15 01:09:32,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:32,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:32,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:32,153 INFO L87 Difference]: Start difference. First operand 605 states and 967 transitions. Second operand 4 states. [2019-10-15 01:09:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,230 INFO L93 Difference]: Finished difference Result 1173 states and 1893 transitions. [2019-10-15 01:09:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:32,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 01:09:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,237 INFO L225 Difference]: With dead ends: 1173 [2019-10-15 01:09:32,237 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 01:09:32,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 01:09:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-15 01:09:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 01:09:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 966 transitions. [2019-10-15 01:09:32,290 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 966 transitions. Word has length 137 [2019-10-15 01:09:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,290 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 966 transitions. [2019-10-15 01:09:32,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 966 transitions. [2019-10-15 01:09:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:09:32,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,297 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,297 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1415901664, now seen corresponding path program 1 times [2019-10-15 01:09:32,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988771481] [2019-10-15 01:09:32,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:32,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988771481] [2019-10-15 01:09:32,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:32,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703356952] [2019-10-15 01:09:32,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:32,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:32,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:32,472 INFO L87 Difference]: Start difference. First operand 605 states and 966 transitions. Second operand 4 states. [2019-10-15 01:09:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,598 INFO L93 Difference]: Finished difference Result 1173 states and 1892 transitions. [2019-10-15 01:09:32,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:32,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:09:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,605 INFO L225 Difference]: With dead ends: 1173 [2019-10-15 01:09:32,605 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 01:09:32,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 01:09:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-15 01:09:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 01:09:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 965 transitions. [2019-10-15 01:09:32,634 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 965 transitions. Word has length 138 [2019-10-15 01:09:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,635 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 965 transitions. [2019-10-15 01:09:32,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 965 transitions. [2019-10-15 01:09:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:09:32,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,641 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1957856149, now seen corresponding path program 1 times [2019-10-15 01:09:32,642 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509745917] [2019-10-15 01:09:32,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:32,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509745917] [2019-10-15 01:09:32,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:32,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184301792] [2019-10-15 01:09:32,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:32,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:32,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:32,784 INFO L87 Difference]: Start difference. First operand 605 states and 965 transitions. Second operand 4 states. [2019-10-15 01:09:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,854 INFO L93 Difference]: Finished difference Result 1173 states and 1891 transitions. [2019-10-15 01:09:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:32,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:09:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,860 INFO L225 Difference]: With dead ends: 1173 [2019-10-15 01:09:32,860 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 01:09:32,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 01:09:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-15 01:09:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 01:09:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 964 transitions. [2019-10-15 01:09:32,889 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 964 transitions. Word has length 139 [2019-10-15 01:09:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,890 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 964 transitions. [2019-10-15 01:09:32,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 964 transitions. [2019-10-15 01:09:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:09:32,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,894 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,896 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,897 INFO L82 PathProgramCache]: Analyzing trace with hash -686545220, now seen corresponding path program 1 times [2019-10-15 01:09:32,898 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783257678] [2019-10-15 01:09:32,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:33,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783257678] [2019-10-15 01:09:33,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:09:33,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364871948] [2019-10-15 01:09:33,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:09:33,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:09:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:33,088 INFO L87 Difference]: Start difference. First operand 605 states and 964 transitions. Second operand 10 states. [2019-10-15 01:09:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,365 INFO L93 Difference]: Finished difference Result 1131 states and 1811 transitions. [2019-10-15 01:09:33,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:09:33,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-15 01:09:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,376 INFO L225 Difference]: With dead ends: 1131 [2019-10-15 01:09:33,377 INFO L226 Difference]: Without dead ends: 614 [2019-10-15 01:09:33,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:09:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-15 01:09:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2019-10-15 01:09:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-15 01:09:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 973 transitions. [2019-10-15 01:09:33,423 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 973 transitions. Word has length 140 [2019-10-15 01:09:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,426 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 973 transitions. [2019-10-15 01:09:33,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:09:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 973 transitions. [2019-10-15 01:09:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:09:33,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,430 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:33,431 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 8101787, now seen corresponding path program 1 times [2019-10-15 01:09:33,431 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763597758] [2019-10-15 01:09:33,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:33,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763597758] [2019-10-15 01:09:33,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:33,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433705614] [2019-10-15 01:09:33,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:33,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:33,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:33,541 INFO L87 Difference]: Start difference. First operand 612 states and 973 transitions. Second operand 4 states. [2019-10-15 01:09:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,609 INFO L93 Difference]: Finished difference Result 1179 states and 1897 transitions. [2019-10-15 01:09:33,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:33,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:09:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,615 INFO L225 Difference]: With dead ends: 1179 [2019-10-15 01:09:33,616 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:09:33,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:09:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:09:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:09:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 950 transitions. [2019-10-15 01:09:33,641 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 950 transitions. Word has length 140 [2019-10-15 01:09:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,641 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 950 transitions. [2019-10-15 01:09:33,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 950 transitions. [2019-10-15 01:09:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:09:33,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,646 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:33,646 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 590106207, now seen corresponding path program 1 times [2019-10-15 01:09:33,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029562194] [2019-10-15 01:09:33,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:33,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029562194] [2019-10-15 01:09:33,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:33,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130442811] [2019-10-15 01:09:33,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:33,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:33,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:33,825 INFO L87 Difference]: Start difference. First operand 599 states and 950 transitions. Second operand 6 states. [2019-10-15 01:09:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,074 INFO L93 Difference]: Finished difference Result 1119 states and 1789 transitions. [2019-10-15 01:09:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:34,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:09:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,079 INFO L225 Difference]: With dead ends: 1119 [2019-10-15 01:09:34,080 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:09:34,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:09:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:09:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:09:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 946 transitions. [2019-10-15 01:09:34,107 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 946 transitions. Word has length 141 [2019-10-15 01:09:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,109 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 946 transitions. [2019-10-15 01:09:34,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 946 transitions. [2019-10-15 01:09:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:09:34,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,114 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,114 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash 871479167, now seen corresponding path program 1 times [2019-10-15 01:09:34,118 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114441737] [2019-10-15 01:09:34,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:34,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114441737] [2019-10-15 01:09:34,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:34,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327785310] [2019-10-15 01:09:34,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:34,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:34,343 INFO L87 Difference]: Start difference. First operand 599 states and 946 transitions. Second operand 6 states. [2019-10-15 01:09:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,563 INFO L93 Difference]: Finished difference Result 1119 states and 1785 transitions. [2019-10-15 01:09:34,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:34,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-15 01:09:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,569 INFO L225 Difference]: With dead ends: 1119 [2019-10-15 01:09:34,569 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:09:34,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:09:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:09:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:09:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 942 transitions. [2019-10-15 01:09:34,592 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 942 transitions. Word has length 142 [2019-10-15 01:09:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,592 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 942 transitions. [2019-10-15 01:09:34,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 942 transitions. [2019-10-15 01:09:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:09:34,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,597 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,597 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 711816804, now seen corresponding path program 1 times [2019-10-15 01:09:34,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741666483] [2019-10-15 01:09:34,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:34,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741666483] [2019-10-15 01:09:34,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:34,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245449018] [2019-10-15 01:09:34,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:34,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:34,739 INFO L87 Difference]: Start difference. First operand 599 states and 942 transitions. Second operand 6 states. [2019-10-15 01:09:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,953 INFO L93 Difference]: Finished difference Result 1119 states and 1781 transitions. [2019-10-15 01:09:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:34,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:09:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,958 INFO L225 Difference]: With dead ends: 1119 [2019-10-15 01:09:34,959 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:09:34,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:09:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:09:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:09:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 938 transitions. [2019-10-15 01:09:34,982 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 938 transitions. Word has length 143 [2019-10-15 01:09:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,982 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 938 transitions. [2019-10-15 01:09:34,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 938 transitions. [2019-10-15 01:09:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:09:34,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,987 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,987 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1766290148, now seen corresponding path program 1 times [2019-10-15 01:09:34,988 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141496536] [2019-10-15 01:09:34,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:35,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141496536] [2019-10-15 01:09:35,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:35,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392088703] [2019-10-15 01:09:35,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:35,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:35,175 INFO L87 Difference]: Start difference. First operand 599 states and 938 transitions. Second operand 7 states. [2019-10-15 01:09:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,264 INFO L93 Difference]: Finished difference Result 1119 states and 1777 transitions. [2019-10-15 01:09:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:35,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:09:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,270 INFO L225 Difference]: With dead ends: 1119 [2019-10-15 01:09:35,270 INFO L226 Difference]: Without dead ends: 578 [2019-10-15 01:09:35,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-15 01:09:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-15 01:09:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-15 01:09:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 904 transitions. [2019-10-15 01:09:35,291 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 904 transitions. Word has length 143 [2019-10-15 01:09:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,291 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 904 transitions. [2019-10-15 01:09:35,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 904 transitions. [2019-10-15 01:09:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:09:35,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,296 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,296 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash -235038684, now seen corresponding path program 1 times [2019-10-15 01:09:35,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273749481] [2019-10-15 01:09:35,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:35,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273749481] [2019-10-15 01:09:35,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:35,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920133032] [2019-10-15 01:09:35,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:35,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:35,416 INFO L87 Difference]: Start difference. First operand 578 states and 904 transitions. Second operand 6 states. [2019-10-15 01:09:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,522 INFO L93 Difference]: Finished difference Result 1098 states and 1743 transitions. [2019-10-15 01:09:35,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:35,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:09:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,528 INFO L225 Difference]: With dead ends: 1098 [2019-10-15 01:09:35,528 INFO L226 Difference]: Without dead ends: 578 [2019-10-15 01:09:35,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-15 01:09:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-15 01:09:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-15 01:09:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 903 transitions. [2019-10-15 01:09:35,550 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 903 transitions. Word has length 144 [2019-10-15 01:09:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,551 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 903 transitions. [2019-10-15 01:09:35,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 903 transitions. [2019-10-15 01:09:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:09:35,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,555 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,555 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash 184922729, now seen corresponding path program 1 times [2019-10-15 01:09:35,556 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115700670] [2019-10-15 01:09:35,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:35,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115700670] [2019-10-15 01:09:35,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:35,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089022575] [2019-10-15 01:09:35,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:35,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:35,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:35,688 INFO L87 Difference]: Start difference. First operand 578 states and 903 transitions. Second operand 6 states. [2019-10-15 01:09:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,795 INFO L93 Difference]: Finished difference Result 1098 states and 1742 transitions. [2019-10-15 01:09:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:35,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:09:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,801 INFO L225 Difference]: With dead ends: 1098 [2019-10-15 01:09:35,801 INFO L226 Difference]: Without dead ends: 578 [2019-10-15 01:09:35,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-15 01:09:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-15 01:09:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-15 01:09:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 902 transitions. [2019-10-15 01:09:35,823 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 902 transitions. Word has length 145 [2019-10-15 01:09:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,824 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 902 transitions. [2019-10-15 01:09:35,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 902 transitions. [2019-10-15 01:09:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:09:35,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,829 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,829 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash 26535113, now seen corresponding path program 1 times [2019-10-15 01:09:35,830 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700113756] [2019-10-15 01:09:35,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:09:36,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700113756] [2019-10-15 01:09:36,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:36,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023797225] [2019-10-15 01:09:36,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:36,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:36,100 INFO L87 Difference]: Start difference. First operand 578 states and 902 transitions. Second operand 12 states. [2019-10-15 01:09:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,359 INFO L93 Difference]: Finished difference Result 1099 states and 1741 transitions. [2019-10-15 01:09:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:09:36,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-15 01:09:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,367 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:09:36,367 INFO L226 Difference]: Without dead ends: 578 [2019-10-15 01:09:36,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-15 01:09:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-15 01:09:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-15 01:09:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 901 transitions. [2019-10-15 01:09:36,394 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 901 transitions. Word has length 146 [2019-10-15 01:09:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,395 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 901 transitions. [2019-10-15 01:09:36,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 901 transitions. [2019-10-15 01:09:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:09:36,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,401 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:36,401 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1759527944, now seen corresponding path program 1 times [2019-10-15 01:09:36,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069487329] [2019-10-15 01:09:36,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:36,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069487329] [2019-10-15 01:09:36,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188879670] [2019-10-15 01:09:36,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:37,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:37,184 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:38,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:09:38,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:09:38,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861421226] [2019-10-15 01:09:38,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:38,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:09:38,032 INFO L87 Difference]: Start difference. First operand 578 states and 901 transitions. Second operand 5 states. [2019-10-15 01:09:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:38,901 INFO L93 Difference]: Finished difference Result 1098 states and 1766 transitions. [2019-10-15 01:09:38,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:38,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:09:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:38,909 INFO L225 Difference]: With dead ends: 1098 [2019-10-15 01:09:38,909 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 01:09:38,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 01:09:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-15 01:09:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-15 01:09:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 914 transitions. [2019-10-15 01:09:38,939 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 914 transitions. Word has length 147 [2019-10-15 01:09:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:38,939 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 914 transitions. [2019-10-15 01:09:38,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 914 transitions. [2019-10-15 01:09:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:09:38,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,944 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:39,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:39,160 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1319088752, now seen corresponding path program 1 times [2019-10-15 01:09:39,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:39,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654482381] [2019-10-15 01:09:39,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:39,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:39,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654482381] [2019-10-15 01:09:39,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156103117] [2019-10-15 01:09:39,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:40,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:40,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:40,134 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:41,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:09:41,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:09:41,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820008592] [2019-10-15 01:09:41,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:41,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:41,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:41,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:09:41,049 INFO L87 Difference]: Start difference. First operand 586 states and 914 transitions. Second operand 5 states. [2019-10-15 01:09:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:41,911 INFO L93 Difference]: Finished difference Result 1114 states and 1789 transitions. [2019-10-15 01:09:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:41,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-15 01:09:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:41,916 INFO L225 Difference]: With dead ends: 1114 [2019-10-15 01:09:41,916 INFO L226 Difference]: Without dead ends: 594 [2019-10-15 01:09:41,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 285 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-15 01:09:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-10-15 01:09:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-15 01:09:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 927 transitions. [2019-10-15 01:09:41,942 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 927 transitions. Word has length 149 [2019-10-15 01:09:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:41,942 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 927 transitions. [2019-10-15 01:09:41,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 927 transitions. [2019-10-15 01:09:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:09:41,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:41,948 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:42,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:42,157 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1445266504, now seen corresponding path program 1 times [2019-10-15 01:09:42,157 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:42,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133072811] [2019-10-15 01:09:42,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:42,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:42,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133072811] [2019-10-15 01:09:42,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972612670] [2019-10-15 01:09:42,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:42,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:42,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:42,990 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:43,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:09:43,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:09:43,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361745047] [2019-10-15 01:09:43,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:43,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:09:43,864 INFO L87 Difference]: Start difference. First operand 594 states and 927 transitions. Second operand 5 states. [2019-10-15 01:09:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:44,845 INFO L93 Difference]: Finished difference Result 1130 states and 1812 transitions. [2019-10-15 01:09:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:44,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-15 01:09:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:44,850 INFO L225 Difference]: With dead ends: 1130 [2019-10-15 01:09:44,850 INFO L226 Difference]: Without dead ends: 602 [2019-10-15 01:09:44,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 289 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-15 01:09:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-15 01:09:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-15 01:09:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 940 transitions. [2019-10-15 01:09:44,871 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 940 transitions. Word has length 151 [2019-10-15 01:09:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:44,871 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 940 transitions. [2019-10-15 01:09:44,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 940 transitions. [2019-10-15 01:09:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:09:44,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:44,875 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:45,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:45,082 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash 617582120, now seen corresponding path program 1 times [2019-10-15 01:09:45,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:45,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250444630] [2019-10-15 01:09:45,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:45,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:45,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:45,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250444630] [2019-10-15 01:09:45,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917554179] [2019-10-15 01:09:45,243 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-15 01:09:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:45,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:45,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:45,986 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:09:46,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:09:46,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2019-10-15 01:09:46,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101166037] [2019-10-15 01:09:46,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:46,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:46,638 INFO L87 Difference]: Start difference. First operand 602 states and 940 transitions. Second operand 5 states. [2019-10-15 01:09:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:47,438 INFO L93 Difference]: Finished difference Result 1146 states and 1835 transitions. [2019-10-15 01:09:47,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:47,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:09:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:47,444 INFO L225 Difference]: With dead ends: 1146 [2019-10-15 01:09:47,444 INFO L226 Difference]: Without dead ends: 610 [2019-10-15 01:09:47,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:09:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-15 01:09:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-15 01:09:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 01:09:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 953 transitions. [2019-10-15 01:09:47,466 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 953 transitions. Word has length 153 [2019-10-15 01:09:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:47,467 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 953 transitions. [2019-10-15 01:09:47,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 953 transitions. [2019-10-15 01:09:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:09:47,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:47,471 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:47,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:47,686 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash 522371720, now seen corresponding path program 1 times [2019-10-15 01:09:47,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:47,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172610641] [2019-10-15 01:09:47,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:47,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:47,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:09:47,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172610641] [2019-10-15 01:09:47,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895405009] [2019-10-15 01:09:47,860 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-15 01:09:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:48,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:09:48,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:48,705 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:48,997 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:09:48,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-15 01:09:48,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823305484] [2019-10-15 01:09:48,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:48,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:48,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:09:49,003 INFO L87 Difference]: Start difference. First operand 610 states and 953 transitions. Second operand 9 states. [2019-10-15 01:09:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:50,400 INFO L93 Difference]: Finished difference Result 655 states and 1013 transitions. [2019-10-15 01:09:50,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:50,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-15 01:09:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:50,405 INFO L225 Difference]: With dead ends: 655 [2019-10-15 01:09:50,405 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:09:50,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:09:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:09:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 624. [2019-10-15 01:09:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-15 01:09:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 972 transitions. [2019-10-15 01:09:50,428 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 972 transitions. Word has length 155 [2019-10-15 01:09:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:50,429 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 972 transitions. [2019-10-15 01:09:50,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 972 transitions. [2019-10-15 01:09:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:09:50,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:50,433 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:50,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:50,648 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1028213635, now seen corresponding path program 1 times [2019-10-15 01:09:50,648 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:50,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002204237] [2019-10-15 01:09:50,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:50,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:50,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:09:50,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002204237] [2019-10-15 01:09:50,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008733912] [2019-10-15 01:09:50,827 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-15 01:09:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:51,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 2763 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:09:51,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:51,490 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:09:51,774 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:09:51,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-15 01:09:51,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785753212] [2019-10-15 01:09:51,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:51,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:51,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:51,776 INFO L87 Difference]: Start difference. First operand 624 states and 972 transitions. Second operand 5 states. [2019-10-15 01:09:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:51,820 INFO L93 Difference]: Finished difference Result 641 states and 992 transitions. [2019-10-15 01:09:51,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:51,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-15 01:09:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:51,825 INFO L225 Difference]: With dead ends: 641 [2019-10-15 01:09:51,825 INFO L226 Difference]: Without dead ends: 624 [2019-10-15 01:09:51,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:09:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-15 01:09:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-10-15 01:09:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-15 01:09:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 970 transitions. [2019-10-15 01:09:51,848 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 970 transitions. Word has length 161 [2019-10-15 01:09:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:51,849 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 970 transitions. [2019-10-15 01:09:51,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 970 transitions. [2019-10-15 01:09:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-15 01:09:51,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:51,854 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:52,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:52,073 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1459009375, now seen corresponding path program 1 times [2019-10-15 01:09:52,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:52,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297432249] [2019-10-15 01:09:52,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:52,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:52,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:09:52,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297432249] [2019-10-15 01:09:52,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616699817] [2019-10-15 01:09:52,285 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-15 01:09:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:52,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 2813 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:09:52,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:09:53,020 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:09:53,463 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:09:53,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-15 01:09:53,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90631951] [2019-10-15 01:09:53,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:53,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:53,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:09:53,464 INFO L87 Difference]: Start difference. First operand 624 states and 970 transitions. Second operand 9 states. [2019-10-15 01:09:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:58,257 INFO L93 Difference]: Finished difference Result 1825 states and 2920 transitions. [2019-10-15 01:09:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:09:58,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-15 01:09:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:58,267 INFO L225 Difference]: With dead ends: 1825 [2019-10-15 01:09:58,267 INFO L226 Difference]: Without dead ends: 1267 [2019-10-15 01:09:58,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:09:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-10-15 01:09:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1224. [2019-10-15 01:09:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-10-15 01:09:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1947 transitions. [2019-10-15 01:09:58,341 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1947 transitions. Word has length 179 [2019-10-15 01:09:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:58,342 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1947 transitions. [2019-10-15 01:09:58,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1947 transitions. [2019-10-15 01:09:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-15 01:09:58,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:58,346 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:58,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:09:58,560 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash -871878432, now seen corresponding path program 1 times [2019-10-15 01:09:58,561 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:58,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047930043] [2019-10-15 01:09:58,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:58,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:58,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:09:58,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047930043] [2019-10-15 01:09:58,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164380805] [2019-10-15 01:09:58,744 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-15 01:09:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:59,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 2830 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:09:59,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:09:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:09:59,454 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:09:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:09:59,685 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:09:59,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:09:59,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887269691] [2019-10-15 01:09:59,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:09:59,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:09:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:59,687 INFO L87 Difference]: Start difference. First operand 1224 states and 1947 transitions. Second operand 3 states. [2019-10-15 01:09:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:59,848 INFO L93 Difference]: Finished difference Result 2923 states and 4725 transitions. [2019-10-15 01:09:59,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:09:59,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-15 01:09:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:59,864 INFO L225 Difference]: With dead ends: 2923 [2019-10-15 01:09:59,864 INFO L226 Difference]: Without dead ends: 1776 [2019-10-15 01:09:59,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2019-10-15 01:09:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1222. [2019-10-15 01:09:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-10-15 01:09:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1939 transitions. [2019-10-15 01:09:59,955 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1939 transitions. Word has length 184 [2019-10-15 01:09:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:59,956 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1939 transitions. [2019-10-15 01:09:59,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:09:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1939 transitions. [2019-10-15 01:09:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-15 01:09:59,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:59,960 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:00,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:00,175 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash 514906978, now seen corresponding path program 1 times [2019-10-15 01:10:00,175 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:00,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377620859] [2019-10-15 01:10:00,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:00,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:00,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:10:00,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377620859] [2019-10-15 01:10:00,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143827527] [2019-10-15 01:10:00,362 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