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_spec9_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:11:15,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:11:15,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:11:15,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:11:15,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:11:15,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:11:15,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:11:15,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:11:15,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:11:15,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:11:15,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:11:15,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:11:15,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:11:15,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:11:15,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:11:15,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:11:15,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:11:15,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:11:15,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:11:15,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:11:15,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:11:15,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:11:15,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:11:15,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:11:15,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:11:15,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:11:15,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:11:15,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:11:15,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:11:15,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:11:15,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:11:15,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:11:15,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:11:15,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:11:15,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:11:15,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:11:15,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:11:15,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:11:15,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:11:15,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:11:15,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:11:15,501 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:11:15,521 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:11:15,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:11:15,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:11:15,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:11:15,524 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:11:15,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:11:15,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:11:15,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:11:15,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:11:15,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:11:15,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:11:15,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:11:15,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:11:15,528 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:11:15,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:11:15,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:11:15,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:11:15,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:11:15,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:11:15,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:11:15,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:11:15,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:15,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:11:15,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:11:15,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:11:15,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:11:15,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:11:15,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:11:15,531 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:11:15,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:11:15,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:11:15,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:11:15,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:11:15,875 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:11:15,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-10-15 01:11:15,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf98012f/f1ee68b30cec4c8fa9ea14ea222f9fe3/FLAGc46b0c77b [2019-10-15 01:11:16,645 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:11:16,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-10-15 01:11:16,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf98012f/f1ee68b30cec4c8fa9ea14ea222f9fe3/FLAGc46b0c77b [2019-10-15 01:11:16,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cf98012f/f1ee68b30cec4c8fa9ea14ea222f9fe3 [2019-10-15 01:11:16,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:11:16,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:11:16,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:16,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:11:16,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:11:16,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:16" (1/1) ... [2019-10-15 01:11:16,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8f6405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:16, skipping insertion in model container [2019-10-15 01:11:16,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:16" (1/1) ... [2019-10-15 01:11:16,836 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:11:16,934 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:11:17,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:17,716 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:11:17,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:17,962 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:11:17,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17 WrapperNode [2019-10-15 01:11:17,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:17,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:11:17,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:11:17,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:11:17,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (1/1) ... [2019-10-15 01:11:17,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (1/1) ... [2019-10-15 01:11:18,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (1/1) ... [2019-10-15 01:11:18,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (1/1) ... [2019-10-15 01:11:18,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (1/1) ... [2019-10-15 01:11:18,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (1/1) ... [2019-10-15 01:11:18,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (1/1) ... [2019-10-15 01:11:18,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:11:18,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:11:18,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:11:18,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:11:18,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (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:11:18,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:11:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:11:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:11:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:11:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:11:18,293 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:11:18,293 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:11:18,293 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:11:18,294 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:11:18,295 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:11:18,295 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:11:18,295 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:11:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:11:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:11:18,298 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:11:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:11:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:11:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:11:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:11:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:11:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:11:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:11:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:11:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:11:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:11:18,301 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:11:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:11:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:11:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:11:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:11:18,302 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:11:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:11:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:11:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:11:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:11:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:11:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:11:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:11:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:11:18,305 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:11:18,305 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:18,305 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:11:18,305 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:11:18,305 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:11:18,305 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:11:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:11:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:11:18,306 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:11:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:11:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:11:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:11:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:11:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:11:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:11:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:11:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:11:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:11:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:11:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:11:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:11:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:11:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:11:18,311 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:11:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:11:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:11:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:11:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:11:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:11:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:11:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:11:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:11:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:11:18,315 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:11:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:11:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:11:18,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:11:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:11:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:11:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:18,318 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:18,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:11:18,319 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:11:18,319 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:11:18,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:11:18,319 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:11:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:11:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:11:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:11:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:11:18,320 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:11:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:11:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:11:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:11:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:11:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:11:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:11:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:11:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:11:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:11:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:11:18,322 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:11:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:11:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:11:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:11:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:11:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:11:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:11:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:11:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:11:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:11:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:11:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:11:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:11:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:11:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:11:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:11:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:11:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:11:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:11:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:11:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:11:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:11:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:11:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:11:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:11:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:11:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:11:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:11:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:11:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:11:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:11:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:11:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:11:18,331 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:11:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:11:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:11:18,332 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:11:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:18,334 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:11:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:11:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:11:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:11:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:11:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:11:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:11:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:11:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:11:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:11:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:11:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:11:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:11:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:11:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:11:20,596 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:11:20,599 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:11:20,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:20 BoogieIcfgContainer [2019-10-15 01:11:20,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:11:20,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:11:20,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:11:20,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:11:20,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:11:16" (1/3) ... [2019-10-15 01:11:20,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2509766b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:20, skipping insertion in model container [2019-10-15 01:11:20,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:17" (2/3) ... [2019-10-15 01:11:20,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2509766b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:20, skipping insertion in model container [2019-10-15 01:11:20,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:20" (3/3) ... [2019-10-15 01:11:20,611 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product27.cil.c [2019-10-15 01:11:20,622 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:11:20,635 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:11:20,647 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:11:20,694 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:11:20,694 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:11:20,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:11:20,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:11:20,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:11:20,695 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:11:20,695 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:11:20,695 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:11:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states. [2019-10-15 01:11:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:11:20,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:20,784 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] [2019-10-15 01:11:20,788 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 18579608, now seen corresponding path program 1 times [2019-10-15 01:11:20,806 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:20,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843511612] [2019-10-15 01:11:20,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:21,530 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:11:21,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843511612] [2019-10-15 01:11:21,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:21,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:21,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139983512] [2019-10-15 01:11:21,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:21,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:21,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:21,558 INFO L87 Difference]: Start difference. First operand 777 states. Second operand 4 states. [2019-10-15 01:11:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:21,780 INFO L93 Difference]: Finished difference Result 1217 states and 1959 transitions. [2019-10-15 01:11:21,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:21,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:11:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:21,814 INFO L225 Difference]: With dead ends: 1217 [2019-10-15 01:11:21,814 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 01:11:21,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 01:11:21,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-15 01:11:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-15 01:11:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 981 transitions. [2019-10-15 01:11:21,931 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 981 transitions. Word has length 135 [2019-10-15 01:11:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:21,931 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 981 transitions. [2019-10-15 01:11:21,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 981 transitions. [2019-10-15 01:11:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:11:21,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:21,939 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:11:21,939 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash -270965621, now seen corresponding path program 1 times [2019-10-15 01:11:21,940 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:21,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007533554] [2019-10-15 01:11:21,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:21,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,242 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:11:22,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007533554] [2019-10-15 01:11:22,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:22,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615274155] [2019-10-15 01:11:22,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:22,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:22,263 INFO L87 Difference]: Start difference. First operand 617 states and 981 transitions. Second operand 4 states. [2019-10-15 01:11:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,365 INFO L93 Difference]: Finished difference Result 1197 states and 1920 transitions. [2019-10-15 01:11:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:22,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:11:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,376 INFO L225 Difference]: With dead ends: 1197 [2019-10-15 01:11:22,379 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 01:11:22,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 01:11:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-15 01:11:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-15 01:11:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 980 transitions. [2019-10-15 01:11:22,458 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 980 transitions. Word has length 138 [2019-10-15 01:11:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,467 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 980 transitions. [2019-10-15 01:11:22,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 980 transitions. [2019-10-15 01:11:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:11:22,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,477 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:11:22,478 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 932085763, now seen corresponding path program 1 times [2019-10-15 01:11:22,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169811333] [2019-10-15 01:11:22,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:22,777 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:11:22,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169811333] [2019-10-15 01:11:22,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:22,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:22,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071354779] [2019-10-15 01:11:22,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:22,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:22,781 INFO L87 Difference]: Start difference. First operand 617 states and 980 transitions. Second operand 4 states. [2019-10-15 01:11:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:22,863 INFO L93 Difference]: Finished difference Result 1197 states and 1919 transitions. [2019-10-15 01:11:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:22,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:11:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:22,870 INFO L225 Difference]: With dead ends: 1197 [2019-10-15 01:11:22,870 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 01:11:22,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 01:11:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-15 01:11:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-15 01:11:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 979 transitions. [2019-10-15 01:11:22,917 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 979 transitions. Word has length 139 [2019-10-15 01:11:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:22,919 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 979 transitions. [2019-10-15 01:11:22,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 979 transitions. [2019-10-15 01:11:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:11:22,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:22,929 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:11:22,930 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:22,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1674590201, now seen corresponding path program 1 times [2019-10-15 01:11:22,931 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:22,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79850027] [2019-10-15 01:11:22,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:22,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,143 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:11:23,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79850027] [2019-10-15 01:11:23,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:23,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:23,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398924692] [2019-10-15 01:11:23,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:23,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:23,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:23,147 INFO L87 Difference]: Start difference. First operand 617 states and 979 transitions. Second operand 4 states. [2019-10-15 01:11:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:23,263 INFO L93 Difference]: Finished difference Result 1197 states and 1918 transitions. [2019-10-15 01:11:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:23,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:11:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:23,270 INFO L225 Difference]: With dead ends: 1197 [2019-10-15 01:11:23,270 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 01:11:23,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 01:11:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-15 01:11:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-15 01:11:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 978 transitions. [2019-10-15 01:11:23,317 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 978 transitions. Word has length 140 [2019-10-15 01:11:23,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:23,318 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 978 transitions. [2019-10-15 01:11:23,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 978 transitions. [2019-10-15 01:11:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:11:23,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,327 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:11:23,328 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2123729665, now seen corresponding path program 1 times [2019-10-15 01:11:23,328 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518239568] [2019-10-15 01:11:23,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,329 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:23,540 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:11:23,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518239568] [2019-10-15 01:11:23,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:23,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:23,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005704281] [2019-10-15 01:11:23,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:23,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:23,544 INFO L87 Difference]: Start difference. First operand 617 states and 978 transitions. Second operand 4 states. [2019-10-15 01:11:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:23,625 INFO L93 Difference]: Finished difference Result 1197 states and 1917 transitions. [2019-10-15 01:11:23,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:23,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-15 01:11:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:23,639 INFO L225 Difference]: With dead ends: 1197 [2019-10-15 01:11:23,641 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 01:11:23,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 01:11:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-15 01:11:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-15 01:11:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 977 transitions. [2019-10-15 01:11:23,777 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 977 transitions. Word has length 141 [2019-10-15 01:11:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:23,778 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 977 transitions. [2019-10-15 01:11:23,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 977 transitions. [2019-10-15 01:11:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:11:23,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,786 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:11:23,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash -113747069, now seen corresponding path program 1 times [2019-10-15 01:11:23,787 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831194281] [2019-10-15 01:11:23,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,003 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:11:24,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831194281] [2019-10-15 01:11:24,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:24,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:11:24,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929073511] [2019-10-15 01:11:24,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:11:24,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:11:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:11:24,007 INFO L87 Difference]: Start difference. First operand 617 states and 977 transitions. Second operand 10 states. [2019-10-15 01:11:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:24,216 INFO L93 Difference]: Finished difference Result 1155 states and 1837 transitions. [2019-10-15 01:11:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:24,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-10-15 01:11:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,227 INFO L225 Difference]: With dead ends: 1155 [2019-10-15 01:11:24,227 INFO L226 Difference]: Without dead ends: 626 [2019-10-15 01:11:24,232 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:11:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-15 01:11:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-15 01:11:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-15 01:11:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 986 transitions. [2019-10-15 01:11:24,266 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 986 transitions. Word has length 142 [2019-10-15 01:11:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:24,269 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 986 transitions. [2019-10-15 01:11:24,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:11:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 986 transitions. [2019-10-15 01:11:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:11:24,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:24,277 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:11:24,277 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1722095778, now seen corresponding path program 1 times [2019-10-15 01:11:24,278 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:24,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386113589] [2019-10-15 01:11:24,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,409 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:11:24,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386113589] [2019-10-15 01:11:24,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:24,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:24,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067646184] [2019-10-15 01:11:24,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:24,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:24,411 INFO L87 Difference]: Start difference. First operand 624 states and 986 transitions. Second operand 4 states. [2019-10-15 01:11:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:24,479 INFO L93 Difference]: Finished difference Result 1203 states and 1923 transitions. [2019-10-15 01:11:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:24,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-15 01:11:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,485 INFO L225 Difference]: With dead ends: 1203 [2019-10-15 01:11:24,486 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:11:24,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:11:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:11:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:11:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 963 transitions. [2019-10-15 01:11:24,517 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 963 transitions. Word has length 142 [2019-10-15 01:11:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:24,518 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 963 transitions. [2019-10-15 01:11:24,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 963 transitions. [2019-10-15 01:11:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:11:24,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:24,525 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:11:24,525 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:24,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1252309947, now seen corresponding path program 1 times [2019-10-15 01:11:24,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:24,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743189281] [2019-10-15 01:11:24,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,737 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:11:24,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743189281] [2019-10-15 01:11:24,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:24,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:24,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021059350] [2019-10-15 01:11:24,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:24,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:24,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:24,739 INFO L87 Difference]: Start difference. First operand 611 states and 963 transitions. Second operand 6 states. [2019-10-15 01:11:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:24,976 INFO L93 Difference]: Finished difference Result 1143 states and 1815 transitions. [2019-10-15 01:11:24,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:24,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:11:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,981 INFO L225 Difference]: With dead ends: 1143 [2019-10-15 01:11:24,981 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:11:24,986 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:11:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:11:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:11:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:11:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 959 transitions. [2019-10-15 01:11:25,016 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 959 transitions. Word has length 143 [2019-10-15 01:11:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:25,022 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 959 transitions. [2019-10-15 01:11:25,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 959 transitions. [2019-10-15 01:11:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:11:25,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:25,028 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:11:25,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash -320376282, now seen corresponding path program 1 times [2019-10-15 01:11:25,029 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:25,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329160722] [2019-10-15 01:11:25,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:25,192 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:11:25,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329160722] [2019-10-15 01:11:25,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:25,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:25,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348491338] [2019-10-15 01:11:25,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:25,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:25,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:25,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:25,196 INFO L87 Difference]: Start difference. First operand 611 states and 959 transitions. Second operand 6 states. [2019-10-15 01:11:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:25,418 INFO L93 Difference]: Finished difference Result 1143 states and 1811 transitions. [2019-10-15 01:11:25,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:25,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:11:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:25,424 INFO L225 Difference]: With dead ends: 1143 [2019-10-15 01:11:25,424 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:11:25,428 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:11:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:11:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:11:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:11:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 955 transitions. [2019-10-15 01:11:25,453 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 955 transitions. Word has length 144 [2019-10-15 01:11:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:25,454 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 955 transitions. [2019-10-15 01:11:25,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 955 transitions. [2019-10-15 01:11:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:11:25,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:25,459 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:11:25,459 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 748593120, now seen corresponding path program 1 times [2019-10-15 01:11:25,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:25,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740364090] [2019-10-15 01:11:25,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:25,613 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:11:25,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740364090] [2019-10-15 01:11:25,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:25,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:25,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030155451] [2019-10-15 01:11:25,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:25,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:25,617 INFO L87 Difference]: Start difference. First operand 611 states and 955 transitions. Second operand 6 states. [2019-10-15 01:11:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:25,847 INFO L93 Difference]: Finished difference Result 1143 states and 1807 transitions. [2019-10-15 01:11:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:25,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:11:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:25,853 INFO L225 Difference]: With dead ends: 1143 [2019-10-15 01:11:25,853 INFO L226 Difference]: Without dead ends: 611 [2019-10-15 01:11:25,863 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:11:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-15 01:11:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-15 01:11:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-15 01:11:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-10-15 01:11:25,889 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 145 [2019-10-15 01:11:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:25,889 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-10-15 01:11:25,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-10-15 01:11:25,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:11:25,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:25,896 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:11:25,897 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:25,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:25,897 INFO L82 PathProgramCache]: Analyzing trace with hash 485194848, now seen corresponding path program 1 times [2019-10-15 01:11:25,898 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:25,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800492436] [2019-10-15 01:11:25,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,060 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:11:26,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800492436] [2019-10-15 01:11:26,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:26,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:26,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004578929] [2019-10-15 01:11:26,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:26,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:26,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:26,065 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 7 states. [2019-10-15 01:11:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:26,160 INFO L93 Difference]: Finished difference Result 1143 states and 1803 transitions. [2019-10-15 01:11:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:26,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-15 01:11:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,167 INFO L225 Difference]: With dead ends: 1143 [2019-10-15 01:11:26,167 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:11:26,171 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:11:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:11:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:11:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:11:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 917 transitions. [2019-10-15 01:11:26,194 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 917 transitions. Word has length 145 [2019-10-15 01:11:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,194 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 917 transitions. [2019-10-15 01:11:26,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 917 transitions. [2019-10-15 01:11:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:11:26,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,203 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:11:26,204 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2104508459, now seen corresponding path program 1 times [2019-10-15 01:11:26,204 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070492403] [2019-10-15 01:11:26,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,350 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:11:26,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070492403] [2019-10-15 01:11:26,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:26,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:26,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497665891] [2019-10-15 01:11:26,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:26,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:26,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:26,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:26,352 INFO L87 Difference]: Start difference. First operand 590 states and 917 transitions. Second operand 6 states. [2019-10-15 01:11:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:26,462 INFO L93 Difference]: Finished difference Result 1122 states and 1769 transitions. [2019-10-15 01:11:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:26,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-15 01:11:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,467 INFO L225 Difference]: With dead ends: 1122 [2019-10-15 01:11:26,468 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:11:26,471 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:11:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:11:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:11:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:11:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 916 transitions. [2019-10-15 01:11:26,497 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 916 transitions. Word has length 146 [2019-10-15 01:11:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,498 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 916 transitions. [2019-10-15 01:11:26,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 916 transitions. [2019-10-15 01:11:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:11:26,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,504 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:11:26,505 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash -529154043, now seen corresponding path program 1 times [2019-10-15 01:11:26,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102816092] [2019-10-15 01:11:26,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,697 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:11:26,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102816092] [2019-10-15 01:11:26,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:26,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:26,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17257661] [2019-10-15 01:11:26,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:26,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:26,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:26,701 INFO L87 Difference]: Start difference. First operand 590 states and 916 transitions. Second operand 6 states. [2019-10-15 01:11:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:26,807 INFO L93 Difference]: Finished difference Result 1122 states and 1768 transitions. [2019-10-15 01:11:26,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:26,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-15 01:11:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,814 INFO L225 Difference]: With dead ends: 1122 [2019-10-15 01:11:26,814 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:11:26,817 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:11:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:11:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:11:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:11:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 915 transitions. [2019-10-15 01:11:26,844 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 915 transitions. Word has length 147 [2019-10-15 01:11:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,844 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 915 transitions. [2019-10-15 01:11:26,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 915 transitions. [2019-10-15 01:11:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:11:26,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,850 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, 1] [2019-10-15 01:11:26,850 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2009289264, now seen corresponding path program 1 times [2019-10-15 01:11:26,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66300173] [2019-10-15 01:11:26,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:27,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:11:27,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66300173] [2019-10-15 01:11:27,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:27,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:11:27,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703312095] [2019-10-15 01:11:27,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:11:27,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:11:27,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:27,088 INFO L87 Difference]: Start difference. First operand 590 states and 915 transitions. Second operand 12 states. [2019-10-15 01:11:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:27,271 INFO L93 Difference]: Finished difference Result 1123 states and 1767 transitions. [2019-10-15 01:11:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:11:27,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-10-15 01:11:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:27,279 INFO L225 Difference]: With dead ends: 1123 [2019-10-15 01:11:27,279 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:11:27,284 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:11:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:11:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:11:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:11:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 914 transitions. [2019-10-15 01:11:27,309 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 914 transitions. Word has length 148 [2019-10-15 01:11:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:27,309 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 914 transitions. [2019-10-15 01:11:27,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:11:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 914 transitions. [2019-10-15 01:11:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:11:27,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:27,314 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, 1, 1] [2019-10-15 01:11:27,314 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:27,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash -650692984, now seen corresponding path program 1 times [2019-10-15 01:11:27,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:27,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161999522] [2019-10-15 01:11:27,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:27,459 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:11:27,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161999522] [2019-10-15 01:11:27,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507467188] [2019-10-15 01:11:27,460 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:11:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:28,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:28,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:28,159 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:11:28,159 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:28,644 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:11:28,645 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:28,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:28,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763918066] [2019-10-15 01:11:28,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:28,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:28,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:28,647 INFO L87 Difference]: Start difference. First operand 590 states and 914 transitions. Second operand 3 states. [2019-10-15 01:11:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:28,716 INFO L93 Difference]: Finished difference Result 1629 states and 2601 transitions. [2019-10-15 01:11:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:28,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:11:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:28,726 INFO L225 Difference]: With dead ends: 1629 [2019-10-15 01:11:28,727 INFO L226 Difference]: Without dead ends: 1105 [2019-10-15 01:11:28,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-10-15 01:11:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2019-10-15 01:11:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2019-10-15 01:11:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1753 transitions. [2019-10-15 01:11:28,781 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1753 transitions. Word has length 149 [2019-10-15 01:11:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:28,782 INFO L462 AbstractCegarLoop]: Abstraction has 1103 states and 1753 transitions. [2019-10-15 01:11:28,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1753 transitions. [2019-10-15 01:11:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:11:28,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:28,788 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, 1, 1, 1] [2019-10-15 01:11:28,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:28,998 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:28,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1302054248, now seen corresponding path program 1 times [2019-10-15 01:11:28,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:28,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690109157] [2019-10-15 01:11:29,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:29,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:29,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:29,133 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:11:29,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690109157] [2019-10-15 01:11:29,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639040158] [2019-10-15 01:11:29,134 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:11:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:29,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 2793 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:29,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:29,776 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:11:29,776 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:29,974 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:11:29,974 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:29,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:29,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461672514] [2019-10-15 01:11:29,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:29,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:29,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:29,976 INFO L87 Difference]: Start difference. First operand 1103 states and 1753 transitions. Second operand 3 states. [2019-10-15 01:11:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:30,074 INFO L93 Difference]: Finished difference Result 3170 states and 5143 transitions. [2019-10-15 01:11:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:30,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:11:30,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:30,092 INFO L225 Difference]: With dead ends: 3170 [2019-10-15 01:11:30,092 INFO L226 Difference]: Without dead ends: 2133 [2019-10-15 01:11:30,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2019-10-15 01:11:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2130. [2019-10-15 01:11:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-10-15 01:11:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3449 transitions. [2019-10-15 01:11:30,195 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3449 transitions. Word has length 150 [2019-10-15 01:11:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:30,198 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 3449 transitions. [2019-10-15 01:11:30,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3449 transitions. [2019-10-15 01:11:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:11:30,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:30,203 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, 1, 1, 1, 1] [2019-10-15 01:11:30,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:30,410 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1707680202, now seen corresponding path program 1 times [2019-10-15 01:11:30,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:30,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258188410] [2019-10-15 01:11:30,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:30,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:30,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:30,577 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:11:30,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258188410] [2019-10-15 01:11:30,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482308205] [2019-10-15 01:11:30,578 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:11:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:31,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:31,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:31,153 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:11:31,154 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:31,435 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:11:31,436 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:31,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:31,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718849334] [2019-10-15 01:11:31,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:31,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:31,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:31,439 INFO L87 Difference]: Start difference. First operand 2130 states and 3449 transitions. Second operand 3 states. [2019-10-15 01:11:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:31,585 INFO L93 Difference]: Finished difference Result 6253 states and 10302 transitions. [2019-10-15 01:11:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:31,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-15 01:11:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:31,628 INFO L225 Difference]: With dead ends: 6253 [2019-10-15 01:11:31,628 INFO L226 Difference]: Without dead ends: 4189 [2019-10-15 01:11:31,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2019-10-15 01:11:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 4185. [2019-10-15 01:11:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4185 states. [2019-10-15 01:11:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6891 transitions. [2019-10-15 01:11:31,841 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6891 transitions. Word has length 151 [2019-10-15 01:11:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:31,842 INFO L462 AbstractCegarLoop]: Abstraction has 4185 states and 6891 transitions. [2019-10-15 01:11:31,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6891 transitions. [2019-10-15 01:11:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:11:31,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:31,847 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, 1, 1, 1, 1, 1] [2019-10-15 01:11:32,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:32,063 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1397186794, now seen corresponding path program 1 times [2019-10-15 01:11:32,064 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:32,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457520922] [2019-10-15 01:11:32,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:32,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:32,215 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:11:32,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457520922] [2019-10-15 01:11:32,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492171611] [2019-10-15 01:11:32,216 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:11:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:32,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:32,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:32,756 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:11:32,757 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:33,033 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:11:33,033 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:33,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:33,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977071289] [2019-10-15 01:11:33,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:33,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:33,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:33,035 INFO L87 Difference]: Start difference. First operand 4185 states and 6891 transitions. Second operand 3 states. [2019-10-15 01:11:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:33,260 INFO L93 Difference]: Finished difference Result 12420 states and 20857 transitions. [2019-10-15 01:11:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:33,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-15 01:11:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:33,345 INFO L225 Difference]: With dead ends: 12420 [2019-10-15 01:11:33,345 INFO L226 Difference]: Without dead ends: 8301 [2019-10-15 01:11:33,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8301 states. [2019-10-15 01:11:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8301 to 8296. [2019-10-15 01:11:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8296 states. [2019-10-15 01:11:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 13933 transitions. [2019-10-15 01:11:33,747 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 13933 transitions. Word has length 152 [2019-10-15 01:11:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:33,748 INFO L462 AbstractCegarLoop]: Abstraction has 8296 states and 13933 transitions. [2019-10-15 01:11:33,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 13933 transitions. [2019-10-15 01:11:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:11:33,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:33,753 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, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:33,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:33,962 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash 361829644, now seen corresponding path program 1 times [2019-10-15 01:11:33,963 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:33,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453319798] [2019-10-15 01:11:33,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:33,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:33,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:34,142 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:11:34,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453319798] [2019-10-15 01:11:34,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102105145] [2019-10-15 01:11:34,143 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:11:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:34,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 2799 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:34,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:34,795 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:11:34,795 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:35,507 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-10-15 01:11:35,793 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:11:35,796 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:35,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:35,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420174844] [2019-10-15 01:11:35,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:35,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:35,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:35,811 INFO L87 Difference]: Start difference. First operand 8296 states and 13933 transitions. Second operand 3 states. [2019-10-15 01:11:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:36,232 INFO L93 Difference]: Finished difference Result 24755 states and 42779 transitions. [2019-10-15 01:11:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:36,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:11:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:36,377 INFO L225 Difference]: With dead ends: 24755 [2019-10-15 01:11:36,378 INFO L226 Difference]: Without dead ends: 16515 [2019-10-15 01:11:36,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16515 states. [2019-10-15 01:11:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16515 to 16509. [2019-10-15 01:11:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16509 states. [2019-10-15 01:11:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16509 states to 16509 states and 28542 transitions. [2019-10-15 01:11:37,338 INFO L78 Accepts]: Start accepts. Automaton has 16509 states and 28542 transitions. Word has length 153 [2019-10-15 01:11:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:37,338 INFO L462 AbstractCegarLoop]: Abstraction has 16509 states and 28542 transitions. [2019-10-15 01:11:37,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 16509 states and 28542 transitions. [2019-10-15 01:11:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-15 01:11:37,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:37,362 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:37,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:37,568 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1927623556, now seen corresponding path program 1 times [2019-10-15 01:11:37,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:37,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373666941] [2019-10-15 01:11:37,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:37,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:37,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-15 01:11:37,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373666941] [2019-10-15 01:11:37,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:37,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:37,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808163040] [2019-10-15 01:11:37,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:37,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:37,768 INFO L87 Difference]: Start difference. First operand 16509 states and 28542 transitions. Second operand 6 states. [2019-10-15 01:11:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:39,097 INFO L93 Difference]: Finished difference Result 33080 states and 58965 transitions. [2019-10-15 01:11:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:39,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 234 [2019-10-15 01:11:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:39,236 INFO L225 Difference]: With dead ends: 33080 [2019-10-15 01:11:39,236 INFO L226 Difference]: Without dead ends: 16637 [2019-10-15 01:11:39,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16637 states. [2019-10-15 01:11:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16637 to 16637. [2019-10-15 01:11:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16637 states. [2019-10-15 01:11:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16637 states to 16637 states and 28670 transitions. [2019-10-15 01:11:40,892 INFO L78 Accepts]: Start accepts. Automaton has 16637 states and 28670 transitions. Word has length 234 [2019-10-15 01:11:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:40,892 INFO L462 AbstractCegarLoop]: Abstraction has 16637 states and 28670 transitions. [2019-10-15 01:11:40,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16637 states and 28670 transitions. [2019-10-15 01:11:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-10-15 01:11:40,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:40,919 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:40,920 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1697729072, now seen corresponding path program 1 times [2019-10-15 01:11:40,920 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:40,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809866685] [2019-10-15 01:11:40,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-15 01:11:41,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809866685] [2019-10-15 01:11:41,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812172127] [2019-10-15 01:11:41,157 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:11:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:41,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 4055 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:11:41,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-10-15 01:11:42,225 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:42,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:42,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:42,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:42,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:42,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-10-15 01:11:43,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [320688003] [2019-10-15 01:11:43,048 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 341 [2019-10-15 01:11:43,111 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:11:43,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:11:43,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:11:43,207 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 137 root evaluator evaluations with a maximum evaluation depth of 0. Performed 137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 264 variables. [2019-10-15 01:11:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:43,212 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:11:43,319 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-15 01:11:43,319 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:11:43,329 INFO L553 sIntCurrentIteration]: We unified 339 AI predicates to 339 [2019-10-15 01:11:43,329 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:11:43,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:11:43,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 7, 6] total 12 [2019-10-15 01:11:43,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288357616] [2019-10-15 01:11:43,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:11:43,333 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:43,333 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:11:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:11:43,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:11:43,334 INFO L87 Difference]: Start difference. First operand 16637 states and 28670 transitions. Second operand 2 states. [2019-10-15 01:11:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:43,720 INFO L93 Difference]: Finished difference Result 16637 states and 28670 transitions. [2019-10-15 01:11:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:11:43,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 340 [2019-10-15 01:11:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:43,723 INFO L225 Difference]: With dead ends: 16637 [2019-10-15 01:11:43,723 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:11:43,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:11:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:11:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:11:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:11:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:11:43,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 340 [2019-10-15 01:11:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:43,835 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:11:43,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:11:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:11:43,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:11:44,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:44,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:11:45,012 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 1