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_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:12:19,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:12:19,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:12:19,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:12:19,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:12:19,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:12:19,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:12:19,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:12:19,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:12:19,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:12:19,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:12:19,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:12:19,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:12:19,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:12:19,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:12:19,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:12:19,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:12:19,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:12:19,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:12:19,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:12:19,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:12:19,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:12:19,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:12:19,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:12:19,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:12:19,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:12:19,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:12:19,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:12:19,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:12:19,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:12:19,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:12:19,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:12:19,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:12:19,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:12:19,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:12:19,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:12:19,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:12:19,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:12:19,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:12:19,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:12:19,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:12:19,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:12:19,760 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:12:19,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:12:19,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:12:19,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:12:19,762 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:12:19,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:12:19,762 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:12:19,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:12:19,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:12:19,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:12:19,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:12:19,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:12:19,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:12:19,764 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:12:19,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:12:19,764 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:12:19,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:12:19,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:12:19,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:12:19,765 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:12:19,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:12:19,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:19,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:12:19,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:12:19,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:12:19,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:12:19,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:12:19,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:12:19,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:12:20,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:12:20,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:12:20,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:12:20,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:12:20,075 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:12:20,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-10-13 21:12:20,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9568e62af/168fa0789b8f4fd4bfdccb7262b1b571/FLAGecc9c7855 [2019-10-13 21:12:20,738 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:12:20,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-10-13 21:12:20,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9568e62af/168fa0789b8f4fd4bfdccb7262b1b571/FLAGecc9c7855 [2019-10-13 21:12:20,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9568e62af/168fa0789b8f4fd4bfdccb7262b1b571 [2019-10-13 21:12:20,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:12:20,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:12:20,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:20,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:12:20,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:12:20,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:20" (1/1) ... [2019-10-13 21:12:20,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b14516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:20, skipping insertion in model container [2019-10-13 21:12:20,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:20" (1/1) ... [2019-10-13 21:12:20,991 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:12:21,079 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:12:21,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:21,792 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:12:21,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:22,002 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:12:22,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22 WrapperNode [2019-10-13 21:12:22,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:22,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:12:22,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:12:22,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:12:22,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... [2019-10-13 21:12:22,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... [2019-10-13 21:12:22,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... [2019-10-13 21:12:22,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... [2019-10-13 21:12:22,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... [2019-10-13 21:12:22,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... [2019-10-13 21:12:22,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... [2019-10-13 21:12:22,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:12:22,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:12:22,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:12:22,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:12:22,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:22,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:12:22,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:12:22,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:22,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:22,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:22,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:22,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:12:22,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:12:22,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:12:22,265 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:12:22,266 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:12:22,266 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:12:22,266 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:12:22,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:12:22,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:22,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:22,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:22,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:22,267 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:12:22,268 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:12:22,268 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:12:22,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:12:22,268 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:12:22,269 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:12:22,269 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:12:22,269 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:12:22,269 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:12:22,269 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:12:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:12:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:12:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:12:22,270 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:12:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:12:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:12:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:12:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:12:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:12:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:12:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:12:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:12:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:12:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:12:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:12:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:12:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:12:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:12:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:12:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:12:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:12:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:12:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:12:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:12:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:12:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:12:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:12:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:12:22,281 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:12:22,281 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:12:22,281 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:12:22,281 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:12:22,281 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:12:22,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:12:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:12:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:12:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:12:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:12:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:12:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:12:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:12:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:12:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:12:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:12:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:12:22,285 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:22,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:12:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:12:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:12:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:12:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:12:22,287 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:12:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:12:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:12:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:12:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:12:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:12:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:12:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:12:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:12:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:12:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:12:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:12:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:12:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:12:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:12:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:12:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:12:22,290 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:12:22,291 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:12:22,291 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:12:22,291 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:12:22,291 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:12:22,291 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:22,291 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:12:22,291 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:12:22,292 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:12:22,292 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:12:22,292 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:12:22,292 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:12:22,292 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:12:22,292 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:12:22,293 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:12:22,293 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:22,293 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:12:22,293 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:12:22,293 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-13 21:12:22,293 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-13 21:12:22,293 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:12:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:12:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:12:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:12:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:12:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:12:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:12:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:12:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:12:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:12:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:12:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:12:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:12:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:12:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:12:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:12:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:12:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:12:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:12:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:12:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:12:24,448 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:12:24,448 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:12:24,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:24 BoogieIcfgContainer [2019-10-13 21:12:24,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:12:24,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:12:24,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:12:24,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:12:24,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:12:20" (1/3) ... [2019-10-13 21:12:24,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57837e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:24, skipping insertion in model container [2019-10-13 21:12:24,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:22" (2/3) ... [2019-10-13 21:12:24,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57837e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:24, skipping insertion in model container [2019-10-13 21:12:24,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:24" (3/3) ... [2019-10-13 21:12:24,460 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2019-10-13 21:12:24,470 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:12:24,481 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:12:24,493 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:12:24,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:12:24,539 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:12:24,539 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:12:24,539 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:12:24,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:12:24,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:12:24,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:12:24,540 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:12:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states. [2019-10-13 21:12:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:12:24,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:24,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:24,616 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash 236945449, now seen corresponding path program 1 times [2019-10-13 21:12:24,634 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:24,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977301998] [2019-10-13 21:12:24,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:25,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977301998] [2019-10-13 21:12:25,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:25,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:25,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472903216] [2019-10-13 21:12:25,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:25,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:25,276 INFO L87 Difference]: Start difference. First operand 796 states. Second operand 4 states. [2019-10-13 21:12:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:25,512 INFO L93 Difference]: Finished difference Result 1241 states and 1999 transitions. [2019-10-13 21:12:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:25,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-13 21:12:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:25,548 INFO L225 Difference]: With dead ends: 1241 [2019-10-13 21:12:25,548 INFO L226 Difference]: Without dead ends: 629 [2019-10-13 21:12:25,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-13 21:12:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-13 21:12:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-13 21:12:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1001 transitions. [2019-10-13 21:12:25,690 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1001 transitions. Word has length 87 [2019-10-13 21:12:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:25,690 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 1001 transitions. [2019-10-13 21:12:25,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1001 transitions. [2019-10-13 21:12:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:12:25,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:25,699 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:25,699 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:25,700 INFO L82 PathProgramCache]: Analyzing trace with hash -217065445, now seen corresponding path program 1 times [2019-10-13 21:12:25,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:25,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701766277] [2019-10-13 21:12:25,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:25,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:25,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:25,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701766277] [2019-10-13 21:12:25,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:25,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:25,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098355278] [2019-10-13 21:12:25,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:25,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:25,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:25,951 INFO L87 Difference]: Start difference. First operand 629 states and 1001 transitions. Second operand 4 states. [2019-10-13 21:12:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:26,047 INFO L93 Difference]: Finished difference Result 1221 states and 1960 transitions. [2019-10-13 21:12:26,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:26,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:12:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:26,064 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:12:26,065 INFO L226 Difference]: Without dead ends: 629 [2019-10-13 21:12:26,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-13 21:12:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-13 21:12:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-13 21:12:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1000 transitions. [2019-10-13 21:12:26,132 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1000 transitions. Word has length 90 [2019-10-13 21:12:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,132 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 1000 transitions. [2019-10-13 21:12:26,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1000 transitions. [2019-10-13 21:12:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:12:26,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,135 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,136 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1176241356, now seen corresponding path program 1 times [2019-10-13 21:12:26,136 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950398878] [2019-10-13 21:12:26,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:26,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950398878] [2019-10-13 21:12:26,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:26,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:26,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605312943] [2019-10-13 21:12:26,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:26,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:26,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:26,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:26,371 INFO L87 Difference]: Start difference. First operand 629 states and 1000 transitions. Second operand 4 states. [2019-10-13 21:12:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:26,446 INFO L93 Difference]: Finished difference Result 1221 states and 1959 transitions. [2019-10-13 21:12:26,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:26,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:12:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:26,456 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:12:26,456 INFO L226 Difference]: Without dead ends: 629 [2019-10-13 21:12:26,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-13 21:12:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-13 21:12:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-13 21:12:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 999 transitions. [2019-10-13 21:12:26,510 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 999 transitions. Word has length 91 [2019-10-13 21:12:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,511 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 999 transitions. [2019-10-13 21:12:26,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 999 transitions. [2019-10-13 21:12:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:12:26,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,513 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash 21534647, now seen corresponding path program 1 times [2019-10-13 21:12:26,514 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397964554] [2019-10-13 21:12:26,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:26,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397964554] [2019-10-13 21:12:26,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:26,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:26,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958177426] [2019-10-13 21:12:26,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:26,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:26,656 INFO L87 Difference]: Start difference. First operand 629 states and 999 transitions. Second operand 4 states. [2019-10-13 21:12:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:26,729 INFO L93 Difference]: Finished difference Result 1221 states and 1958 transitions. [2019-10-13 21:12:26,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:26,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:12:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:26,736 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:12:26,737 INFO L226 Difference]: Without dead ends: 629 [2019-10-13 21:12:26,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-13 21:12:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-13 21:12:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-13 21:12:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 998 transitions. [2019-10-13 21:12:26,767 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 998 transitions. Word has length 92 [2019-10-13 21:12:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,767 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 998 transitions. [2019-10-13 21:12:26,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 998 transitions. [2019-10-13 21:12:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:12:26,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,770 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,770 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash -634656752, now seen corresponding path program 1 times [2019-10-13 21:12:26,771 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98852207] [2019-10-13 21:12:26,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:26,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98852207] [2019-10-13 21:12:26,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:26,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:26,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143911891] [2019-10-13 21:12:26,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:26,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:26,870 INFO L87 Difference]: Start difference. First operand 629 states and 998 transitions. Second operand 4 states. [2019-10-13 21:12:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:26,923 INFO L93 Difference]: Finished difference Result 1221 states and 1957 transitions. [2019-10-13 21:12:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:26,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-13 21:12:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:26,932 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:12:26,932 INFO L226 Difference]: Without dead ends: 629 [2019-10-13 21:12:26,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-13 21:12:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-13 21:12:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-13 21:12:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 997 transitions. [2019-10-13 21:12:26,965 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 997 transitions. Word has length 93 [2019-10-13 21:12:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,966 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 997 transitions. [2019-10-13 21:12:26,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 997 transitions. [2019-10-13 21:12:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:12:26,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,970 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,970 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1365704531, now seen corresponding path program 1 times [2019-10-13 21:12:26,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19483472] [2019-10-13 21:12:26,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:27,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19483472] [2019-10-13 21:12:27,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:27,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:27,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597743176] [2019-10-13 21:12:27,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:27,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:27,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:27,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:27,253 INFO L87 Difference]: Start difference. First operand 629 states and 997 transitions. Second operand 10 states. [2019-10-13 21:12:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:27,419 INFO L93 Difference]: Finished difference Result 1179 states and 1877 transitions. [2019-10-13 21:12:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:27,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-13 21:12:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:27,425 INFO L225 Difference]: With dead ends: 1179 [2019-10-13 21:12:27,425 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:12:27,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:12:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:12:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-13 21:12:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-13 21:12:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1006 transitions. [2019-10-13 21:12:27,459 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1006 transitions. Word has length 94 [2019-10-13 21:12:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:27,459 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1006 transitions. [2019-10-13 21:12:27,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1006 transitions. [2019-10-13 21:12:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:12:27,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:27,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:27,464 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash -564914574, now seen corresponding path program 1 times [2019-10-13 21:12:27,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:27,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816068628] [2019-10-13 21:12:27,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:27,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816068628] [2019-10-13 21:12:27,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:27,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:27,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861987635] [2019-10-13 21:12:27,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:27,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:27,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:27,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:27,565 INFO L87 Difference]: Start difference. First operand 636 states and 1006 transitions. Second operand 4 states. [2019-10-13 21:12:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:27,621 INFO L93 Difference]: Finished difference Result 1227 states and 1963 transitions. [2019-10-13 21:12:27,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:27,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-13 21:12:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:27,628 INFO L225 Difference]: With dead ends: 1227 [2019-10-13 21:12:27,628 INFO L226 Difference]: Without dead ends: 623 [2019-10-13 21:12:27,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-13 21:12:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-13 21:12:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-13 21:12:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 983 transitions. [2019-10-13 21:12:27,653 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 983 transitions. Word has length 94 [2019-10-13 21:12:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:27,654 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 983 transitions. [2019-10-13 21:12:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 983 transitions. [2019-10-13 21:12:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:12:27,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:27,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:27,659 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash -811237728, now seen corresponding path program 1 times [2019-10-13 21:12:27,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:27,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726741440] [2019-10-13 21:12:27,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:27,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726741440] [2019-10-13 21:12:27,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:27,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:27,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844381199] [2019-10-13 21:12:27,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:27,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:27,799 INFO L87 Difference]: Start difference. First operand 623 states and 983 transitions. Second operand 6 states. [2019-10-13 21:12:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:28,050 INFO L93 Difference]: Finished difference Result 1167 states and 1855 transitions. [2019-10-13 21:12:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:28,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:12:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:28,056 INFO L225 Difference]: With dead ends: 1167 [2019-10-13 21:12:28,056 INFO L226 Difference]: Without dead ends: 623 [2019-10-13 21:12:28,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-13 21:12:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-13 21:12:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-13 21:12:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 979 transitions. [2019-10-13 21:12:28,081 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 979 transitions. Word has length 95 [2019-10-13 21:12:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:28,081 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 979 transitions. [2019-10-13 21:12:28,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 979 transitions. [2019-10-13 21:12:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:12:28,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:28,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:28,084 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1457329514, now seen corresponding path program 1 times [2019-10-13 21:12:28,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:28,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476348332] [2019-10-13 21:12:28,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:28,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476348332] [2019-10-13 21:12:28,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:28,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:28,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052025080] [2019-10-13 21:12:28,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:28,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:28,196 INFO L87 Difference]: Start difference. First operand 623 states and 979 transitions. Second operand 6 states. [2019-10-13 21:12:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:28,392 INFO L93 Difference]: Finished difference Result 1167 states and 1851 transitions. [2019-10-13 21:12:28,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:28,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:12:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:28,398 INFO L225 Difference]: With dead ends: 1167 [2019-10-13 21:12:28,398 INFO L226 Difference]: Without dead ends: 623 [2019-10-13 21:12:28,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-13 21:12:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-13 21:12:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-13 21:12:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 975 transitions. [2019-10-13 21:12:28,424 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 975 transitions. Word has length 96 [2019-10-13 21:12:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:28,424 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 975 transitions. [2019-10-13 21:12:28,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 975 transitions. [2019-10-13 21:12:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:12:28,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:28,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:28,426 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1359647269, now seen corresponding path program 1 times [2019-10-13 21:12:28,427 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:28,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48597514] [2019-10-13 21:12:28,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:28,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48597514] [2019-10-13 21:12:28,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:28,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:28,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262399400] [2019-10-13 21:12:28,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:28,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:28,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:28,536 INFO L87 Difference]: Start difference. First operand 623 states and 975 transitions. Second operand 6 states. [2019-10-13 21:12:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:28,730 INFO L93 Difference]: Finished difference Result 1167 states and 1847 transitions. [2019-10-13 21:12:28,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:28,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:12:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:28,735 INFO L225 Difference]: With dead ends: 1167 [2019-10-13 21:12:28,735 INFO L226 Difference]: Without dead ends: 623 [2019-10-13 21:12:28,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-13 21:12:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-13 21:12:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-13 21:12:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 971 transitions. [2019-10-13 21:12:28,765 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 971 transitions. Word has length 97 [2019-10-13 21:12:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:28,765 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 971 transitions. [2019-10-13 21:12:28,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 971 transitions. [2019-10-13 21:12:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:12:28,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:28,768 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:28,768 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash -969773403, now seen corresponding path program 1 times [2019-10-13 21:12:28,769 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:28,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159404438] [2019-10-13 21:12:28,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:29,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159404438] [2019-10-13 21:12:29,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:29,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:29,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452671763] [2019-10-13 21:12:29,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:29,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:29,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:29,003 INFO L87 Difference]: Start difference. First operand 623 states and 971 transitions. Second operand 7 states. [2019-10-13 21:12:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:29,110 INFO L93 Difference]: Finished difference Result 1167 states and 1843 transitions. [2019-10-13 21:12:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:12:29,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-13 21:12:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:29,118 INFO L225 Difference]: With dead ends: 1167 [2019-10-13 21:12:29,118 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:12:29,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:12:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-13 21:12:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-13 21:12:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 937 transitions. [2019-10-13 21:12:29,147 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 937 transitions. Word has length 97 [2019-10-13 21:12:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:29,148 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 937 transitions. [2019-10-13 21:12:29,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 937 transitions. [2019-10-13 21:12:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:12:29,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:29,151 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:29,151 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -137400005, now seen corresponding path program 1 times [2019-10-13 21:12:29,152 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:29,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902423688] [2019-10-13 21:12:29,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:29,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902423688] [2019-10-13 21:12:29,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:29,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:29,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121897601] [2019-10-13 21:12:29,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:29,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:29,295 INFO L87 Difference]: Start difference. First operand 602 states and 937 transitions. Second operand 6 states. [2019-10-13 21:12:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:29,391 INFO L93 Difference]: Finished difference Result 1146 states and 1809 transitions. [2019-10-13 21:12:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:29,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-13 21:12:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:29,397 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:12:29,397 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:12:29,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:12:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-13 21:12:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-13 21:12:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 936 transitions. [2019-10-13 21:12:29,418 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 936 transitions. Word has length 98 [2019-10-13 21:12:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:29,418 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 936 transitions. [2019-10-13 21:12:29,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 936 transitions. [2019-10-13 21:12:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:12:29,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:29,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:29,420 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2069760426, now seen corresponding path program 1 times [2019-10-13 21:12:29,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:29,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859307179] [2019-10-13 21:12:29,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:29,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859307179] [2019-10-13 21:12:29,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:29,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:29,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826563826] [2019-10-13 21:12:29,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:29,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:29,524 INFO L87 Difference]: Start difference. First operand 602 states and 936 transitions. Second operand 6 states. [2019-10-13 21:12:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:29,608 INFO L93 Difference]: Finished difference Result 1146 states and 1808 transitions. [2019-10-13 21:12:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:29,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-13 21:12:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:29,613 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:12:29,613 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:12:29,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:12:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-13 21:12:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-13 21:12:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 935 transitions. [2019-10-13 21:12:29,636 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 935 transitions. Word has length 99 [2019-10-13 21:12:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:29,636 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 935 transitions. [2019-10-13 21:12:29,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 935 transitions. [2019-10-13 21:12:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:12:29,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:29,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:29,638 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1151724576, now seen corresponding path program 1 times [2019-10-13 21:12:29,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:29,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907823505] [2019-10-13 21:12:29,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:29,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907823505] [2019-10-13 21:12:29,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:29,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:12:29,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232027345] [2019-10-13 21:12:29,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:12:29,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:29,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:12:29,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:29,865 INFO L87 Difference]: Start difference. First operand 602 states and 935 transitions. Second operand 12 states. [2019-10-13 21:12:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:30,065 INFO L93 Difference]: Finished difference Result 1147 states and 1807 transitions. [2019-10-13 21:12:30,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:12:30,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-13 21:12:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:30,070 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:12:30,071 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:12:30,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:12:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:12:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-13 21:12:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-13 21:12:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 934 transitions. [2019-10-13 21:12:30,092 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 934 transitions. Word has length 100 [2019-10-13 21:12:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:30,092 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 934 transitions. [2019-10-13 21:12:30,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:12:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 934 transitions. [2019-10-13 21:12:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:12:30,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:30,094 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:30,094 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash 196339579, now seen corresponding path program 1 times [2019-10-13 21:12:30,095 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:30,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450032303] [2019-10-13 21:12:30,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:30,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450032303] [2019-10-13 21:12:30,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:30,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:30,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076334948] [2019-10-13 21:12:30,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:30,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:30,256 INFO L87 Difference]: Start difference. First operand 602 states and 934 transitions. Second operand 10 states. [2019-10-13 21:12:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:36,671 INFO L93 Difference]: Finished difference Result 1776 states and 2866 transitions. [2019-10-13 21:12:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:12:36,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-10-13 21:12:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:36,686 INFO L225 Difference]: With dead ends: 1776 [2019-10-13 21:12:36,686 INFO L226 Difference]: Without dead ends: 1240 [2019-10-13 21:12:36,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:12:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-10-13 21:12:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1210. [2019-10-13 21:12:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-13 21:12:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1927 transitions. [2019-10-13 21:12:36,782 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1927 transitions. Word has length 101 [2019-10-13 21:12:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:36,783 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1927 transitions. [2019-10-13 21:12:36,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1927 transitions. [2019-10-13 21:12:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:12:36,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:36,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:36,787 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash 994116260, now seen corresponding path program 1 times [2019-10-13 21:12:36,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:36,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069293131] [2019-10-13 21:12:36,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:36,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:36,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:37,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069293131] [2019-10-13 21:12:37,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:37,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:37,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301519160] [2019-10-13 21:12:37,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:37,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:37,052 INFO L87 Difference]: Start difference. First operand 1210 states and 1927 transitions. Second operand 10 states. [2019-10-13 21:12:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:43,601 INFO L93 Difference]: Finished difference Result 3773 states and 6220 transitions. [2019-10-13 21:12:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:12:43,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-10-13 21:12:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:43,620 INFO L225 Difference]: With dead ends: 3773 [2019-10-13 21:12:43,621 INFO L226 Difference]: Without dead ends: 2629 [2019-10-13 21:12:43,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:12:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-10-13 21:12:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2588. [2019-10-13 21:12:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-10-13 21:12:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 4209 transitions. [2019-10-13 21:12:43,748 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 4209 transitions. Word has length 102 [2019-10-13 21:12:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:43,748 INFO L462 AbstractCegarLoop]: Abstraction has 2588 states and 4209 transitions. [2019-10-13 21:12:43,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 4209 transitions. [2019-10-13 21:12:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:12:43,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:43,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:43,751 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash 800793247, now seen corresponding path program 1 times [2019-10-13 21:12:43,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:43,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934508732] [2019-10-13 21:12:43,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:43,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:43,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:43,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934508732] [2019-10-13 21:12:43,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:43,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:43,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287149826] [2019-10-13 21:12:43,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:43,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:43,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:43,894 INFO L87 Difference]: Start difference. First operand 2588 states and 4209 transitions. Second operand 10 states. [2019-10-13 21:12:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:49,513 INFO L93 Difference]: Finished difference Result 8393 states and 14151 transitions. [2019-10-13 21:12:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:12:49,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-10-13 21:12:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:49,562 INFO L225 Difference]: With dead ends: 8393 [2019-10-13 21:12:49,562 INFO L226 Difference]: Without dead ends: 5871 [2019-10-13 21:12:49,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:12:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-10-13 21:12:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5808. [2019-10-13 21:12:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5808 states. [2019-10-13 21:12:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 9647 transitions. [2019-10-13 21:12:50,054 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 9647 transitions. Word has length 103 [2019-10-13 21:12:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:50,055 INFO L462 AbstractCegarLoop]: Abstraction has 5808 states and 9647 transitions. [2019-10-13 21:12:50,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 9647 transitions. [2019-10-13 21:12:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:12:50,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:50,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:50,060 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -51849208, now seen corresponding path program 1 times [2019-10-13 21:12:50,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:50,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050113852] [2019-10-13 21:12:50,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:50,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:50,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:50,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050113852] [2019-10-13 21:12:50,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:50,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:50,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517081074] [2019-10-13 21:12:50,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:50,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:50,232 INFO L87 Difference]: Start difference. First operand 5808 states and 9647 transitions. Second operand 10 states.