java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:00,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:00,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:00,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:00,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:00,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:00,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:00,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:00,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:00,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:00,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:00,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:00,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:00,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:00,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:00,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:00,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:00,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:00,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:00,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:00,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:00,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:00,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:00,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:00,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:00,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:00,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:00,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:00,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:00,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:00,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:00,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:00,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:00,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:00,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:00,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:00,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:00,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:00,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:00,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:00,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:00,093 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:10:00,114 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:00,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:00,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:00,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:00,117 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:00,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:00,117 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:00,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:00,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:00,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:00,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:00,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:00,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:00,120 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:00,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:00,120 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:00,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:00,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:00,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:00,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:00,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:00,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:00,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:00,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:00,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:00,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:00,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:00,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:00,123 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:10:00,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:00,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:00,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:00,434 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:00,435 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:00,435 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-10-15 01:10:00,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980a7f54e/e70b0d655ce3468590c315c450f45cd4/FLAGf13184ad1 [2019-10-15 01:10:01,179 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:01,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-10-15 01:10:01,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980a7f54e/e70b0d655ce3468590c315c450f45cd4/FLAGf13184ad1 [2019-10-15 01:10:01,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980a7f54e/e70b0d655ce3468590c315c450f45cd4 [2019-10-15 01:10:01,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:01,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:01,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:01,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:01,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:01,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff5b5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01, skipping insertion in model container [2019-10-15 01:10:01,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:01,496 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:02,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:02,341 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:02,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:02,545 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:02,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02 WrapperNode [2019-10-15 01:10:02,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:02,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:02,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:02,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:02,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (1/1) ... [2019-10-15 01:10:02,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (1/1) ... [2019-10-15 01:10:02,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (1/1) ... [2019-10-15 01:10:02,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (1/1) ... [2019-10-15 01:10:02,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (1/1) ... [2019-10-15 01:10:02,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (1/1) ... [2019-10-15 01:10:02,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (1/1) ... [2019-10-15 01:10:02,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:02,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:02,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:02,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:02,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (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:10:02,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:02,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:02,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:02,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:02,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:02,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:02,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:02,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:02,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:02,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:02,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:02,847 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:02,847 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:02,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:02,847 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:02,848 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:02,848 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:02,848 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:02,848 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:02,848 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:02,850 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:02,850 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:02,850 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:02,850 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:10:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:10:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:10:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:10:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:02,854 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:02,854 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:02,854 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:02,854 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:02,854 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:02,854 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:02,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:02,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:02,860 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:02,860 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:02,861 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:02,861 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:02,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:02,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:02,867 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:02,867 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:02,867 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:02,867 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:02,867 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:02,867 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:02,868 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:02,868 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:02,868 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:02,868 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:02,868 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:02,869 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:02,869 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:02,869 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:02,869 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:02,869 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:02,869 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:02,870 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:02,870 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:02,870 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:02,870 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:02,872 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:02,872 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:02,874 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:02,874 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:02,875 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:02,875 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:02,875 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:02,875 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:02,875 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:10:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:10:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:02,881 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:02,882 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:10:02,883 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:02,884 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:10:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:02,893 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:05,575 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:05,575 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:05,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:05 BoogieIcfgContainer [2019-10-15 01:10:05,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:05,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:05,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:05,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:05,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:01" (1/3) ... [2019-10-15 01:10:05,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770d8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:05, skipping insertion in model container [2019-10-15 01:10:05,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:02" (2/3) ... [2019-10-15 01:10:05,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770d8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:05, skipping insertion in model container [2019-10-15 01:10:05,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:05" (3/3) ... [2019-10-15 01:10:05,588 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product27.cil.c [2019-10-15 01:10:05,598 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:05,608 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:05,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:05,661 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:05,661 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:05,661 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:05,662 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:05,662 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:05,662 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:05,662 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:05,662 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states. [2019-10-15 01:10:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:10:05,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,731 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:05,733 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1054134663, now seen corresponding path program 1 times [2019-10-15 01:10:05,749 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557342738] [2019-10-15 01:10:05,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:06,444 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:10:06,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557342738] [2019-10-15 01:10:06,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:06,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:06,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674209963] [2019-10-15 01:10:06,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:06,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:06,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:06,474 INFO L87 Difference]: Start difference. First operand 786 states. Second operand 4 states. [2019-10-15 01:10:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:06,717 INFO L93 Difference]: Finished difference Result 1235 states and 1989 transitions. [2019-10-15 01:10:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:06,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-15 01:10:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:06,760 INFO L225 Difference]: With dead ends: 1235 [2019-10-15 01:10:06,761 INFO L226 Difference]: Without dead ends: 626 [2019-10-15 01:10:06,775 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:10:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-15 01:10:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-15 01:10:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-15 01:10:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 996 transitions. [2019-10-15 01:10:06,898 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 996 transitions. Word has length 133 [2019-10-15 01:10:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:06,898 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 996 transitions. [2019-10-15 01:10:06,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 996 transitions. [2019-10-15 01:10:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:10:06,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:06,915 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:06,915 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:06,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:06,916 INFO L82 PathProgramCache]: Analyzing trace with hash 545110777, now seen corresponding path program 1 times [2019-10-15 01:10:06,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:06,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76126499] [2019-10-15 01:10:06,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,126 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:10:07,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76126499] [2019-10-15 01:10:07,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:07,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665690218] [2019-10-15 01:10:07,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:07,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:07,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:07,147 INFO L87 Difference]: Start difference. First operand 626 states and 996 transitions. Second operand 4 states. [2019-10-15 01:10:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,283 INFO L93 Difference]: Finished difference Result 1215 states and 1950 transitions. [2019-10-15 01:10:07,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:07,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-15 01:10:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,296 INFO L225 Difference]: With dead ends: 1215 [2019-10-15 01:10:07,296 INFO L226 Difference]: Without dead ends: 626 [2019-10-15 01:10:07,300 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:10:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-15 01:10:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-15 01:10:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-15 01:10:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 995 transitions. [2019-10-15 01:10:07,349 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 995 transitions. Word has length 136 [2019-10-15 01:10:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,349 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 995 transitions. [2019-10-15 01:10:07,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 995 transitions. [2019-10-15 01:10:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:10:07,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,358 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:07,358 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1596840266, now seen corresponding path program 1 times [2019-10-15 01:10:07,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534045109] [2019-10-15 01:10:07,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,536 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:10:07,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534045109] [2019-10-15 01:10:07,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:07,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530726292] [2019-10-15 01:10:07,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:07,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:07,541 INFO L87 Difference]: Start difference. First operand 626 states and 995 transitions. Second operand 4 states. [2019-10-15 01:10:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,619 INFO L93 Difference]: Finished difference Result 1215 states and 1949 transitions. [2019-10-15 01:10:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:07,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 01:10:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,625 INFO L225 Difference]: With dead ends: 1215 [2019-10-15 01:10:07,626 INFO L226 Difference]: Without dead ends: 626 [2019-10-15 01:10:07,629 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:10:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-15 01:10:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-15 01:10:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-15 01:10:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-10-15 01:10:07,658 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 137 [2019-10-15 01:10:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,659 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-10-15 01:10:07,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-10-15 01:10:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:10:07,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,666 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:10:07,666 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -794225131, now seen corresponding path program 1 times [2019-10-15 01:10:07,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997701999] [2019-10-15 01:10:07,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,822 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:10:07,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997701999] [2019-10-15 01:10:07,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:07,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972541151] [2019-10-15 01:10:07,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:07,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:07,825 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 4 states. [2019-10-15 01:10:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,893 INFO L93 Difference]: Finished difference Result 1215 states and 1948 transitions. [2019-10-15 01:10:07,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:07,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:10:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,899 INFO L225 Difference]: With dead ends: 1215 [2019-10-15 01:10:07,900 INFO L226 Difference]: Without dead ends: 626 [2019-10-15 01:10:07,903 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:10:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-15 01:10:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-15 01:10:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-15 01:10:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-10-15 01:10:07,936 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 138 [2019-10-15 01:10:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,938 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-10-15 01:10:07,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-10-15 01:10:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:10:07,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,944 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:10:07,945 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1095628306, now seen corresponding path program 1 times [2019-10-15 01:10:07,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925573497] [2019-10-15 01:10:07,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,196 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:10:08,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925573497] [2019-10-15 01:10:08,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:08,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831486679] [2019-10-15 01:10:08,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:08,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:08,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:08,199 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 4 states. [2019-10-15 01:10:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,272 INFO L93 Difference]: Finished difference Result 1215 states and 1947 transitions. [2019-10-15 01:10:08,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:08,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:10:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:08,279 INFO L225 Difference]: With dead ends: 1215 [2019-10-15 01:10:08,279 INFO L226 Difference]: Without dead ends: 626 [2019-10-15 01:10:08,284 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:10:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-15 01:10:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-15 01:10:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-15 01:10:08,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-10-15 01:10:08,314 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 139 [2019-10-15 01:10:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:08,315 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-10-15 01:10:08,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-10-15 01:10:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:10:08,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,321 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:10:08,322 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1964836559, now seen corresponding path program 1 times [2019-10-15 01:10:08,322 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517224920] [2019-10-15 01:10:08,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,548 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:10:08,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517224920] [2019-10-15 01:10:08,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:10:08,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955959858] [2019-10-15 01:10:08,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:10:08,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:10:08,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:08,551 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 10 states. [2019-10-15 01:10:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,729 INFO L93 Difference]: Finished difference Result 1173 states and 1867 transitions. [2019-10-15 01:10:08,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:08,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-15 01:10:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:08,735 INFO L225 Difference]: With dead ends: 1173 [2019-10-15 01:10:08,735 INFO L226 Difference]: Without dead ends: 635 [2019-10-15 01:10:08,739 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:10:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-15 01:10:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-10-15 01:10:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-15 01:10:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1001 transitions. [2019-10-15 01:10:08,776 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1001 transitions. Word has length 140 [2019-10-15 01:10:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:08,779 INFO L462 AbstractCegarLoop]: Abstraction has 633 states and 1001 transitions. [2019-10-15 01:10:08,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:10:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1001 transitions. [2019-10-15 01:10:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:10:08,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,788 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:08,788 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1270189552, now seen corresponding path program 1 times [2019-10-15 01:10:08,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716047897] [2019-10-15 01:10:08,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,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:10:08,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716047897] [2019-10-15 01:10:08,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:08,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370984311] [2019-10-15 01:10:08,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:08,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:08,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:08,992 INFO L87 Difference]: Start difference. First operand 633 states and 1001 transitions. Second operand 4 states. [2019-10-15 01:10:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:09,055 INFO L93 Difference]: Finished difference Result 1221 states and 1953 transitions. [2019-10-15 01:10:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:09,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:10:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:09,062 INFO L225 Difference]: With dead ends: 1221 [2019-10-15 01:10:09,062 INFO L226 Difference]: Without dead ends: 620 [2019-10-15 01:10:09,065 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:10:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-15 01:10:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-15 01:10:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 01:10:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 978 transitions. [2019-10-15 01:10:09,091 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 978 transitions. Word has length 140 [2019-10-15 01:10:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:09,092 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 978 transitions. [2019-10-15 01:10:09,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 978 transitions. [2019-10-15 01:10:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:10:09,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:09,099 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:10:09,099 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -730531008, now seen corresponding path program 1 times [2019-10-15 01:10:09,100 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:09,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664837752] [2019-10-15 01:10:09,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:09,281 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:10:09,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664837752] [2019-10-15 01:10:09,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:09,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:09,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136866076] [2019-10-15 01:10:09,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:09,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:09,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:09,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:09,283 INFO L87 Difference]: Start difference. First operand 620 states and 978 transitions. Second operand 6 states. [2019-10-15 01:10:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:09,512 INFO L93 Difference]: Finished difference Result 1161 states and 1845 transitions. [2019-10-15 01:10:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:09,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:10:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:09,517 INFO L225 Difference]: With dead ends: 1161 [2019-10-15 01:10:09,518 INFO L226 Difference]: Without dead ends: 620 [2019-10-15 01:10:09,521 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:10:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-15 01:10:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-15 01:10:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 01:10:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 974 transitions. [2019-10-15 01:10:09,546 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 974 transitions. Word has length 141 [2019-10-15 01:10:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:09,546 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 974 transitions. [2019-10-15 01:10:09,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 974 transitions. [2019-10-15 01:10:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:10:09,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:09,551 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:10:09,552 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1761880204, now seen corresponding path program 1 times [2019-10-15 01:10:09,552 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:09,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161219282] [2019-10-15 01:10:09,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,553 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:09,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:09,746 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:10:09,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161219282] [2019-10-15 01:10:09,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:09,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:09,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950622414] [2019-10-15 01:10:09,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:09,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:09,748 INFO L87 Difference]: Start difference. First operand 620 states and 974 transitions. Second operand 6 states. [2019-10-15 01:10:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,020 INFO L93 Difference]: Finished difference Result 1161 states and 1841 transitions. [2019-10-15 01:10:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:10,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-15 01:10:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,027 INFO L225 Difference]: With dead ends: 1161 [2019-10-15 01:10:10,027 INFO L226 Difference]: Without dead ends: 620 [2019-10-15 01:10:10,032 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:10:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-15 01:10:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-15 01:10:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 01:10:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 970 transitions. [2019-10-15 01:10:10,070 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 970 transitions. Word has length 142 [2019-10-15 01:10:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,071 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 970 transitions. [2019-10-15 01:10:10,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 970 transitions. [2019-10-15 01:10:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:10:10,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,078 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:10:10,078 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash 333743557, now seen corresponding path program 1 times [2019-10-15 01:10:10,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625602608] [2019-10-15 01:10:10,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,282 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:10:10,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625602608] [2019-10-15 01:10:10,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:10,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720396495] [2019-10-15 01:10:10,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:10,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:10,287 INFO L87 Difference]: Start difference. First operand 620 states and 970 transitions. Second operand 6 states. [2019-10-15 01:10:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,536 INFO L93 Difference]: Finished difference Result 1161 states and 1837 transitions. [2019-10-15 01:10:10,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:10,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:10:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,544 INFO L225 Difference]: With dead ends: 1161 [2019-10-15 01:10:10,544 INFO L226 Difference]: Without dead ends: 620 [2019-10-15 01:10:10,547 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:10:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-15 01:10:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-15 01:10:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-15 01:10:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 966 transitions. [2019-10-15 01:10:10,573 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 966 transitions. Word has length 143 [2019-10-15 01:10:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,573 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 966 transitions. [2019-10-15 01:10:10,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 966 transitions. [2019-10-15 01:10:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:10:10,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,579 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:10:10,580 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1388216901, now seen corresponding path program 1 times [2019-10-15 01:10:10,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192371227] [2019-10-15 01:10:10,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,735 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:10:10,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192371227] [2019-10-15 01:10:10,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:10,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716075226] [2019-10-15 01:10:10,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:10,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:10,737 INFO L87 Difference]: Start difference. First operand 620 states and 966 transitions. Second operand 7 states. [2019-10-15 01:10:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,870 INFO L93 Difference]: Finished difference Result 1161 states and 1833 transitions. [2019-10-15 01:10:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:10,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:10:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,876 INFO L225 Difference]: With dead ends: 1161 [2019-10-15 01:10:10,876 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:10:10,880 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:10:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:10:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:10:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:10:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 932 transitions. [2019-10-15 01:10:10,902 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 932 transitions. Word has length 143 [2019-10-15 01:10:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,903 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 932 transitions. [2019-10-15 01:10:10,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2019-10-15 01:10:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:10:10,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,907 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:10:10,907 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 581281177, now seen corresponding path program 1 times [2019-10-15 01:10:10,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040916482] [2019-10-15 01:10:10,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,075 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:10:11,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040916482] [2019-10-15 01:10:11,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:11,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086494846] [2019-10-15 01:10:11,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:11,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:11,078 INFO L87 Difference]: Start difference. First operand 599 states and 932 transitions. Second operand 6 states. [2019-10-15 01:10:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,214 INFO L93 Difference]: Finished difference Result 1140 states and 1799 transitions. [2019-10-15 01:10:11,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:11,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:10:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,222 INFO L225 Difference]: With dead ends: 1140 [2019-10-15 01:10:11,222 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:10:11,226 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:10:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:10:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:10:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:10:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 931 transitions. [2019-10-15 01:10:11,252 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 931 transitions. Word has length 144 [2019-10-15 01:10:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,253 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 931 transitions. [2019-10-15 01:10:11,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 931 transitions. [2019-10-15 01:10:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:10:11,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,258 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:10:11,258 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash -627276726, now seen corresponding path program 1 times [2019-10-15 01:10:11,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:11,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552745755] [2019-10-15 01:10:11,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,394 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:10:11,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552745755] [2019-10-15 01:10:11,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:11,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453358954] [2019-10-15 01:10:11,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:11,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:11,397 INFO L87 Difference]: Start difference. First operand 599 states and 931 transitions. Second operand 6 states. [2019-10-15 01:10:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,496 INFO L93 Difference]: Finished difference Result 1140 states and 1798 transitions. [2019-10-15 01:10:11,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:11,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:10:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,501 INFO L225 Difference]: With dead ends: 1140 [2019-10-15 01:10:11,502 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:10:11,505 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:10:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:10:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:10:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:10:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 930 transitions. [2019-10-15 01:10:11,529 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 930 transitions. Word has length 145 [2019-10-15 01:10:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,529 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 930 transitions. [2019-10-15 01:10:11,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 930 transitions. [2019-10-15 01:10:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:10:11,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,535 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:10:11,535 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 269844414, now seen corresponding path program 1 times [2019-10-15 01:10:11,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:11,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069687683] [2019-10-15 01:10:11,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:11,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069687683] [2019-10-15 01:10:11,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:10:11,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626414621] [2019-10-15 01:10:11,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:10:11,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:10:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:11,740 INFO L87 Difference]: Start difference. First operand 599 states and 930 transitions. Second operand 12 states. [2019-10-15 01:10:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,939 INFO L93 Difference]: Finished difference Result 1141 states and 1797 transitions. [2019-10-15 01:10:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:10:11,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-15 01:10:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,945 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:10:11,945 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 01:10:11,948 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:10:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 01:10:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-15 01:10:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 01:10:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 929 transitions. [2019-10-15 01:10:11,969 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 929 transitions. Word has length 146 [2019-10-15 01:10:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,970 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 929 transitions. [2019-10-15 01:10:11,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:10:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 929 transitions. [2019-10-15 01:10:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:10:11,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,975 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:10:11,975 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:11,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1889822343, now seen corresponding path program 1 times [2019-10-15 01:10:11,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:11,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094419808] [2019-10-15 01:10:11,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,154 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:10:12,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094419808] [2019-10-15 01:10:12,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742640714] [2019-10-15 01:10:12,155 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:10:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:12,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:12,832 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:13,741 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:10:13,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:13,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:10:13,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456199049] [2019-10-15 01:10:13,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:13,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:13,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:13,745 INFO L87 Difference]: Start difference. First operand 599 states and 929 transitions. Second operand 5 states. [2019-10-15 01:10:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:14,839 INFO L93 Difference]: Finished difference Result 1140 states and 1822 transitions. [2019-10-15 01:10:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:14,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:10:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:14,845 INFO L225 Difference]: With dead ends: 1140 [2019-10-15 01:10:14,846 INFO L226 Difference]: Without dead ends: 607 [2019-10-15 01:10:14,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-15 01:10:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-15 01:10:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-15 01:10:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 942 transitions. [2019-10-15 01:10:14,895 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 942 transitions. Word has length 147 [2019-10-15 01:10:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:14,896 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 942 transitions. [2019-10-15 01:10:14,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 942 transitions. [2019-10-15 01:10:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:10:14,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:14,901 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:15,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:15,105 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2076963317, now seen corresponding path program 1 times [2019-10-15 01:10:15,108 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:15,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587745457] [2019-10-15 01:10:15,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:15,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587745457] [2019-10-15 01:10:15,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312103899] [2019-10-15 01:10:15,392 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:10:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 2773 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:16,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:16,143 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:16,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:16,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:10:16,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890061041] [2019-10-15 01:10:16,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:16,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:16,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:16,816 INFO L87 Difference]: Start difference. First operand 607 states and 942 transitions. Second operand 5 states. [2019-10-15 01:10:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:17,886 INFO L93 Difference]: Finished difference Result 1156 states and 1845 transitions. [2019-10-15 01:10:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:17,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-15 01:10:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:17,895 INFO L225 Difference]: With dead ends: 1156 [2019-10-15 01:10:17,895 INFO L226 Difference]: Without dead ends: 615 [2019-10-15 01:10:17,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 285 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-15 01:10:17,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-10-15 01:10:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-15 01:10:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 955 transitions. [2019-10-15 01:10:17,931 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 955 transitions. Word has length 149 [2019-10-15 01:10:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:17,931 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 955 transitions. [2019-10-15 01:10:17,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 955 transitions. [2019-10-15 01:10:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:10:17,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:17,938 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:18,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:18,159 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1312607033, now seen corresponding path program 1 times [2019-10-15 01:10:18,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:18,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376053030] [2019-10-15 01:10:18,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:18,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:18,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:18,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376053030] [2019-10-15 01:10:18,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366192826] [2019-10-15 01:10:18,331 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:10:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:18,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:18,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:19,015 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:19,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:19,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:10:19,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319428202] [2019-10-15 01:10:19,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:19,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:19,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:19,784 INFO L87 Difference]: Start difference. First operand 615 states and 955 transitions. Second operand 5 states. [2019-10-15 01:10:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:20,666 INFO L93 Difference]: Finished difference Result 1172 states and 1868 transitions. [2019-10-15 01:10:20,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:20,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-15 01:10:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:20,672 INFO L225 Difference]: With dead ends: 1172 [2019-10-15 01:10:20,672 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 01:10:20,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 289 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 01:10:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-15 01:10:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-15 01:10:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 968 transitions. [2019-10-15 01:10:20,697 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 968 transitions. Word has length 151 [2019-10-15 01:10:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:20,698 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 968 transitions. [2019-10-15 01:10:20,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 968 transitions. [2019-10-15 01:10:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:10:20,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:20,702 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:20,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:20,913 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:20,914 INFO L82 PathProgramCache]: Analyzing trace with hash -941872595, now seen corresponding path program 1 times [2019-10-15 01:10:20,914 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:20,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666790110] [2019-10-15 01:10:20,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:20,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:20,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:21,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666790110] [2019-10-15 01:10:21,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410275341] [2019-10-15 01:10:21,081 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:10:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:21,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:21,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:21,700 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:22,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:22,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2019-10-15 01:10:22,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724892433] [2019-10-15 01:10:22,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:22,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:22,409 INFO L87 Difference]: Start difference. First operand 623 states and 968 transitions. Second operand 5 states. [2019-10-15 01:10:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:23,262 INFO L93 Difference]: Finished difference Result 1188 states and 1891 transitions. [2019-10-15 01:10:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:23,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:10:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:23,268 INFO L225 Difference]: With dead ends: 1188 [2019-10-15 01:10:23,268 INFO L226 Difference]: Without dead ends: 631 [2019-10-15 01:10:23,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-15 01:10:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-15 01:10:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-15 01:10:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 981 transitions. [2019-10-15 01:10:23,294 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 981 transitions. Word has length 153 [2019-10-15 01:10:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:23,294 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 981 transitions. [2019-10-15 01:10:23,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 981 transitions. [2019-10-15 01:10:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:10:23,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:23,299 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:23,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:23,506 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash 807721721, now seen corresponding path program 1 times [2019-10-15 01:10:23,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:23,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198040750] [2019-10-15 01:10:23,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:23,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:23,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:23,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198040750] [2019-10-15 01:10:23,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987921671] [2019-10-15 01:10:23,726 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:10:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:24,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:24,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:24,649 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:25,027 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:25,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-15 01:10:25,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608998541] [2019-10-15 01:10:25,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:25,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:25,035 INFO L87 Difference]: Start difference. First operand 631 states and 981 transitions. Second operand 9 states. [2019-10-15 01:10:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:26,544 INFO L93 Difference]: Finished difference Result 676 states and 1041 transitions. [2019-10-15 01:10:26,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:26,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-15 01:10:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:26,552 INFO L225 Difference]: With dead ends: 676 [2019-10-15 01:10:26,553 INFO L226 Difference]: Without dead ends: 659 [2019-10-15 01:10:26,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:10:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-15 01:10:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 645. [2019-10-15 01:10:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-15 01:10:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1000 transitions. [2019-10-15 01:10:26,578 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1000 transitions. Word has length 155 [2019-10-15 01:10:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:26,580 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 1000 transitions. [2019-10-15 01:10:26,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1000 transitions. [2019-10-15 01:10:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:10:26,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:26,585 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:26,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:26,791 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash -208367116, now seen corresponding path program 1 times [2019-10-15 01:10:26,792 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:26,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784411514] [2019-10-15 01:10:26,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:26,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:26,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:26,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784411514] [2019-10-15 01:10:26,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581637122] [2019-10-15 01:10:26,994 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:10:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:27,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:10:27,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:27,812 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:28,102 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:28,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-15 01:10:28,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168465404] [2019-10-15 01:10:28,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:28,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:28,104 INFO L87 Difference]: Start difference. First operand 645 states and 1000 transitions. Second operand 5 states. [2019-10-15 01:10:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:28,156 INFO L93 Difference]: Finished difference Result 662 states and 1020 transitions. [2019-10-15 01:10:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:28,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-15 01:10:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:28,161 INFO L225 Difference]: With dead ends: 662 [2019-10-15 01:10:28,161 INFO L226 Difference]: Without dead ends: 645 [2019-10-15 01:10:28,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:10:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-15 01:10:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-10-15 01:10:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-15 01:10:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 998 transitions. [2019-10-15 01:10:28,187 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 998 transitions. Word has length 161 [2019-10-15 01:10:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:28,187 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 998 transitions. [2019-10-15 01:10:28,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:28,187 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 998 transitions. [2019-10-15 01:10:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-15 01:10:28,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:28,194 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:28,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:28,403 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash 107103986, now seen corresponding path program 1 times [2019-10-15 01:10:28,405 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:28,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639764514] [2019-10-15 01:10:28,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:28,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:28,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:10:28,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639764514] [2019-10-15 01:10:28,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926786298] [2019-10-15 01:10:28,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:29,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:10:29,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:29,327 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:10:29,827 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:29,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-15 01:10:29,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041782170] [2019-10-15 01:10:29,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:29,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:29,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:29,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:29,829 INFO L87 Difference]: Start difference. First operand 645 states and 998 transitions. Second operand 9 states.