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_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:11:17,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:11:17,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:11:17,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:11:17,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:11:17,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:11:17,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:11:17,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:11:17,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:11:17,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:11:17,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:11:17,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:11:17,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:11:17,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:11:17,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:11:17,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:11:17,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:11:17,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:11:17,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:11:17,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:11:17,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:11:17,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:11:17,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:11:17,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:11:17,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:11:17,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:11:17,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:11:17,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:11:17,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:11:17,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:11:17,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:11:17,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:11:17,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:11:17,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:11:17,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:11:17,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:11:17,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:11:17,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:11:17,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:11:17,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:11:17,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:11:17,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:11:17,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:11:17,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:11:17,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:11:17,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:11:17,833 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:11:17,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:11:17,833 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:11:17,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:11:17,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:11:17,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:11:17,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:11:17,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:11:17,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:11:17,835 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:11:17,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:11:17,835 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:11:17,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:11:17,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:11:17,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:11:17,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:11:17,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:11:17,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:17,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:11:17,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:11:17,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:11:17,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:11:17,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:11:17,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:11:17,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:11:18,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:11:18,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:11:18,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:11:18,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:11:18,168 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:11:18,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product31.cil.c [2019-10-15 01:11:18,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2eda79fa/ae6a38f5b30542a7879939a17c8ac777/FLAG6ba3ac088 [2019-10-15 01:11:18,931 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:11:18,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product31.cil.c [2019-10-15 01:11:18,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2eda79fa/ae6a38f5b30542a7879939a17c8ac777/FLAG6ba3ac088 [2019-10-15 01:11:19,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2eda79fa/ae6a38f5b30542a7879939a17c8ac777 [2019-10-15 01:11:19,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:11:19,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:11:19,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:19,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:11:19,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:11:19,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:19" (1/1) ... [2019-10-15 01:11:19,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f6a702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:19, skipping insertion in model container [2019-10-15 01:11:19,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:19" (1/1) ... [2019-10-15 01:11:19,147 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:11:19,220 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:11:19,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:19,942 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:11:20,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:20,260 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:11:20,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20 WrapperNode [2019-10-15 01:11:20,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:20,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:11:20,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:11:20,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:11:20,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... [2019-10-15 01:11:20,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... [2019-10-15 01:11:20,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... [2019-10-15 01:11:20,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... [2019-10-15 01:11:20,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... [2019-10-15 01:11:20,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... [2019-10-15 01:11:20,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... [2019-10-15 01:11:20,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:11:20,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:11:20,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:11:20,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:11:20,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:20,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:11:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:11:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:20,613 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:11:20,614 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:11:20,614 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:11:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:11:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:11:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:11:20,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:11:20,616 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:11:20,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:11:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:11:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:11:20,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:11:20,618 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:11:20,620 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:11:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:11:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:20,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:20,622 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:11:20,622 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:11:20,623 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:11:20,623 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:11:20,623 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:11:20,623 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:11:20,623 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:20,624 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:11:20,624 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:11:20,624 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:11:20,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:11:20,624 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:11:20,625 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:11:20,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:11:20,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:11:20,625 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:11:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:11:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:11:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:11:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:11:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:11:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:11:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:11:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:11:20,628 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:11:20,628 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:11:20,628 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:11:20,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:11:20,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:11:20,629 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:11:20,629 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:11:20,629 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:11:20,629 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:11:20,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:20,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:20,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:20,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:11:20,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:11:20,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:11:20,631 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:11:20,631 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:11:20,631 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:11:20,631 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:11:20,632 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:11:20,632 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:11:20,632 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:11:20,632 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:11:20,632 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:11:20,633 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:11:20,633 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:11:20,634 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:11:20,634 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:11:20,634 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:11:20,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:11:20,635 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:11:20,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:11:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:11:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:11:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:11:20,636 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:11:20,637 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:11:20,637 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:11:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:11:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:11:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:11:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:11:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:11:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:11:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:11:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:11:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:11:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:11:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:11:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:11:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:11:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:11:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:11:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:11:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:11:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:11:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:11:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:11:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:11:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:11:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:11:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:11:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:11:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:11:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:11:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:11:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:11:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:11:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:11:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:11:20,645 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:11:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:11:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:11:20,646 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:11:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:11:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:11:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:11:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:11:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:11:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:11:20,647 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:11:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:11:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:11:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:11:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:11:20,648 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:11:20,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:11:20,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:11:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:11:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:11:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:11:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:11:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:11:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:11:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:11:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:11:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:11:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:11:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:11:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:11:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:11:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:11:23,245 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:11:23,245 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:11:23,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:23 BoogieIcfgContainer [2019-10-15 01:11:23,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:11:23,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:11:23,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:11:23,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:11:23,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:11:19" (1/3) ... [2019-10-15 01:11:23,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a4e3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:23, skipping insertion in model container [2019-10-15 01:11:23,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:20" (2/3) ... [2019-10-15 01:11:23,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a4e3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:23, skipping insertion in model container [2019-10-15 01:11:23,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:23" (3/3) ... [2019-10-15 01:11:23,259 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product31.cil.c [2019-10-15 01:11:23,269 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:11:23,283 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:11:23,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:11:23,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:11:23,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:11:23,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:11:23,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:11:23,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:11:23,351 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:11:23,351 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:11:23,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:11:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states. [2019-10-15 01:11:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:11:23,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:23,436 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:23,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:23,443 INFO L82 PathProgramCache]: Analyzing trace with hash -817980403, now seen corresponding path program 1 times [2019-10-15 01:11:23,453 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:23,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366438647] [2019-10-15 01:11:23,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:23,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:24,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366438647] [2019-10-15 01:11:24,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:24,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:24,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953444965] [2019-10-15 01:11:24,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:24,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:24,241 INFO L87 Difference]: Start difference. First operand 808 states. Second operand 4 states. [2019-10-15 01:11:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:24,494 INFO L93 Difference]: Finished difference Result 1279 states and 2045 transitions. [2019-10-15 01:11:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:24,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:11:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,524 INFO L225 Difference]: With dead ends: 1279 [2019-10-15 01:11:24,524 INFO L226 Difference]: Without dead ends: 648 [2019-10-15 01:11:24,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-15 01:11:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-15 01:11:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-15 01:11:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1024 transitions. [2019-10-15 01:11:24,665 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1024 transitions. Word has length 135 [2019-10-15 01:11:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:24,666 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1024 transitions. [2019-10-15 01:11:24,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1024 transitions. [2019-10-15 01:11:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:11:24,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:24,675 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:24,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash 40844142, now seen corresponding path program 1 times [2019-10-15 01:11:24,676 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:24,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133621019] [2019-10-15 01:11:24,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:24,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133621019] [2019-10-15 01:11:24,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:24,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:24,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908164594] [2019-10-15 01:11:24,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:24,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:24,999 INFO L87 Difference]: Start difference. First operand 648 states and 1024 transitions. Second operand 4 states. [2019-10-15 01:11:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:25,106 INFO L93 Difference]: Finished difference Result 1259 states and 2006 transitions. [2019-10-15 01:11:25,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:25,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:11:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:25,120 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 01:11:25,120 INFO L226 Difference]: Without dead ends: 648 [2019-10-15 01:11:25,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-15 01:11:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-15 01:11:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-15 01:11:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1023 transitions. [2019-10-15 01:11:25,233 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1023 transitions. Word has length 138 [2019-10-15 01:11:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:25,233 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1023 transitions. [2019-10-15 01:11:25,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1023 transitions. [2019-10-15 01:11:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:11:25,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:25,241 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:25,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:25,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2063727196, now seen corresponding path program 1 times [2019-10-15 01:11:25,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:25,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788159593] [2019-10-15 01:11:25,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:25,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788159593] [2019-10-15 01:11:25,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:25,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:25,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89990480] [2019-10-15 01:11:25,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:25,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:25,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:25,407 INFO L87 Difference]: Start difference. First operand 648 states and 1023 transitions. Second operand 4 states. [2019-10-15 01:11:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:25,479 INFO L93 Difference]: Finished difference Result 1259 states and 2005 transitions. [2019-10-15 01:11:25,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:25,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:11:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:25,485 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 01:11:25,485 INFO L226 Difference]: Without dead ends: 648 [2019-10-15 01:11:25,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-15 01:11:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-15 01:11:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-15 01:11:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1022 transitions. [2019-10-15 01:11:25,515 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1022 transitions. Word has length 139 [2019-10-15 01:11:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:25,515 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1022 transitions. [2019-10-15 01:11:25,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1022 transitions. [2019-10-15 01:11:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:11:25,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:25,521 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:25,521 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:25,522 INFO L82 PathProgramCache]: Analyzing trace with hash -897970774, now seen corresponding path program 1 times [2019-10-15 01:11:25,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:25,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505647026] [2019-10-15 01:11:25,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:25,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505647026] [2019-10-15 01:11:25,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:25,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:25,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957515599] [2019-10-15 01:11:25,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:25,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:25,664 INFO L87 Difference]: Start difference. First operand 648 states and 1022 transitions. Second operand 4 states. [2019-10-15 01:11:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:25,724 INFO L93 Difference]: Finished difference Result 1259 states and 2004 transitions. [2019-10-15 01:11:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:25,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:11:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:25,730 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 01:11:25,730 INFO L226 Difference]: Without dead ends: 648 [2019-10-15 01:11:25,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-15 01:11:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-15 01:11:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-15 01:11:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1021 transitions. [2019-10-15 01:11:25,758 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1021 transitions. Word has length 140 [2019-10-15 01:11:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:25,758 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1021 transitions. [2019-10-15 01:11:25,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1021 transitions. [2019-10-15 01:11:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:11:25,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:25,764 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:25,764 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash 532109464, now seen corresponding path program 1 times [2019-10-15 01:11:25,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:25,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44802465] [2019-10-15 01:11:25,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:25,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:25,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44802465] [2019-10-15 01:11:25,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:25,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:25,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335868962] [2019-10-15 01:11:25,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:25,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:25,959 INFO L87 Difference]: Start difference. First operand 648 states and 1021 transitions. Second operand 4 states. [2019-10-15 01:11:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:26,026 INFO L93 Difference]: Finished difference Result 1259 states and 2003 transitions. [2019-10-15 01:11:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:26,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-15 01:11:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,040 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 01:11:26,041 INFO L226 Difference]: Without dead ends: 648 [2019-10-15 01:11:26,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-15 01:11:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-15 01:11:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-15 01:11:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1020 transitions. [2019-10-15 01:11:26,083 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1020 transitions. Word has length 141 [2019-10-15 01:11:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,084 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1020 transitions. [2019-10-15 01:11:26,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1020 transitions. [2019-10-15 01:11:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:11:26,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,090 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:26,099 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash 668360678, now seen corresponding path program 1 times [2019-10-15 01:11:26,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011951434] [2019-10-15 01:11:26,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:26,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011951434] [2019-10-15 01:11:26,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:26,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:11:26,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252775202] [2019-10-15 01:11:26,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:11:26,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:26,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:11:26,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:11:26,343 INFO L87 Difference]: Start difference. First operand 648 states and 1020 transitions. Second operand 10 states. [2019-10-15 01:11:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:26,525 INFO L93 Difference]: Finished difference Result 1217 states and 1923 transitions. [2019-10-15 01:11:26,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:26,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-10-15 01:11:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,530 INFO L225 Difference]: With dead ends: 1217 [2019-10-15 01:11:26,531 INFO L226 Difference]: Without dead ends: 657 [2019-10-15 01:11:26,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:11:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-15 01:11:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-10-15 01:11:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-15 01:11:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1029 transitions. [2019-10-15 01:11:26,561 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1029 transitions. Word has length 142 [2019-10-15 01:11:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,562 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 1029 transitions. [2019-10-15 01:11:26,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:11:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1029 transitions. [2019-10-15 01:11:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:11:26,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,568 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:26,568 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1790763771, now seen corresponding path program 1 times [2019-10-15 01:11:26,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586890225] [2019-10-15 01:11:26,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:26,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586890225] [2019-10-15 01:11:26,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:26,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:26,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593372516] [2019-10-15 01:11:26,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:26,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:26,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:26,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:26,780 INFO L87 Difference]: Start difference. First operand 655 states and 1029 transitions. Second operand 4 states. [2019-10-15 01:11:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:26,840 INFO L93 Difference]: Finished difference Result 1265 states and 2009 transitions. [2019-10-15 01:11:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:26,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-15 01:11:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:26,845 INFO L225 Difference]: With dead ends: 1265 [2019-10-15 01:11:26,846 INFO L226 Difference]: Without dead ends: 642 [2019-10-15 01:11:26,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-15 01:11:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-15 01:11:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-15 01:11:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1006 transitions. [2019-10-15 01:11:26,872 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1006 transitions. Word has length 142 [2019-10-15 01:11:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:26,873 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1006 transitions. [2019-10-15 01:11:26,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1006 transitions. [2019-10-15 01:11:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:11:26,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:26,879 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:26,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -973748208, now seen corresponding path program 1 times [2019-10-15 01:11:26,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:26,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026497204] [2019-10-15 01:11:26,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:26,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:27,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026497204] [2019-10-15 01:11:27,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:27,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:27,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492303713] [2019-10-15 01:11:27,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:27,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:27,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:27,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:27,031 INFO L87 Difference]: Start difference. First operand 642 states and 1006 transitions. Second operand 6 states. [2019-10-15 01:11:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:27,293 INFO L93 Difference]: Finished difference Result 1205 states and 1901 transitions. [2019-10-15 01:11:27,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:27,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:11:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:27,299 INFO L225 Difference]: With dead ends: 1205 [2019-10-15 01:11:27,299 INFO L226 Difference]: Without dead ends: 642 [2019-10-15 01:11:27,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-15 01:11:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-15 01:11:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-15 01:11:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1002 transitions. [2019-10-15 01:11:27,328 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1002 transitions. Word has length 143 [2019-10-15 01:11:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:27,329 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1002 transitions. [2019-10-15 01:11:27,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1002 transitions. [2019-10-15 01:11:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:11:27,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:27,335 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:27,335 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:27,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1310296887, now seen corresponding path program 1 times [2019-10-15 01:11:27,335 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:27,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966728211] [2019-10-15 01:11:27,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:27,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966728211] [2019-10-15 01:11:27,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:27,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:27,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287963355] [2019-10-15 01:11:27,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:27,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:27,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:27,479 INFO L87 Difference]: Start difference. First operand 642 states and 1002 transitions. Second operand 6 states. [2019-10-15 01:11:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:27,837 INFO L93 Difference]: Finished difference Result 1205 states and 1897 transitions. [2019-10-15 01:11:27,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:27,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:11:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:27,846 INFO L225 Difference]: With dead ends: 1205 [2019-10-15 01:11:27,846 INFO L226 Difference]: Without dead ends: 642 [2019-10-15 01:11:27,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-15 01:11:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-15 01:11:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-15 01:11:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 998 transitions. [2019-10-15 01:11:27,877 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 998 transitions. Word has length 144 [2019-10-15 01:11:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:27,878 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 998 transitions. [2019-10-15 01:11:27,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 998 transitions. [2019-10-15 01:11:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:11:27,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:27,883 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:27,884 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash -575769099, now seen corresponding path program 1 times [2019-10-15 01:11:27,884 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:27,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846865715] [2019-10-15 01:11:27,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:27,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:28,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846865715] [2019-10-15 01:11:28,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:28,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:28,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634534453] [2019-10-15 01:11:28,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:28,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:28,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:28,038 INFO L87 Difference]: Start difference. First operand 642 states and 998 transitions. Second operand 6 states. [2019-10-15 01:11:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:28,259 INFO L93 Difference]: Finished difference Result 1205 states and 1893 transitions. [2019-10-15 01:11:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:28,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:11:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:28,264 INFO L225 Difference]: With dead ends: 1205 [2019-10-15 01:11:28,264 INFO L226 Difference]: Without dead ends: 642 [2019-10-15 01:11:28,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-15 01:11:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-15 01:11:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-15 01:11:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 994 transitions. [2019-10-15 01:11:28,286 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 994 transitions. Word has length 145 [2019-10-15 01:11:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:28,287 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 994 transitions. [2019-10-15 01:11:28,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 994 transitions. [2019-10-15 01:11:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:11:28,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:28,291 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:28,292 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:28,292 INFO L82 PathProgramCache]: Analyzing trace with hash -839167371, now seen corresponding path program 1 times [2019-10-15 01:11:28,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:28,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812957451] [2019-10-15 01:11:28,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:28,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:28,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:28,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812957451] [2019-10-15 01:11:28,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:28,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:28,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482469866] [2019-10-15 01:11:28,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:28,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:28,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:28,429 INFO L87 Difference]: Start difference. First operand 642 states and 994 transitions. Second operand 7 states. [2019-10-15 01:11:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:28,519 INFO L93 Difference]: Finished difference Result 1205 states and 1889 transitions. [2019-10-15 01:11:28,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:28,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-15 01:11:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:28,525 INFO L225 Difference]: With dead ends: 1205 [2019-10-15 01:11:28,525 INFO L226 Difference]: Without dead ends: 621 [2019-10-15 01:11:28,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-15 01:11:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-15 01:11:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 01:11:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 960 transitions. [2019-10-15 01:11:28,548 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 960 transitions. Word has length 145 [2019-10-15 01:11:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:28,549 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 960 transitions. [2019-10-15 01:11:28,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 960 transitions. [2019-10-15 01:11:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:11:28,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:28,553 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:28,554 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash -997609202, now seen corresponding path program 1 times [2019-10-15 01:11:28,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:28,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668971253] [2019-10-15 01:11:28,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:28,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:28,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:28,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668971253] [2019-10-15 01:11:28,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:28,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:28,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240597983] [2019-10-15 01:11:28,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:28,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:28,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:28,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:28,718 INFO L87 Difference]: Start difference. First operand 621 states and 960 transitions. Second operand 6 states. [2019-10-15 01:11:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:28,838 INFO L93 Difference]: Finished difference Result 1184 states and 1855 transitions. [2019-10-15 01:11:28,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:28,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-15 01:11:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:28,843 INFO L225 Difference]: With dead ends: 1184 [2019-10-15 01:11:28,843 INFO L226 Difference]: Without dead ends: 621 [2019-10-15 01:11:28,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-15 01:11:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-15 01:11:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 01:11:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 959 transitions. [2019-10-15 01:11:28,873 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 959 transitions. Word has length 146 [2019-10-15 01:11:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:28,874 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 959 transitions. [2019-10-15 01:11:28,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 959 transitions. [2019-10-15 01:11:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:11:28,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:28,878 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:28,879 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1387851738, now seen corresponding path program 1 times [2019-10-15 01:11:28,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:28,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946171493] [2019-10-15 01:11:28,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:28,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:28,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:29,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946171493] [2019-10-15 01:11:29,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:29,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:29,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75644493] [2019-10-15 01:11:29,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:29,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:29,008 INFO L87 Difference]: Start difference. First operand 621 states and 959 transitions. Second operand 6 states. [2019-10-15 01:11:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:29,121 INFO L93 Difference]: Finished difference Result 1184 states and 1854 transitions. [2019-10-15 01:11:29,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:29,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-15 01:11:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:29,127 INFO L225 Difference]: With dead ends: 1184 [2019-10-15 01:11:29,127 INFO L226 Difference]: Without dead ends: 621 [2019-10-15 01:11:29,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-15 01:11:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-15 01:11:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 01:11:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 958 transitions. [2019-10-15 01:11:29,154 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 958 transitions. Word has length 147 [2019-10-15 01:11:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:29,156 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 958 transitions. [2019-10-15 01:11:29,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 958 transitions. [2019-10-15 01:11:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:11:29,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:29,161 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:29,161 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1636372693, now seen corresponding path program 1 times [2019-10-15 01:11:29,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:29,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49957292] [2019-10-15 01:11:29,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:29,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:29,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:29,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49957292] [2019-10-15 01:11:29,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:29,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:29,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639137577] [2019-10-15 01:11:29,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:29,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:29,290 INFO L87 Difference]: Start difference. First operand 621 states and 958 transitions. Second operand 4 states. [2019-10-15 01:11:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:29,368 INFO L93 Difference]: Finished difference Result 1184 states and 1853 transitions. [2019-10-15 01:11:29,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:29,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-15 01:11:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:29,376 INFO L225 Difference]: With dead ends: 1184 [2019-10-15 01:11:29,376 INFO L226 Difference]: Without dead ends: 621 [2019-10-15 01:11:29,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-15 01:11:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-15 01:11:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 01:11:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 957 transitions. [2019-10-15 01:11:29,416 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 957 transitions. Word has length 148 [2019-10-15 01:11:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:29,416 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 957 transitions. [2019-10-15 01:11:29,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 957 transitions. [2019-10-15 01:11:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:11:29,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:29,422 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:29,423 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:29,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash 605331795, now seen corresponding path program 1 times [2019-10-15 01:11:29,423 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:29,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061174878] [2019-10-15 01:11:29,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:29,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:29,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:29,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061174878] [2019-10-15 01:11:29,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:29,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:11:29,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128428238] [2019-10-15 01:11:29,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:11:29,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:11:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:29,783 INFO L87 Difference]: Start difference. First operand 621 states and 957 transitions. Second operand 12 states. [2019-10-15 01:11:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:30,031 INFO L93 Difference]: Finished difference Result 1185 states and 1852 transitions. [2019-10-15 01:11:30,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:11:30,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-10-15 01:11:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:30,037 INFO L225 Difference]: With dead ends: 1185 [2019-10-15 01:11:30,037 INFO L226 Difference]: Without dead ends: 621 [2019-10-15 01:11:30,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:11:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-15 01:11:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-15 01:11:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-15 01:11:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 956 transitions. [2019-10-15 01:11:30,064 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 956 transitions. Word has length 148 [2019-10-15 01:11:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:30,065 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 956 transitions. [2019-10-15 01:11:30,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:11:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 956 transitions. [2019-10-15 01:11:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:11:30,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:30,070 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:30,070 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash 974783101, now seen corresponding path program 1 times [2019-10-15 01:11:30,070 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:30,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921528694] [2019-10-15 01:11:30,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:30,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:30,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:11:30,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921528694] [2019-10-15 01:11:30,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430982040] [2019-10-15 01:11:30,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:30,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:30,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:30,919 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:31,308 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:31,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:31,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294940742] [2019-10-15 01:11:31,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:31,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:31,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:31,310 INFO L87 Difference]: Start difference. First operand 621 states and 956 transitions. Second operand 3 states. [2019-10-15 01:11:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:31,385 INFO L93 Difference]: Finished difference Result 1722 states and 2729 transitions. [2019-10-15 01:11:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:31,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-15 01:11:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:31,398 INFO L225 Difference]: With dead ends: 1722 [2019-10-15 01:11:31,398 INFO L226 Difference]: Without dead ends: 1167 [2019-10-15 01:11:31,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-10-15 01:11:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1165. [2019-10-15 01:11:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-10-15 01:11:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1838 transitions. [2019-10-15 01:11:31,454 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1838 transitions. Word has length 149 [2019-10-15 01:11:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:31,456 INFO L462 AbstractCegarLoop]: Abstraction has 1165 states and 1838 transitions. [2019-10-15 01:11:31,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1838 transitions. [2019-10-15 01:11:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:11:31,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:31,461 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:31,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:31,679 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash 152192341, now seen corresponding path program 1 times [2019-10-15 01:11:31,680 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:31,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464021813] [2019-10-15 01:11:31,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:31,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:31,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:11:31,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464021813] [2019-10-15 01:11:31,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622110802] [2019-10-15 01:11:31,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:32,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 2796 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:32,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:32,525 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:32,891 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:32,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:32,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624851558] [2019-10-15 01:11:32,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:32,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:32,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:32,894 INFO L87 Difference]: Start difference. First operand 1165 states and 1838 transitions. Second operand 3 states. [2019-10-15 01:11:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:32,990 INFO L93 Difference]: Finished difference Result 3356 states and 5400 transitions. [2019-10-15 01:11:32,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:32,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:11:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:33,010 INFO L225 Difference]: With dead ends: 3356 [2019-10-15 01:11:33,010 INFO L226 Difference]: Without dead ends: 2257 [2019-10-15 01:11:33,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2019-10-15 01:11:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2254. [2019-10-15 01:11:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-10-15 01:11:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3620 transitions. [2019-10-15 01:11:33,124 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3620 transitions. Word has length 150 [2019-10-15 01:11:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:33,124 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 3620 transitions. [2019-10-15 01:11:33,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3620 transitions. [2019-10-15 01:11:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:11:33,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:33,130 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:33,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:33,340 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:33,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:33,340 INFO L82 PathProgramCache]: Analyzing trace with hash 421686463, now seen corresponding path program 1 times [2019-10-15 01:11:33,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:33,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987995658] [2019-10-15 01:11:33,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:33,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:33,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:11:33,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987995658] [2019-10-15 01:11:33,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169066830] [2019-10-15 01:11:33,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:34,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:34,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:34,192 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:34,449 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:34,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:34,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130794453] [2019-10-15 01:11:34,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:34,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:34,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:34,451 INFO L87 Difference]: Start difference. First operand 2254 states and 3620 transitions. Second operand 3 states. [2019-10-15 01:11:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:34,639 INFO L93 Difference]: Finished difference Result 6625 states and 10817 transitions. [2019-10-15 01:11:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:34,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-15 01:11:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:34,673 INFO L225 Difference]: With dead ends: 6625 [2019-10-15 01:11:34,674 INFO L226 Difference]: Without dead ends: 4437 [2019-10-15 01:11:34,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2019-10-15 01:11:34,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 4433. [2019-10-15 01:11:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4433 states. [2019-10-15 01:11:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 7234 transitions. [2019-10-15 01:11:34,858 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 7234 transitions. Word has length 151 [2019-10-15 01:11:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:34,859 INFO L462 AbstractCegarLoop]: Abstraction has 4433 states and 7234 transitions. [2019-10-15 01:11:34,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 7234 transitions. [2019-10-15 01:11:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:11:34,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:34,864 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:35,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:35,073 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash 186073559, now seen corresponding path program 1 times [2019-10-15 01:11:35,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:35,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623745413] [2019-10-15 01:11:35,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:35,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:35,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:11:35,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623745413] [2019-10-15 01:11:35,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117176229] [2019-10-15 01:11:35,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:35,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 2800 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:35,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:35,863 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:36,130 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:36,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:36,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107200515] [2019-10-15 01:11:36,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:36,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:36,132 INFO L87 Difference]: Start difference. First operand 4433 states and 7234 transitions. Second operand 3 states. [2019-10-15 01:11:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:36,486 INFO L93 Difference]: Finished difference Result 13164 states and 21888 transitions. [2019-10-15 01:11:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:36,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-15 01:11:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:36,547 INFO L225 Difference]: With dead ends: 13164 [2019-10-15 01:11:36,548 INFO L226 Difference]: Without dead ends: 8797 [2019-10-15 01:11:36,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8797 states. [2019-10-15 01:11:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8797 to 8792. [2019-10-15 01:11:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8792 states. [2019-10-15 01:11:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8792 states to 8792 states and 14620 transitions. [2019-10-15 01:11:36,930 INFO L78 Accepts]: Start accepts. Automaton has 8792 states and 14620 transitions. Word has length 152 [2019-10-15 01:11:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:36,931 INFO L462 AbstractCegarLoop]: Abstraction has 8792 states and 14620 transitions. [2019-10-15 01:11:36,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8792 states and 14620 transitions. [2019-10-15 01:11:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:11:36,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:36,937 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:37,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:37,153 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1472012033, now seen corresponding path program 1 times [2019-10-15 01:11:37,153 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:37,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572633042] [2019-10-15 01:11:37,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:37,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:11:37,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572633042] [2019-10-15 01:11:37,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416106195] [2019-10-15 01:11:37,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:37,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:11:37,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:38,027 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:11:38,284 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:11:38,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-15 01:11:38,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750099249] [2019-10-15 01:11:38,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:11:38,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:38,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:11:38,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:38,286 INFO L87 Difference]: Start difference. First operand 8792 states and 14620 transitions. Second operand 3 states. [2019-10-15 01:11:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:38,805 INFO L93 Difference]: Finished difference Result 26243 states and 44842 transitions. [2019-10-15 01:11:38,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:11:38,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:11:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:38,947 INFO L225 Difference]: With dead ends: 26243 [2019-10-15 01:11:38,947 INFO L226 Difference]: Without dead ends: 17507 [2019-10-15 01:11:38,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17507 states. [2019-10-15 01:11:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17507 to 17501. [2019-10-15 01:11:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17501 states. [2019-10-15 01:11:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17501 states to 17501 states and 29917 transitions. [2019-10-15 01:11:39,687 INFO L78 Accepts]: Start accepts. Automaton has 17501 states and 29917 transitions. Word has length 153 [2019-10-15 01:11:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:39,688 INFO L462 AbstractCegarLoop]: Abstraction has 17501 states and 29917 transitions. [2019-10-15 01:11:39,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:11:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17501 states and 29917 transitions. [2019-10-15 01:11:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-15 01:11:39,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:39,708 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:39,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:39,917 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2008734151, now seen corresponding path program 1 times [2019-10-15 01:11:39,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:39,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098071805] [2019-10-15 01:11:39,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:39,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:39,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-15 01:11:40,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098071805] [2019-10-15 01:11:40,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:40,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:40,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590050388] [2019-10-15 01:11:40,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:40,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:40,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:40,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:40,889 INFO L87 Difference]: Start difference. First operand 17501 states and 29917 transitions. Second operand 6 states. [2019-10-15 01:11:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:42,154 INFO L93 Difference]: Finished difference Result 35064 states and 61812 transitions. [2019-10-15 01:11:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:42,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 234 [2019-10-15 01:11:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:42,297 INFO L225 Difference]: With dead ends: 35064 [2019-10-15 01:11:42,297 INFO L226 Difference]: Without dead ends: 17629 [2019-10-15 01:11:42,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17629 states. [2019-10-15 01:11:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17629 to 17629. [2019-10-15 01:11:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17629 states. [2019-10-15 01:11:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17629 states to 17629 states and 30045 transitions. [2019-10-15 01:11:43,258 INFO L78 Accepts]: Start accepts. Automaton has 17629 states and 30045 transitions. Word has length 234 [2019-10-15 01:11:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:43,259 INFO L462 AbstractCegarLoop]: Abstraction has 17629 states and 30045 transitions. [2019-10-15 01:11:43,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17629 states and 30045 transitions. [2019-10-15 01:11:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-15 01:11:43,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:43,281 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:43,281 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1750386929, now seen corresponding path program 1 times [2019-10-15 01:11:43,282 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:43,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686306607] [2019-10-15 01:11:43,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:43,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:43,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-15 01:11:43,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686306607] [2019-10-15 01:11:43,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:43,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:43,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811406666] [2019-10-15 01:11:43,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:43,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:43,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:43,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:43,463 INFO L87 Difference]: Start difference. First operand 17629 states and 30045 transitions. Second operand 6 states. [2019-10-15 01:11:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:44,640 INFO L93 Difference]: Finished difference Result 35352 states and 62036 transitions. [2019-10-15 01:11:44,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:44,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 235 [2019-10-15 01:11:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:44,777 INFO L225 Difference]: With dead ends: 35352 [2019-10-15 01:11:44,777 INFO L226 Difference]: Without dead ends: 17789 [2019-10-15 01:11:44,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17789 states. [2019-10-15 01:11:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17789 to 17789. [2019-10-15 01:11:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17789 states. [2019-10-15 01:11:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17789 states to 17789 states and 30205 transitions. [2019-10-15 01:11:45,690 INFO L78 Accepts]: Start accepts. Automaton has 17789 states and 30205 transitions. Word has length 235 [2019-10-15 01:11:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:45,691 INFO L462 AbstractCegarLoop]: Abstraction has 17789 states and 30205 transitions. [2019-10-15 01:11:45,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17789 states and 30205 transitions. [2019-10-15 01:11:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-15 01:11:45,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:45,712 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:45,712 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2018030558, now seen corresponding path program 1 times [2019-10-15 01:11:45,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:45,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586700704] [2019-10-15 01:11:45,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:45,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:45,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-15 01:11:45,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586700704] [2019-10-15 01:11:45,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505145583] [2019-10-15 01:11:45,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:46,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 4061 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:11:46,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-10-15 01:11:47,336 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:47,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:48,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:48,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:48,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-10-15 01:11:48,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1489447941] [2019-10-15 01:11:48,431 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 344 [2019-10-15 01:11:48,504 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:11:48,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:11:48,636 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:11:48,637 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 193 root evaluator evaluations with a maximum evaluation depth of 0. Performed 193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 264 variables. [2019-10-15 01:11:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:48,642 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:11:48,796 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-15 01:11:48,797 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:11:48,806 INFO L553 sIntCurrentIteration]: We unified 342 AI predicates to 342 [2019-10-15 01:11:48,806 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:11:48,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:11:48,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 7, 6] total 12 [2019-10-15 01:11:48,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284872560] [2019-10-15 01:11:48,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:11:48,810 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:48,810 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:11:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:11:48,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:11:48,810 INFO L87 Difference]: Start difference. First operand 17789 states and 30205 transitions. Second operand 2 states. [2019-10-15 01:11:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:49,051 INFO L93 Difference]: Finished difference Result 17789 states and 30205 transitions. [2019-10-15 01:11:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:11:49,051 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 343 [2019-10-15 01:11:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:49,052 INFO L225 Difference]: With dead ends: 17789 [2019-10-15 01:11:49,052 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:11:49,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:11:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:11:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:11:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:11:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:11:49,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 343 [2019-10-15 01:11:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:49,159 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:11:49,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:11:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:11:49,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:11:49,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:49,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.