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_spec3_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:32,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:32,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:32,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:32,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:32,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:32,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:32,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:32,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:32,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:32,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:32,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:32,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:32,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:32,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:32,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:32,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:32,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:32,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:32,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:32,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:32,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:32,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:32,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:32,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:32,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:32,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:32,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:32,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:32,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:32,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:32,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:32,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:32,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:32,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:32,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:32,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:32,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:32,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:32,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:32,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:32,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:11:32,111 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:32,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:32,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:32,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:32,113 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:32,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:32,113 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:32,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:32,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:32,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:32,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:32,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:32,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:32,114 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:32,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:32,115 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:32,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:32,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:32,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:32,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:32,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:32,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:32,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:32,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:32,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:32,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:32,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:32,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:32,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:11:32,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:32,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:32,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:32,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:32,428 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:32,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product19.cil.c [2019-10-13 21:11:32,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f406861/22b834a557be410ebe0c14cd2a01faed/FLAGe65725c9a [2019-10-13 21:11:33,163 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:33,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product19.cil.c [2019-10-13 21:11:33,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f406861/22b834a557be410ebe0c14cd2a01faed/FLAGe65725c9a [2019-10-13 21:11:33,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f406861/22b834a557be410ebe0c14cd2a01faed [2019-10-13 21:11:33,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:33,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:33,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:33,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:33,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:33,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:33" (1/1) ... [2019-10-13 21:11:33,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9061149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:33, skipping insertion in model container [2019-10-13 21:11:33,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:33" (1/1) ... [2019-10-13 21:11:33,454 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:33,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:34,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:34,344 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:34,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:34,708 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:34,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34 WrapperNode [2019-10-13 21:11:34,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:34,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:34,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:34,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:34,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... [2019-10-13 21:11:34,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:34,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:34,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:34,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:34,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:35,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:35,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:35,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:35,027 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:35,027 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:35,028 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:35,028 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:35,029 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:35,030 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:35,030 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:35,030 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:35,031 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:35,031 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:35,032 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:35,034 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:35,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:35,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:35,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:35,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:35,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:35,037 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:35,038 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:35,038 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:35,038 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:11:35,038 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:35,038 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:11:35,038 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:35,039 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:35,039 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:35,039 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:35,041 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:11:35,041 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:35,041 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:35,041 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:11:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:35,043 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:35,043 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:35,043 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:35,043 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:35,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:11:35,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:11:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:35,045 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:35,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:35,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:35,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:35,045 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:35,047 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:35,047 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:35,048 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:35,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:35,048 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:35,049 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:35,052 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:11:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:11:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:11:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:11:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:11:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:11:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:37,349 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:37,350 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:37,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:37 BoogieIcfgContainer [2019-10-13 21:11:37,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:37,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:37,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:37,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:37,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:33" (1/3) ... [2019-10-13 21:11:37,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400abeb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:37, skipping insertion in model container [2019-10-13 21:11:37,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:34" (2/3) ... [2019-10-13 21:11:37,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400abeb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:37, skipping insertion in model container [2019-10-13 21:11:37,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:37" (3/3) ... [2019-10-13 21:11:37,361 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product19.cil.c [2019-10-13 21:11:37,372 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:37,384 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:37,397 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:37,449 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:37,450 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:37,450 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:37,450 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:37,450 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:37,450 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:37,451 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:37,451 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states. [2019-10-13 21:11:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:11:37,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:37,528 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] [2019-10-13 21:11:37,530 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash 756079389, now seen corresponding path program 1 times [2019-10-13 21:11:37,547 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:37,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917336545] [2019-10-13 21:11:37,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:38,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917336545] [2019-10-13 21:11:38,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:38,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433864199] [2019-10-13 21:11:38,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:38,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:38,346 INFO L87 Difference]: Start difference. First operand 790 states. Second operand 7 states. [2019-10-13 21:11:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:38,605 INFO L93 Difference]: Finished difference Result 1259 states and 2034 transitions. [2019-10-13 21:11:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:38,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-13 21:11:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:38,635 INFO L225 Difference]: With dead ends: 1259 [2019-10-13 21:11:38,635 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:11:38,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:11:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-13 21:11:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-13 21:11:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1012 transitions. [2019-10-13 21:11:38,772 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1012 transitions. Word has length 141 [2019-10-13 21:11:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:38,773 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1012 transitions. [2019-10-13 21:11:38,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1012 transitions. [2019-10-13 21:11:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:38,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:38,799 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] [2019-10-13 21:11:38,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash -742821217, now seen corresponding path program 1 times [2019-10-13 21:11:38,801 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:38,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601816604] [2019-10-13 21:11:38,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:39,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601816604] [2019-10-13 21:11:39,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:39,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577202771] [2019-10-13 21:11:39,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:39,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:39,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:39,097 INFO L87 Difference]: Start difference. First operand 636 states and 1012 transitions. Second operand 4 states. [2019-10-13 21:11:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,176 INFO L93 Difference]: Finished difference Result 1238 states and 1989 transitions. [2019-10-13 21:11:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:39,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-13 21:11:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,183 INFO L225 Difference]: With dead ends: 1238 [2019-10-13 21:11:39,184 INFO L226 Difference]: Without dead ends: 618 [2019-10-13 21:11:39,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-13 21:11:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-13 21:11:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-13 21:11:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 979 transitions. [2019-10-13 21:11:39,222 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 979 transitions. Word has length 142 [2019-10-13 21:11:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,223 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 979 transitions. [2019-10-13 21:11:39,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 979 transitions. [2019-10-13 21:11:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:39,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,229 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] [2019-10-13 21:11:39,229 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash 841451639, now seen corresponding path program 1 times [2019-10-13 21:11:39,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625080423] [2019-10-13 21:11:39,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:39,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625080423] [2019-10-13 21:11:39,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:39,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495890240] [2019-10-13 21:11:39,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:39,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:39,468 INFO L87 Difference]: Start difference. First operand 618 states and 979 transitions. Second operand 7 states. [2019-10-13 21:11:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,586 INFO L93 Difference]: Finished difference Result 1207 states and 1931 transitions. [2019-10-13 21:11:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:39,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-13 21:11:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,596 INFO L225 Difference]: With dead ends: 1207 [2019-10-13 21:11:39,597 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 21:11:39,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 21:11:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-13 21:11:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 21:11:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 966 transitions. [2019-10-13 21:11:39,648 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 966 transitions. Word has length 142 [2019-10-13 21:11:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,649 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 966 transitions. [2019-10-13 21:11:39,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 966 transitions. [2019-10-13 21:11:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:11:39,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,657 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] [2019-10-13 21:11:39,657 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash 571891073, now seen corresponding path program 1 times [2019-10-13 21:11:39,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097109129] [2019-10-13 21:11:39,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:39,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097109129] [2019-10-13 21:11:39,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:39,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879947852] [2019-10-13 21:11:39,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:39,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:39,960 INFO L87 Difference]: Start difference. First operand 612 states and 966 transitions. Second operand 7 states. [2019-10-13 21:11:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,082 INFO L93 Difference]: Finished difference Result 1195 states and 1905 transitions. [2019-10-13 21:11:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:40,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:11:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,088 INFO L225 Difference]: With dead ends: 1195 [2019-10-13 21:11:40,089 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 21:11:40,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 21:11:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-13 21:11:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-13 21:11:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 953 transitions. [2019-10-13 21:11:40,125 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 953 transitions. Word has length 143 [2019-10-13 21:11:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,125 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 953 transitions. [2019-10-13 21:11:40,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 953 transitions. [2019-10-13 21:11:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:40,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,131 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] [2019-10-13 21:11:40,132 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2110652197, now seen corresponding path program 1 times [2019-10-13 21:11:40,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2886380] [2019-10-13 21:11:40,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:40,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2886380] [2019-10-13 21:11:40,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:40,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666900768] [2019-10-13 21:11:40,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:40,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:40,346 INFO L87 Difference]: Start difference. First operand 606 states and 953 transitions. Second operand 7 states. [2019-10-13 21:11:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,458 INFO L93 Difference]: Finished difference Result 1183 states and 1879 transitions. [2019-10-13 21:11:40,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:40,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,464 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:11:40,464 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:40,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 940 transitions. [2019-10-13 21:11:40,496 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 940 transitions. Word has length 144 [2019-10-13 21:11:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,497 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 940 transitions. [2019-10-13 21:11:40,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 940 transitions. [2019-10-13 21:11:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:40,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,502 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] [2019-10-13 21:11:40,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash 945368284, now seen corresponding path program 1 times [2019-10-13 21:11:40,503 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260959309] [2019-10-13 21:11:40,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:40,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260959309] [2019-10-13 21:11:40,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:40,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814514207] [2019-10-13 21:11:40,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:40,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:40,749 INFO L87 Difference]: Start difference. First operand 600 states and 940 transitions. Second operand 7 states. [2019-10-13 21:11:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,837 INFO L93 Difference]: Finished difference Result 1171 states and 1853 transitions. [2019-10-13 21:11:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:40,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,842 INFO L225 Difference]: With dead ends: 1171 [2019-10-13 21:11:40,842 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:40,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 939 transitions. [2019-10-13 21:11:40,869 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 939 transitions. Word has length 144 [2019-10-13 21:11:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,870 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 939 transitions. [2019-10-13 21:11:40,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 939 transitions. [2019-10-13 21:11:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:11:40,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,874 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] [2019-10-13 21:11:40,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2008719333, now seen corresponding path program 1 times [2019-10-13 21:11:40,875 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507459747] [2019-10-13 21:11:40,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:41,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507459747] [2019-10-13 21:11:41,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:41,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:41,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379367025] [2019-10-13 21:11:41,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:41,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:41,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:41,042 INFO L87 Difference]: Start difference. First operand 600 states and 939 transitions. Second operand 5 states. [2019-10-13 21:11:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:41,138 INFO L93 Difference]: Finished difference Result 1170 states and 1850 transitions. [2019-10-13 21:11:41,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:41,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-13 21:11:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:41,152 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:41,152 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:41,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 938 transitions. [2019-10-13 21:11:41,190 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 938 transitions. Word has length 145 [2019-10-13 21:11:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:41,190 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 938 transitions. [2019-10-13 21:11:41,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 938 transitions. [2019-10-13 21:11:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:11:41,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:41,196 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] [2019-10-13 21:11:41,196 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1557988425, now seen corresponding path program 1 times [2019-10-13 21:11:41,197 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:41,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342496078] [2019-10-13 21:11:41,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:41,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342496078] [2019-10-13 21:11:41,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:41,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:41,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705684435] [2019-10-13 21:11:41,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:41,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:41,361 INFO L87 Difference]: Start difference. First operand 600 states and 938 transitions. Second operand 5 states. [2019-10-13 21:11:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:41,443 INFO L93 Difference]: Finished difference Result 1170 states and 1848 transitions. [2019-10-13 21:11:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:41,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-13 21:11:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:41,450 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:41,450 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:41,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 937 transitions. [2019-10-13 21:11:41,491 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 937 transitions. Word has length 146 [2019-10-13 21:11:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:41,492 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 937 transitions. [2019-10-13 21:11:41,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 937 transitions. [2019-10-13 21:11:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:11:41,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:41,500 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] [2019-10-13 21:11:41,501 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1196360064, now seen corresponding path program 1 times [2019-10-13 21:11:41,501 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:41,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226560686] [2019-10-13 21:11:41,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:41,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226560686] [2019-10-13 21:11:41,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:41,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:41,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74574585] [2019-10-13 21:11:41,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:41,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:41,728 INFO L87 Difference]: Start difference. First operand 600 states and 937 transitions. Second operand 5 states. [2019-10-13 21:11:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:41,802 INFO L93 Difference]: Finished difference Result 1170 states and 1846 transitions. [2019-10-13 21:11:41,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:41,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:11:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:41,810 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:41,811 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:41,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 936 transitions. [2019-10-13 21:11:41,849 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 936 transitions. Word has length 147 [2019-10-13 21:11:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:41,849 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 936 transitions. [2019-10-13 21:11:41,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 936 transitions. [2019-10-13 21:11:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:11:41,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:41,854 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] [2019-10-13 21:11:41,854 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1960010702, now seen corresponding path program 1 times [2019-10-13 21:11:41,855 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:41,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667807092] [2019-10-13 21:11:41,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:42,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667807092] [2019-10-13 21:11:42,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:42,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:42,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423726707] [2019-10-13 21:11:42,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:42,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:42,021 INFO L87 Difference]: Start difference. First operand 600 states and 936 transitions. Second operand 5 states. [2019-10-13 21:11:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:42,101 INFO L93 Difference]: Finished difference Result 1170 states and 1844 transitions. [2019-10-13 21:11:42,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:42,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:11:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:42,108 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:42,108 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:11:42,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:11:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 21:11:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 21:11:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 935 transitions. [2019-10-13 21:11:42,139 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 935 transitions. Word has length 148 [2019-10-13 21:11:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:42,139 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 935 transitions. [2019-10-13 21:11:42,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 935 transitions. [2019-10-13 21:11:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:11:42,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:42,146 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] [2019-10-13 21:11:42,146 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 629882651, now seen corresponding path program 1 times [2019-10-13 21:11:42,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:42,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865804617] [2019-10-13 21:11:42,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:42,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:42,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:42,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865804617] [2019-10-13 21:11:42,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901292217] [2019-10-13 21:11:42,372 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-13 21:11:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:42,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 3069 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:42,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:43,085 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:43,231 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:43,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:43,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820001153] [2019-10-13 21:11:43,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:43,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:43,233 INFO L87 Difference]: Start difference. First operand 600 states and 935 transitions. Second operand 3 states. [2019-10-13 21:11:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:43,325 INFO L93 Difference]: Finished difference Result 1679 states and 2665 transitions. [2019-10-13 21:11:43,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:43,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:11:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:43,336 INFO L225 Difference]: With dead ends: 1679 [2019-10-13 21:11:43,336 INFO L226 Difference]: Without dead ends: 1113 [2019-10-13 21:11:43,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-10-13 21:11:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1100. [2019-10-13 21:11:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-10-13 21:11:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1733 transitions. [2019-10-13 21:11:43,423 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1733 transitions. Word has length 149 [2019-10-13 21:11:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:43,427 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 1733 transitions. [2019-10-13 21:11:43,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1733 transitions. [2019-10-13 21:11:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:43,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:43,435 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, 1, 1] [2019-10-13 21:11:43,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:43,644 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:43,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:43,645 INFO L82 PathProgramCache]: Analyzing trace with hash 65962223, now seen corresponding path program 1 times [2019-10-13 21:11:43,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:43,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62543663] [2019-10-13 21:11:43,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:43,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62543663] [2019-10-13 21:11:43,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:43,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:43,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676973173] [2019-10-13 21:11:43,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:43,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:43,864 INFO L87 Difference]: Start difference. First operand 1100 states and 1733 transitions. Second operand 7 states. [2019-10-13 21:11:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:46,724 INFO L93 Difference]: Finished difference Result 3234 states and 5216 transitions. [2019-10-13 21:11:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:46,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-13 21:11:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:46,743 INFO L225 Difference]: With dead ends: 3234 [2019-10-13 21:11:46,743 INFO L226 Difference]: Without dead ends: 2168 [2019-10-13 21:11:46,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-10-13 21:11:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2102. [2019-10-13 21:11:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-10-13 21:11:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 3377 transitions. [2019-10-13 21:11:46,861 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 3377 transitions. Word has length 153 [2019-10-13 21:11:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:46,861 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 3377 transitions. [2019-10-13 21:11:46,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 3377 transitions. [2019-10-13 21:11:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:11:46,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:46,867 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] [2019-10-13 21:11:46,868 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -331869422, now seen corresponding path program 1 times [2019-10-13 21:11:46,868 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:46,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654839293] [2019-10-13 21:11:46,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:46,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:46,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:47,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654839293] [2019-10-13 21:11:47,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027238437] [2019-10-13 21:11:47,094 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-13 21:11:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:47,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 3070 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:47,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:47,730 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:47,954 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:47,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:47,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956538734] [2019-10-13 21:11:47,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:47,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:47,957 INFO L87 Difference]: Start difference. First operand 2102 states and 3377 transitions. Second operand 3 states. [2019-10-13 21:11:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:48,098 INFO L93 Difference]: Finished difference Result 5182 states and 8408 transitions. [2019-10-13 21:11:48,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:48,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:11:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:48,123 INFO L225 Difference]: With dead ends: 5182 [2019-10-13 21:11:48,123 INFO L226 Difference]: Without dead ends: 3114 [2019-10-13 21:11:48,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2019-10-13 21:11:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3014. [2019-10-13 21:11:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3014 states. [2019-10-13 21:11:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 4861 transitions. [2019-10-13 21:11:48,281 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 4861 transitions. Word has length 150 [2019-10-13 21:11:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:48,281 INFO L462 AbstractCegarLoop]: Abstraction has 3014 states and 4861 transitions. [2019-10-13 21:11:48,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 4861 transitions. [2019-10-13 21:11:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:48,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:48,290 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, 1, 1] [2019-10-13 21:11:48,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:48,496 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1286032454, now seen corresponding path program 1 times [2019-10-13 21:11:48,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:48,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824856049] [2019-10-13 21:11:48,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:48,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:48,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:48,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824856049] [2019-10-13 21:11:48,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500421801] [2019-10-13 21:11:48,706 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-13 21:11:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:49,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 3088 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:49,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:49,324 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-13 21:11:49,325 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:49,509 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:49,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-13 21:11:49,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434915861] [2019-10-13 21:11:49,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:49,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:49,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:49,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:49,514 INFO L87 Difference]: Start difference. First operand 3014 states and 4861 transitions. Second operand 4 states. [2019-10-13 21:11:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:49,695 INFO L93 Difference]: Finished difference Result 6066 states and 9869 transitions. [2019-10-13 21:11:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:49,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:11:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:49,720 INFO L225 Difference]: With dead ends: 6066 [2019-10-13 21:11:49,720 INFO L226 Difference]: Without dead ends: 3086 [2019-10-13 21:11:49,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2019-10-13 21:11:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3036. [2019-10-13 21:11:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2019-10-13 21:11:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4889 transitions. [2019-10-13 21:11:49,872 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4889 transitions. Word has length 153 [2019-10-13 21:11:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:49,873 INFO L462 AbstractCegarLoop]: Abstraction has 3036 states and 4889 transitions. [2019-10-13 21:11:49,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4889 transitions. [2019-10-13 21:11:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:49,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:49,881 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, 1, 1] [2019-10-13 21:11:50,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:50,089 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -173329017, now seen corresponding path program 1 times [2019-10-13 21:11:50,090 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:50,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535137420] [2019-10-13 21:11:50,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:50,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535137420] [2019-10-13 21:11:50,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:50,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:50,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143270378] [2019-10-13 21:11:50,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:50,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:50,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:50,218 INFO L87 Difference]: Start difference. First operand 3036 states and 4889 transitions. Second operand 4 states. [2019-10-13 21:11:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:50,385 INFO L93 Difference]: Finished difference Result 6032 states and 9786 transitions. [2019-10-13 21:11:50,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:50,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:11:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:50,410 INFO L225 Difference]: With dead ends: 6032 [2019-10-13 21:11:50,411 INFO L226 Difference]: Without dead ends: 3030 [2019-10-13 21:11:50,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-10-13 21:11:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3020. [2019-10-13 21:11:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-10-13 21:11:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4837 transitions. [2019-10-13 21:11:50,564 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 4837 transitions. Word has length 153 [2019-10-13 21:11:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:50,565 INFO L462 AbstractCegarLoop]: Abstraction has 3020 states and 4837 transitions. [2019-10-13 21:11:50,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 4837 transitions. [2019-10-13 21:11:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:50,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:50,573 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, 1, 1] [2019-10-13 21:11:50,573 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:50,573 INFO L82 PathProgramCache]: Analyzing trace with hash 843287171, now seen corresponding path program 1 times [2019-10-13 21:11:50,574 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:50,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543434373] [2019-10-13 21:11:50,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:11:50,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543434373] [2019-10-13 21:11:50,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966572271] [2019-10-13 21:11:50,750 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-13 21:11:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:51,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 3089 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:11:51,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:51,556 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-13 21:11:51,556 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:51,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:11:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:51,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:51,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-13 21:11:51,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890118015] [2019-10-13 21:11:51,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:51,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:51,860 INFO L87 Difference]: Start difference. First operand 3020 states and 4837 transitions. Second operand 6 states. [2019-10-13 21:11:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,218 INFO L93 Difference]: Finished difference Result 8143 states and 13161 transitions. [2019-10-13 21:11:53,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:53,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-13 21:11:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,260 INFO L225 Difference]: With dead ends: 8143 [2019-10-13 21:11:53,261 INFO L226 Difference]: Without dead ends: 5157 [2019-10-13 21:11:53,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2019-10-13 21:11:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 5117. [2019-10-13 21:11:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-10-13 21:11:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 8056 transitions. [2019-10-13 21:11:53,563 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 8056 transitions. Word has length 153 [2019-10-13 21:11:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,564 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 8056 transitions. [2019-10-13 21:11:53,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 8056 transitions. [2019-10-13 21:11:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:11:53,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,570 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-13 21:11:53,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:53,780 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2011771696, now seen corresponding path program 1 times [2019-10-13 21:11:53,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:53,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388901536] [2019-10-13 21:11:53,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:53,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:11:53,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388901536] [2019-10-13 21:11:53,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:53,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:53,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072157767] [2019-10-13 21:11:53,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:53,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:53,924 INFO L87 Difference]: Start difference. First operand 5117 states and 8056 transitions. Second operand 7 states. [2019-10-13 21:11:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:56,548 INFO L93 Difference]: Finished difference Result 15270 states and 24549 transitions. [2019-10-13 21:11:56,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:56,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-13 21:11:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:56,617 INFO L225 Difference]: With dead ends: 15270 [2019-10-13 21:11:56,617 INFO L226 Difference]: Without dead ends: 10187 [2019-10-13 21:11:56,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10187 states. [2019-10-13 21:11:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10187 to 10103. [2019-10-13 21:11:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-10-13 21:11:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 16097 transitions. [2019-10-13 21:11:57,576 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 16097 transitions. Word has length 161 [2019-10-13 21:11:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:57,577 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 16097 transitions. [2019-10-13 21:11:57,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 16097 transitions. [2019-10-13 21:11:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:11:57,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:57,584 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, 1] [2019-10-13 21:11:57,584 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1810633537, now seen corresponding path program 1 times [2019-10-13 21:11:57,585 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:57,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499978792] [2019-10-13 21:11:57,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:11:57,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499978792] [2019-10-13 21:11:57,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:57,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:57,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327710638] [2019-10-13 21:11:57,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:57,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:57,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:57,711 INFO L87 Difference]: Start difference. First operand 10103 states and 16097 transitions. Second operand 4 states. [2019-10-13 21:11:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:58,094 INFO L93 Difference]: Finished difference Result 20210 states and 32463 transitions. [2019-10-13 21:11:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:58,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-13 21:11:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:58,171 INFO L225 Difference]: With dead ends: 20210 [2019-10-13 21:11:58,172 INFO L226 Difference]: Without dead ends: 10138 [2019-10-13 21:11:58,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10138 states. [2019-10-13 21:11:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10138 to 10106. [2019-10-13 21:11:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10106 states. [2019-10-13 21:11:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10106 states to 10106 states and 16059 transitions. [2019-10-13 21:11:58,762 INFO L78 Accepts]: Start accepts. Automaton has 10106 states and 16059 transitions. Word has length 162 [2019-10-13 21:11:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:58,763 INFO L462 AbstractCegarLoop]: Abstraction has 10106 states and 16059 transitions. [2019-10-13 21:11:58,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 10106 states and 16059 transitions. [2019-10-13 21:11:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:11:58,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:58,770 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:58,770 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1844590663, now seen corresponding path program 1 times [2019-10-13 21:11:58,771 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:58,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459240583] [2019-10-13 21:11:58,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:58,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:58,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:58,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459240583] [2019-10-13 21:11:58,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:58,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:58,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357118032] [2019-10-13 21:11:58,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:58,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:58,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:58,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:58,935 INFO L87 Difference]: Start difference. First operand 10106 states and 16059 transitions. Second operand 7 states. [2019-10-13 21:12:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:01,797 INFO L93 Difference]: Finished difference Result 30309 states and 49317 transitions. [2019-10-13 21:12:01,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:01,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-10-13 21:12:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:02,563 INFO L225 Difference]: With dead ends: 30309 [2019-10-13 21:12:02,563 INFO L226 Difference]: Without dead ends: 20237 [2019-10-13 21:12:02,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20237 states. [2019-10-13 21:12:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20237 to 20105. [2019-10-13 21:12:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20105 states. [2019-10-13 21:12:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20105 states to 20105 states and 32492 transitions. [2019-10-13 21:12:03,342 INFO L78 Accepts]: Start accepts. Automaton has 20105 states and 32492 transitions. Word has length 171 [2019-10-13 21:12:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:03,345 INFO L462 AbstractCegarLoop]: Abstraction has 20105 states and 32492 transitions. [2019-10-13 21:12:03,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20105 states and 32492 transitions. [2019-10-13 21:12:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 21:12:03,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:03,351 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:03,351 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:03,352 INFO L82 PathProgramCache]: Analyzing trace with hash -620276398, now seen corresponding path program 1 times [2019-10-13 21:12:03,352 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:03,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678732688] [2019-10-13 21:12:03,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:03,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:03,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:12:03,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678732688] [2019-10-13 21:12:03,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:03,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:03,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295279235] [2019-10-13 21:12:03,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:03,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:03,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:03,485 INFO L87 Difference]: Start difference. First operand 20105 states and 32492 transitions. Second operand 4 states. [2019-10-13 21:12:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:04,124 INFO L93 Difference]: Finished difference Result 40288 states and 65727 transitions. [2019-10-13 21:12:04,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:04,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-13 21:12:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:04,256 INFO L225 Difference]: With dead ends: 40288 [2019-10-13 21:12:04,256 INFO L226 Difference]: Without dead ends: 20213 [2019-10-13 21:12:04,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20213 states.