./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_cev_1_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_cev_1_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c1d53ad7d5ad1c804b27728f7eb8fdb76e88b3e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:05:38,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:05:38,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:05:38,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:05:38,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:05:38,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:05:38,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:05:38,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:05:38,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:05:38,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:05:38,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:05:38,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:05:38,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:05:38,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:05:38,121 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:05:38,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:05:38,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:05:38,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:05:38,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:05:38,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:05:38,125 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:05:38,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:05:38,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:05:38,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:05:38,127 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:05:38,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:05:38,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:05:38,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:05:38,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:05:38,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:05:38,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:05:38,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:05:38,130 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:05:38,130 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:05:38,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:05:38,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:05:38,131 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 02:05:38,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:05:38,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:05:38,138 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:05:38,139 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:05:38,139 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:05:38,139 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:05:38,139 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:05:38,139 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:05:38,139 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:05:38,139 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:05:38,140 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:05:38,140 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:05:38,140 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:05:38,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:05:38,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:05:38,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:05:38,141 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:05:38,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:05:38,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:05:38,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:05:38,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:05:38,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:05:38,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:05:38,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:05:38,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:05:38,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:05:38,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:05:38,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:05:38,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:05:38,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:05:38,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:05:38,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:05:38,143 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:05:38,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:05:38,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:05:38,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 02:05:38,144 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c1d53ad7d5ad1c804b27728f7eb8fdb76e88b3e [2018-12-02 02:05:38,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:05:38,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:05:38,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:05:38,180 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:05:38,180 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:05:38,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_cev_1_false-unreach-call.c [2018-12-02 02:05:38,219 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/data/2cd47ba8e/8ae96738bc854df48d8ecfbc0aae7705/FLAGa021da2fc [2018-12-02 02:05:42,663 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:05:42,663 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/sv-benchmarks/c/psyco/psyco_cev_1_false-unreach-call.c [2018-12-02 02:05:43,466 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/data/2cd47ba8e/8ae96738bc854df48d8ecfbc0aae7705/FLAGa021da2fc [2018-12-02 02:05:43,639 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/data/2cd47ba8e/8ae96738bc854df48d8ecfbc0aae7705 [2018-12-02 02:05:43,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:05:43,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:05:43,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:05:43,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:05:43,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:05:43,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:05:43" (1/1) ... [2018-12-02 02:05:43,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71739fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:43, skipping insertion in model container [2018-12-02 02:05:43,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:05:43" (1/1) ... [2018-12-02 02:05:43,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:05:47,006 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:06:57,750 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:06:57,755 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:07:56,189 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:07:56,202 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:07:56,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56 WrapperNode [2018-12-02 02:07:56,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:07:56,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:07:56,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:07:56,204 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:07:56,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:07:58,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:07:58,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:07:58,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:07:58,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:07:58,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:07:58,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:07:58,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:08:00,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:08:00,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:08:04,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:08:04,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:08:06,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... [2018-12-02 02:08:15,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:08:15,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:08:15,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:08:15,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:08:15,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/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 [2018-12-02 02:08:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:08:15,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:08:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:08:15,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:08:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:08:15,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:08:26,960 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:08:26,961 INFO L280 CfgBuilder]: Removed 122 assue(true) statements. [2018-12-02 02:08:26,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:26 BoogieIcfgContainer [2018-12-02 02:08:26,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:08:26,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:08:26,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:08:26,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:08:26,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:05:43" (1/3) ... [2018-12-02 02:08:26,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195e66b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:26, skipping insertion in model container [2018-12-02 02:08:26,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:07:56" (2/3) ... [2018-12-02 02:08:26,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195e66b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:08:26, skipping insertion in model container [2018-12-02 02:08:26,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:26" (3/3) ... [2018-12-02 02:08:26,966 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_cev_1_false-unreach-call.c [2018-12-02 02:08:26,971 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:08:26,978 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:08:26,987 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:08:27,022 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:08:27,022 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:08:27,022 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:08:27,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:08:27,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:08:27,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:08:27,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:08:27,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:08:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states. [2018-12-02 02:08:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 02:08:27,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:27,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:27,071 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:27,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1738468812, now seen corresponding path program 1 times [2018-12-02 02:08:27,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:27,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:27,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:08:27,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:27,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 02:08:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 02:08:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 02:08:27,194 INFO L87 Difference]: Start difference. First operand 5012 states. Second operand 2 states. [2018-12-02 02:08:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:27,287 INFO L93 Difference]: Finished difference Result 8482 states and 16942 transitions. [2018-12-02 02:08:27,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 02:08:27,288 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-02 02:08:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:27,307 INFO L225 Difference]: With dead ends: 8482 [2018-12-02 02:08:27,307 INFO L226 Difference]: Without dead ends: 3443 [2018-12-02 02:08:27,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 02:08:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2018-12-02 02:08:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3443. [2018-12-02 02:08:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2018-12-02 02:08:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 5116 transitions. [2018-12-02 02:08:27,395 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 5116 transitions. Word has length 13 [2018-12-02 02:08:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:27,395 INFO L480 AbstractCegarLoop]: Abstraction has 3443 states and 5116 transitions. [2018-12-02 02:08:27,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 02:08:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 5116 transitions. [2018-12-02 02:08:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:08:27,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:27,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:27,396 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:27,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1410337667, now seen corresponding path program 1 times [2018-12-02 02:08:27,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:27,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:27,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:27,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:27,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:27,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:27,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:27,433 INFO L87 Difference]: Start difference. First operand 3443 states and 5116 transitions. Second operand 3 states. [2018-12-02 02:08:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:27,625 INFO L93 Difference]: Finished difference Result 6883 states and 10230 transitions. [2018-12-02 02:08:27,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:27,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 02:08:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:27,633 INFO L225 Difference]: With dead ends: 6883 [2018-12-02 02:08:27,633 INFO L226 Difference]: Without dead ends: 3446 [2018-12-02 02:08:27,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2018-12-02 02:08:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3446. [2018-12-02 02:08:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3446 states. [2018-12-02 02:08:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 5119 transitions. [2018-12-02 02:08:27,676 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 5119 transitions. Word has length 14 [2018-12-02 02:08:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:27,676 INFO L480 AbstractCegarLoop]: Abstraction has 3446 states and 5119 transitions. [2018-12-02 02:08:27,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 5119 transitions. [2018-12-02 02:08:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:08:27,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:27,677 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:27,677 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:27,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash -187589105, now seen corresponding path program 1 times [2018-12-02 02:08:27,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:27,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:27,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:27,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:27,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:27,716 INFO L87 Difference]: Start difference. First operand 3446 states and 5119 transitions. Second operand 3 states. [2018-12-02 02:08:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:27,865 INFO L93 Difference]: Finished difference Result 6871 states and 10213 transitions. [2018-12-02 02:08:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:27,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 02:08:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:27,875 INFO L225 Difference]: With dead ends: 6871 [2018-12-02 02:08:27,875 INFO L226 Difference]: Without dead ends: 3432 [2018-12-02 02:08:27,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2018-12-02 02:08:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3432. [2018-12-02 02:08:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3432 states. [2018-12-02 02:08:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 5099 transitions. [2018-12-02 02:08:27,928 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 5099 transitions. Word has length 19 [2018-12-02 02:08:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:27,929 INFO L480 AbstractCegarLoop]: Abstraction has 3432 states and 5099 transitions. [2018-12-02 02:08:27,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 5099 transitions. [2018-12-02 02:08:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:08:27,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:27,930 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:27,930 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:27,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1212096853, now seen corresponding path program 1 times [2018-12-02 02:08:27,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:27,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:27,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:08:27,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:27,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:27,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:27,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:27,961 INFO L87 Difference]: Start difference. First operand 3432 states and 5099 transitions. Second operand 3 states. [2018-12-02 02:08:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:28,272 INFO L93 Difference]: Finished difference Result 10266 states and 15265 transitions. [2018-12-02 02:08:28,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:28,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 02:08:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:28,292 INFO L225 Difference]: With dead ends: 10266 [2018-12-02 02:08:28,292 INFO L226 Difference]: Without dead ends: 6836 [2018-12-02 02:08:28,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2018-12-02 02:08:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 6792. [2018-12-02 02:08:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6792 states. [2018-12-02 02:08:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6792 states to 6792 states and 10107 transitions. [2018-12-02 02:08:28,390 INFO L78 Accepts]: Start accepts. Automaton has 6792 states and 10107 transitions. Word has length 22 [2018-12-02 02:08:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:28,390 INFO L480 AbstractCegarLoop]: Abstraction has 6792 states and 10107 transitions. [2018-12-02 02:08:28,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6792 states and 10107 transitions. [2018-12-02 02:08:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:08:28,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:28,391 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:28,391 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:28,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1293802146, now seen corresponding path program 1 times [2018-12-02 02:08:28,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:28,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:28,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:28,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:28,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:08:28,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:28,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:28,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:28,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:28,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:28,421 INFO L87 Difference]: Start difference. First operand 6792 states and 10107 transitions. Second operand 3 states. [2018-12-02 02:08:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:28,598 INFO L93 Difference]: Finished difference Result 13582 states and 20212 transitions. [2018-12-02 02:08:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:28,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 02:08:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:28,619 INFO L225 Difference]: With dead ends: 13582 [2018-12-02 02:08:28,619 INFO L226 Difference]: Without dead ends: 6802 [2018-12-02 02:08:28,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6802 states. [2018-12-02 02:08:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6802 to 6800. [2018-12-02 02:08:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6800 states. [2018-12-02 02:08:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6800 states to 6800 states and 10115 transitions. [2018-12-02 02:08:28,711 INFO L78 Accepts]: Start accepts. Automaton has 6800 states and 10115 transitions. Word has length 25 [2018-12-02 02:08:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:28,711 INFO L480 AbstractCegarLoop]: Abstraction has 6800 states and 10115 transitions. [2018-12-02 02:08:28,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6800 states and 10115 transitions. [2018-12-02 02:08:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 02:08:28,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:28,712 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-02 02:08:28,712 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:28,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -745575106, now seen corresponding path program 1 times [2018-12-02 02:08:28,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:28,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:28,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:08:28,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:28,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:28,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:28,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:28,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:28,741 INFO L87 Difference]: Start difference. First operand 6800 states and 10115 transitions. Second operand 3 states. [2018-12-02 02:08:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:28,920 INFO L93 Difference]: Finished difference Result 13600 states and 20232 transitions. [2018-12-02 02:08:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:28,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 02:08:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:28,936 INFO L225 Difference]: With dead ends: 13600 [2018-12-02 02:08:28,937 INFO L226 Difference]: Without dead ends: 6812 [2018-12-02 02:08:28,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2018-12-02 02:08:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 6810. [2018-12-02 02:08:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6810 states. [2018-12-02 02:08:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6810 states to 6810 states and 10125 transitions. [2018-12-02 02:08:29,027 INFO L78 Accepts]: Start accepts. Automaton has 6810 states and 10125 transitions. Word has length 33 [2018-12-02 02:08:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:29,028 INFO L480 AbstractCegarLoop]: Abstraction has 6810 states and 10125 transitions. [2018-12-02 02:08:29,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6810 states and 10125 transitions. [2018-12-02 02:08:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-02 02:08:29,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:29,032 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:29,032 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:29,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1303457396, now seen corresponding path program 1 times [2018-12-02 02:08:29,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:29,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:29,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:08:29,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:29,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:29,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:29,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:29,188 INFO L87 Difference]: Start difference. First operand 6810 states and 10125 transitions. Second operand 3 states. [2018-12-02 02:08:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:29,330 INFO L93 Difference]: Finished difference Result 7383 states and 10970 transitions. [2018-12-02 02:08:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:29,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-02 02:08:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:29,341 INFO L225 Difference]: With dead ends: 7383 [2018-12-02 02:08:29,341 INFO L226 Difference]: Without dead ends: 7377 [2018-12-02 02:08:29,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2018-12-02 02:08:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 7369. [2018-12-02 02:08:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7369 states. [2018-12-02 02:08:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7369 states to 7369 states and 10956 transitions. [2018-12-02 02:08:29,409 INFO L78 Accepts]: Start accepts. Automaton has 7369 states and 10956 transitions. Word has length 285 [2018-12-02 02:08:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:29,410 INFO L480 AbstractCegarLoop]: Abstraction has 7369 states and 10956 transitions. [2018-12-02 02:08:29,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7369 states and 10956 transitions. [2018-12-02 02:08:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-02 02:08:29,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:29,412 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:29,412 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:29,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1741685140, now seen corresponding path program 1 times [2018-12-02 02:08:29,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:29,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:29,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:08:29,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:29,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:29,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:29,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:29,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:29,550 INFO L87 Difference]: Start difference. First operand 7369 states and 10956 transitions. Second operand 3 states. [2018-12-02 02:08:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:29,886 INFO L93 Difference]: Finished difference Result 20959 states and 31174 transitions. [2018-12-02 02:08:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:29,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-12-02 02:08:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:29,900 INFO L225 Difference]: With dead ends: 20959 [2018-12-02 02:08:29,901 INFO L226 Difference]: Without dead ends: 14161 [2018-12-02 02:08:29,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2018-12-02 02:08:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 14121. [2018-12-02 02:08:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14121 states. [2018-12-02 02:08:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14121 states to 14121 states and 21005 transitions. [2018-12-02 02:08:30,026 INFO L78 Accepts]: Start accepts. Automaton has 14121 states and 21005 transitions. Word has length 286 [2018-12-02 02:08:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:30,026 INFO L480 AbstractCegarLoop]: Abstraction has 14121 states and 21005 transitions. [2018-12-02 02:08:30,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 14121 states and 21005 transitions. [2018-12-02 02:08:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-02 02:08:30,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:30,028 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:30,028 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:30,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash 371618552, now seen corresponding path program 1 times [2018-12-02 02:08:30,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:30,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:30,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:08:30,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:30,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:30,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:30,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:30,119 INFO L87 Difference]: Start difference. First operand 14121 states and 21005 transitions. Second operand 3 states. [2018-12-02 02:08:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:30,307 INFO L93 Difference]: Finished difference Result 27671 states and 41167 transitions. [2018-12-02 02:08:30,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:30,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-12-02 02:08:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:30,321 INFO L225 Difference]: With dead ends: 27671 [2018-12-02 02:08:30,322 INFO L226 Difference]: Without dead ends: 14121 [2018-12-02 02:08:30,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14121 states. [2018-12-02 02:08:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14121 to 14115. [2018-12-02 02:08:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14115 states. [2018-12-02 02:08:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14115 states to 14115 states and 20988 transitions. [2018-12-02 02:08:30,456 INFO L78 Accepts]: Start accepts. Automaton has 14115 states and 20988 transitions. Word has length 294 [2018-12-02 02:08:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:30,456 INFO L480 AbstractCegarLoop]: Abstraction has 14115 states and 20988 transitions. [2018-12-02 02:08:30,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14115 states and 20988 transitions. [2018-12-02 02:08:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-02 02:08:30,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:30,459 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:30,459 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:30,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1786877185, now seen corresponding path program 1 times [2018-12-02 02:08:30,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:30,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:30,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 02:08:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:30,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:30,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:30,528 INFO L87 Difference]: Start difference. First operand 14115 states and 20988 transitions. Second operand 3 states. [2018-12-02 02:08:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:30,688 INFO L93 Difference]: Finished difference Result 22614 states and 33618 transitions. [2018-12-02 02:08:30,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:30,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-12-02 02:08:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:30,698 INFO L225 Difference]: With dead ends: 22614 [2018-12-02 02:08:30,698 INFO L226 Difference]: Without dead ends: 9070 [2018-12-02 02:08:30,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9070 states. [2018-12-02 02:08:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9070 to 9068. [2018-12-02 02:08:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9068 states. [2018-12-02 02:08:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9068 states to 9068 states and 13463 transitions. [2018-12-02 02:08:30,789 INFO L78 Accepts]: Start accepts. Automaton has 9068 states and 13463 transitions. Word has length 303 [2018-12-02 02:08:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:30,789 INFO L480 AbstractCegarLoop]: Abstraction has 9068 states and 13463 transitions. [2018-12-02 02:08:30,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 9068 states and 13463 transitions. [2018-12-02 02:08:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-02 02:08:30,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:30,794 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:30,794 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:30,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -731006194, now seen corresponding path program 1 times [2018-12-02 02:08:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:30,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:30,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:08:30,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:30,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:30,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:30,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:30,863 INFO L87 Difference]: Start difference. First operand 9068 states and 13463 transitions. Second operand 3 states. [2018-12-02 02:08:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:30,998 INFO L93 Difference]: Finished difference Result 15311 states and 22728 transitions. [2018-12-02 02:08:30,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:30,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2018-12-02 02:08:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:31,006 INFO L225 Difference]: With dead ends: 15311 [2018-12-02 02:08:31,006 INFO L226 Difference]: Without dead ends: 6814 [2018-12-02 02:08:31,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2018-12-02 02:08:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 6812. [2018-12-02 02:08:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2018-12-02 02:08:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 10104 transitions. [2018-12-02 02:08:31,057 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 10104 transitions. Word has length 304 [2018-12-02 02:08:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:31,057 INFO L480 AbstractCegarLoop]: Abstraction has 6812 states and 10104 transitions. [2018-12-02 02:08:31,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 10104 transitions. [2018-12-02 02:08:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-02 02:08:31,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:31,060 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:31,061 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:31,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1477932982, now seen corresponding path program 1 times [2018-12-02 02:08:31,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:31,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:31,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:08:31,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:31,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:08:31,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:31,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:08:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:08:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:08:31,589 INFO L87 Difference]: Start difference. First operand 6812 states and 10104 transitions. Second operand 4 states. [2018-12-02 02:08:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:31,830 INFO L93 Difference]: Finished difference Result 7956 states and 11794 transitions. [2018-12-02 02:08:31,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:08:31,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-12-02 02:08:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:31,837 INFO L225 Difference]: With dead ends: 7956 [2018-12-02 02:08:31,837 INFO L226 Difference]: Without dead ends: 7954 [2018-12-02 02:08:31,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:08:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7954 states. [2018-12-02 02:08:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7954 to 7944. [2018-12-02 02:08:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7944 states. [2018-12-02 02:08:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7944 states to 7944 states and 11783 transitions. [2018-12-02 02:08:31,891 INFO L78 Accepts]: Start accepts. Automaton has 7944 states and 11783 transitions. Word has length 304 [2018-12-02 02:08:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:31,891 INFO L480 AbstractCegarLoop]: Abstraction has 7944 states and 11783 transitions. [2018-12-02 02:08:31,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:08:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7944 states and 11783 transitions. [2018-12-02 02:08:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-12-02 02:08:31,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:31,893 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:31,893 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:31,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -540063606, now seen corresponding path program 1 times [2018-12-02 02:08:31,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:31,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:31,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:31,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:31,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 02:08:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:31,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:31,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:31,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:31,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:31,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:31,960 INFO L87 Difference]: Start difference. First operand 7944 states and 11783 transitions. Second operand 3 states. [2018-12-02 02:08:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:32,138 INFO L93 Difference]: Finished difference Result 13644 states and 20232 transitions. [2018-12-02 02:08:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:32,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-12-02 02:08:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:32,145 INFO L225 Difference]: With dead ends: 13644 [2018-12-02 02:08:32,145 INFO L226 Difference]: Without dead ends: 7976 [2018-12-02 02:08:32,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2018-12-02 02:08:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7948. [2018-12-02 02:08:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7948 states. [2018-12-02 02:08:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7948 states to 7948 states and 11784 transitions. [2018-12-02 02:08:32,210 INFO L78 Accepts]: Start accepts. Automaton has 7948 states and 11784 transitions. Word has length 306 [2018-12-02 02:08:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:32,210 INFO L480 AbstractCegarLoop]: Abstraction has 7948 states and 11784 transitions. [2018-12-02 02:08:32,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7948 states and 11784 transitions. [2018-12-02 02:08:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-12-02 02:08:32,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:32,213 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:32,213 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:32,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash -240460612, now seen corresponding path program 1 times [2018-12-02 02:08:32,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:32,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:32,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 02:08:32,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:32,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:32,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:32,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:32,277 INFO L87 Difference]: Start difference. First operand 7948 states and 11784 transitions. Second operand 3 states. [2018-12-02 02:08:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:32,405 INFO L93 Difference]: Finished difference Result 11370 states and 16852 transitions. [2018-12-02 02:08:32,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:32,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-12-02 02:08:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:32,411 INFO L225 Difference]: With dead ends: 11370 [2018-12-02 02:08:32,411 INFO L226 Difference]: Without dead ends: 5702 [2018-12-02 02:08:32,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2018-12-02 02:08:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5700. [2018-12-02 02:08:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2018-12-02 02:08:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 8437 transitions. [2018-12-02 02:08:32,454 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 8437 transitions. Word has length 307 [2018-12-02 02:08:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:32,455 INFO L480 AbstractCegarLoop]: Abstraction has 5700 states and 8437 transitions. [2018-12-02 02:08:32,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 8437 transitions. [2018-12-02 02:08:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-12-02 02:08:32,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:32,457 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:32,457 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:32,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1294653084, now seen corresponding path program 1 times [2018-12-02 02:08:32,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:32,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:32,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 02:08:32,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:32,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:32,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:32,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:32,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:32,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:32,536 INFO L87 Difference]: Start difference. First operand 5700 states and 8437 transitions. Second operand 3 states. [2018-12-02 02:08:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:32,644 INFO L93 Difference]: Finished difference Result 8554 states and 12661 transitions. [2018-12-02 02:08:32,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:32,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2018-12-02 02:08:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:32,648 INFO L225 Difference]: With dead ends: 8554 [2018-12-02 02:08:32,648 INFO L226 Difference]: Without dead ends: 5134 [2018-12-02 02:08:32,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2018-12-02 02:08:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5132. [2018-12-02 02:08:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5132 states. [2018-12-02 02:08:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5132 states to 5132 states and 7594 transitions. [2018-12-02 02:08:32,684 INFO L78 Accepts]: Start accepts. Automaton has 5132 states and 7594 transitions. Word has length 321 [2018-12-02 02:08:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:32,684 INFO L480 AbstractCegarLoop]: Abstraction has 5132 states and 7594 transitions. [2018-12-02 02:08:32,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5132 states and 7594 transitions. [2018-12-02 02:08:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-12-02 02:08:32,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:32,689 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:32,690 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:32,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1788374966, now seen corresponding path program 1 times [2018-12-02 02:08:32,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:32,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 02:08:32,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:32,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:32,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:32,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:32,890 INFO L87 Difference]: Start difference. First operand 5132 states and 7594 transitions. Second operand 3 states. [2018-12-02 02:08:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:33,057 INFO L93 Difference]: Finished difference Result 10268 states and 15196 transitions. [2018-12-02 02:08:33,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:33,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 570 [2018-12-02 02:08:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:33,063 INFO L225 Difference]: With dead ends: 10268 [2018-12-02 02:08:33,063 INFO L226 Difference]: Without dead ends: 7408 [2018-12-02 02:08:33,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2018-12-02 02:08:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7390. [2018-12-02 02:08:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2018-12-02 02:08:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10942 transitions. [2018-12-02 02:08:33,116 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10942 transitions. Word has length 570 [2018-12-02 02:08:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:33,116 INFO L480 AbstractCegarLoop]: Abstraction has 7390 states and 10942 transitions. [2018-12-02 02:08:33,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10942 transitions. [2018-12-02 02:08:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-12-02 02:08:33,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:33,122 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:33,122 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:33,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1235355442, now seen corresponding path program 1 times [2018-12-02 02:08:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:33,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:33,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 02:08:33,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:33,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:33,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:33,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:33,341 INFO L87 Difference]: Start difference. First operand 7390 states and 10942 transitions. Second operand 3 states. [2018-12-02 02:08:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:33,595 INFO L93 Difference]: Finished difference Result 18746 states and 27762 transitions. [2018-12-02 02:08:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:33,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2018-12-02 02:08:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:33,606 INFO L225 Difference]: With dead ends: 18746 [2018-12-02 02:08:33,606 INFO L226 Difference]: Without dead ends: 13632 [2018-12-02 02:08:33,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13632 states. [2018-12-02 02:08:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13632 to 13546. [2018-12-02 02:08:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13546 states. [2018-12-02 02:08:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13546 states to 13546 states and 20098 transitions. [2018-12-02 02:08:33,709 INFO L78 Accepts]: Start accepts. Automaton has 13546 states and 20098 transitions. Word has length 576 [2018-12-02 02:08:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:33,710 INFO L480 AbstractCegarLoop]: Abstraction has 13546 states and 20098 transitions. [2018-12-02 02:08:33,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 13546 states and 20098 transitions. [2018-12-02 02:08:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-12-02 02:08:33,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:33,717 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:33,718 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:33,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -163864388, now seen corresponding path program 1 times [2018-12-02 02:08:33,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:33,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:33,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:08:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 02:08:33,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:08:33,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:08:33,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:08:33,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:08:33,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:08:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:33,934 INFO L87 Difference]: Start difference. First operand 13546 states and 20098 transitions. Second operand 3 states. [2018-12-02 02:08:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:08:34,096 INFO L93 Difference]: Finished difference Result 20310 states and 30136 transitions. [2018-12-02 02:08:34,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:08:34,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 586 [2018-12-02 02:08:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:08:34,112 INFO L225 Difference]: With dead ends: 20310 [2018-12-02 02:08:34,112 INFO L226 Difference]: Without dead ends: 20302 [2018-12-02 02:08:34,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:08:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20302 states. [2018-12-02 02:08:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20302 to 20260. [2018-12-02 02:08:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20260 states. [2018-12-02 02:08:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20260 states to 20260 states and 30082 transitions. [2018-12-02 02:08:34,256 INFO L78 Accepts]: Start accepts. Automaton has 20260 states and 30082 transitions. Word has length 586 [2018-12-02 02:08:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:08:34,256 INFO L480 AbstractCegarLoop]: Abstraction has 20260 states and 30082 transitions. [2018-12-02 02:08:34,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:08:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 20260 states and 30082 transitions. [2018-12-02 02:08:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-12-02 02:08:34,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:08:34,263 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:08:34,263 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:08:34,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:08:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash -15126274, now seen corresponding path program 1 times [2018-12-02 02:08:34,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:08:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:34,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:08:34,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:08:34,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:08:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:08:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:08:34,564 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 02:08:34,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:08:34 BoogieIcfgContainer [2018-12-02 02:08:34,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:08:34,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:08:34,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:08:34,665 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:08:34,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:08:26" (3/4) ... [2018-12-02 02:08:34,667 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 02:08:34,766 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ab00ba19-edf8-44d7-8f9e-691b09ab9149/bin-2019/utaipan/witness.graphml [2018-12-02 02:08:34,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:08:34,766 INFO L168 Benchmark]: Toolchain (without parser) took 171124.48 ms. Allocated memory was 2.0 GB in the beginning and 9.3 GB in the end (delta: 7.4 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,767 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:08:34,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132560.38 ms. Allocated memory was 2.0 GB in the beginning and 7.2 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 2778.01 ms. Allocated memory was 7.2 GB in the beginning and 7.3 GB in the end (delta: 102.2 MB). Free memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: -630.7 MB). Peak memory consumption was 788.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,768 INFO L168 Benchmark]: Boogie Preprocessor took 16710.69 ms. Allocated memory was 7.3 GB in the beginning and 9.3 GB in the end (delta: 2.0 GB). Free memory was 3.0 GB in the beginning and 5.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,768 INFO L168 Benchmark]: RCFGBuilder took 11268.33 ms. Allocated memory is still 9.3 GB. Free memory was 5.1 GB in the beginning and 4.7 GB in the end (delta: 415.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,768 INFO L168 Benchmark]: TraceAbstraction took 7703.67 ms. Allocated memory is still 9.3 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,768 INFO L168 Benchmark]: Witness Printer took 100.50 ms. Allocated memory is still 9.3 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:08:34,769 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132560.38 ms. Allocated memory was 2.0 GB in the beginning and 7.2 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 2778.01 ms. Allocated memory was 7.2 GB in the beginning and 7.3 GB in the end (delta: 102.2 MB). Free memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: -630.7 MB). Peak memory consumption was 788.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16710.69 ms. Allocated memory was 7.3 GB in the beginning and 9.3 GB in the end (delta: 2.0 GB). Free memory was 3.0 GB in the beginning and 5.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * RCFGBuilder took 11268.33 ms. Allocated memory is still 9.3 GB. Free memory was 5.1 GB in the beginning and 4.7 GB in the end (delta: 415.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * TraceAbstraction took 7703.67 ms. Allocated memory is still 9.3 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Witness Printer took 100.50 ms. Allocated memory is still 9.3 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26700]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_stage2Separation = 1; [L6] int m_completion = 2; [L7] int m_tliBurn = 3; [L8] int m_loiBurn = 4; [L9] int m_stage1Separation = 5; [L10] int m_edsSeparation = 6; [L11] int m_lsamAscentRendezvous = 7; [L12] int m_smSeparation = 8; [L13] int m_eiBurn = 9; [L14] int m_lsamRendezvous = 10; [L15] int m_teiBurn = 11; [L16] int m_CEV = 12; [L17] int m_abort = 13; [L18] int m_enterOrbitOps = 14; [L19] int m_failure = 15; [L20] int m_lsamSeparation = 16; [L21] int m_abortPassiveLAScompletion = 17; [L22] int m_lasJettison = 18; [L23] int m_lsamAscentBurn = 19; [L24] int m_srbIgnition = 20; [L25] int m_deOrbit = 21; VAL [\old(m_abort)=9, \old(m_abortPassiveLAScompletion)=11, \old(m_CEV)=10, \old(m_completion)=2, \old(m_deOrbit)=3, \old(m_edsSeparation)=5, \old(m_eiBurn)=7, \old(m_enterOrbitOps)=15, \old(m_failure)=12, \old(m_lasJettison)=4, \old(m_loiBurn)=13, \old(m_lsamAscentBurn)=19, \old(m_lsamAscentRendezvous)=6, \old(m_lsamRendezvous)=14, \old(m_lsamSeparation)=17, \old(m_smSeparation)=8, \old(m_srbIgnition)=16, \old(m_stage1Separation)=21, \old(m_stage2Separation)=22, \old(m_teiBurn)=20, \old(m_tliBurn)=18, m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3] [L30] int q = 0; [L31] int method_id; [L34] int this_spacecraft_cLSAM_ASCENT = 0; [L35] int this_spacecraft_cEDS = 0; [L36] int this_spacecraft_cLSAM_DESCENT = 0; [L37] int this_spacecraft_cLAS = 1; [L38] int this_spacecraft_cStage1 = 1; [L39] int this_spacecraft_cStage2 = 1; [L40] int this_spacecraft_cCM = 1; [L41] int this_spacecraft_cSM = 1; VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND TRUE q == 0 [L56] COND TRUE __VERIFIER_nondet_int() [L60] method_id = 12 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=0, P3=0, P4=0, P5=0, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L62] COND FALSE !(0) [L66] q = 2 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND TRUE __VERIFIER_nondet_int() [L291] method_id = 8 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L293] COND FALSE !(0) [L297] q = 2 [L299] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L299] this_spacecraft_cCM=this_spacecraft_cCM [L299] this_spacecraft_cSM=0 [L299] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L299] this_spacecraft_cEDS=this_spacecraft_cEDS [L299] this_spacecraft_cLAS=this_spacecraft_cLAS [L299] this_spacecraft_cStage2=this_spacecraft_cStage2 [L299] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND FALSE !(__VERIFIER_nondet_int()) [L303] COND FALSE !(__VERIFIER_nondet_int()) [L319] COND FALSE !(__VERIFIER_nondet_int()) [L335] COND FALSE !(__VERIFIER_nondet_int()) [L351] COND FALSE !(__VERIFIER_nondet_int()) [L367] COND FALSE !(__VERIFIER_nondet_int()) [L383] COND FALSE !(__VERIFIER_nondet_int()) [L399] COND FALSE !(__VERIFIER_nondet_int()) [L415] COND FALSE !(__VERIFIER_nondet_int()) [L431] COND FALSE !(__VERIFIER_nondet_int()) [L447] COND FALSE !(__VERIFIER_nondet_int()) [L463] COND FALSE !(__VERIFIER_nondet_int()) [L479] COND FALSE !(__VERIFIER_nondet_int()) [L495] COND FALSE !(__VERIFIER_nondet_int()) [L511] COND FALSE !(__VERIFIER_nondet_int()) [L527] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L559] COND FALSE !(__VERIFIER_nondet_int()) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L591] COND FALSE !(__VERIFIER_nondet_int()) [L607] COND FALSE !(__VERIFIER_nondet_int()) [L623] COND FALSE !(__VERIFIER_nondet_int()) [L639] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND FALSE !(__VERIFIER_nondet_int()) [L671] COND FALSE !(__VERIFIER_nondet_int()) [L687] COND FALSE !(__VERIFIER_nondet_int()) [L703] COND FALSE !(__VERIFIER_nondet_int()) [L719] COND FALSE !(__VERIFIER_nondet_int()) [L735] COND FALSE !(__VERIFIER_nondet_int()) [L751] COND FALSE !(__VERIFIER_nondet_int()) [L767] COND FALSE !(__VERIFIER_nondet_int()) [L783] COND FALSE !(__VERIFIER_nondet_int()) [L799] COND FALSE !(__VERIFIER_nondet_int()) [L815] COND FALSE !(__VERIFIER_nondet_int()) [L831] COND FALSE !(__VERIFIER_nondet_int()) [L847] COND FALSE !(__VERIFIER_nondet_int()) [L863] COND FALSE !(__VERIFIER_nondet_int()) [L879] COND FALSE !(__VERIFIER_nondet_int()) [L895] COND FALSE !(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L927] COND FALSE !(__VERIFIER_nondet_int()) [L943] COND FALSE !(__VERIFIER_nondet_int()) [L959] COND FALSE !(__VERIFIER_nondet_int()) [L975] COND FALSE !(__VERIFIER_nondet_int()) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1007] COND FALSE !(__VERIFIER_nondet_int()) [L1023] COND FALSE !(__VERIFIER_nondet_int()) [L1039] COND FALSE !(__VERIFIER_nondet_int()) [L1055] COND FALSE !(__VERIFIER_nondet_int()) [L1071] COND FALSE !(__VERIFIER_nondet_int()) [L1087] COND FALSE !(__VERIFIER_nondet_int()) [L1103] COND FALSE !(__VERIFIER_nondet_int()) [L1119] COND FALSE !(__VERIFIER_nondet_int()) [L1135] COND FALSE !(__VERIFIER_nondet_int()) [L1151] COND FALSE !(__VERIFIER_nondet_int()) [L1167] COND FALSE !(__VERIFIER_nondet_int()) [L1183] COND FALSE !(__VERIFIER_nondet_int()) [L1199] COND FALSE !(__VERIFIER_nondet_int()) [L1215] COND FALSE !(__VERIFIER_nondet_int()) [L1231] COND FALSE !(__VERIFIER_nondet_int()) [L1247] COND FALSE !(__VERIFIER_nondet_int()) [L1263] COND FALSE !(__VERIFIER_nondet_int()) [L1279] COND FALSE !(__VERIFIER_nondet_int()) [L1295] COND FALSE !(__VERIFIER_nondet_int()) [L1311] COND FALSE !(__VERIFIER_nondet_int()) [L1327] COND FALSE !(__VERIFIER_nondet_int()) [L1343] COND FALSE !(__VERIFIER_nondet_int()) [L1359] COND FALSE !(__VERIFIER_nondet_int()) [L1375] COND FALSE !(__VERIFIER_nondet_int()) [L1391] COND FALSE !(__VERIFIER_nondet_int()) [L1407] COND FALSE !(__VERIFIER_nondet_int()) [L1423] COND FALSE !(__VERIFIER_nondet_int()) [L1439] COND FALSE !(__VERIFIER_nondet_int()) [L1455] COND FALSE !(__VERIFIER_nondet_int()) [L1471] COND FALSE !(__VERIFIER_nondet_int()) [L1487] COND FALSE !(__VERIFIER_nondet_int()) [L1503] COND FALSE !(__VERIFIER_nondet_int()) [L1519] COND FALSE !(__VERIFIER_nondet_int()) [L1535] COND FALSE !(__VERIFIER_nondet_int()) [L1551] COND FALSE !(__VERIFIER_nondet_int()) [L1567] COND FALSE !(__VERIFIER_nondet_int()) [L1583] COND FALSE !(__VERIFIER_nondet_int()) [L1599] COND FALSE !(__VERIFIER_nondet_int()) [L1615] COND FALSE !(__VERIFIER_nondet_int()) [L1631] COND FALSE !(__VERIFIER_nondet_int()) [L1647] COND FALSE !(__VERIFIER_nondet_int()) [L1663] COND FALSE !(__VERIFIER_nondet_int()) [L1679] COND FALSE !(__VERIFIER_nondet_int()) [L1695] COND FALSE !(__VERIFIER_nondet_int()) [L1711] COND FALSE !(__VERIFIER_nondet_int()) [L1727] COND FALSE !(__VERIFIER_nondet_int()) [L1743] COND FALSE !(__VERIFIER_nondet_int()) [L1759] COND FALSE !(__VERIFIER_nondet_int()) [L1775] COND FALSE !(__VERIFIER_nondet_int()) [L1791] COND FALSE !(__VERIFIER_nondet_int()) [L1807] COND FALSE !(__VERIFIER_nondet_int()) [L1823] COND FALSE !(__VERIFIER_nondet_int()) [L1839] COND FALSE !(__VERIFIER_nondet_int()) [L1855] COND FALSE !(__VERIFIER_nondet_int()) [L1871] COND FALSE !(__VERIFIER_nondet_int()) [L1887] COND FALSE !(__VERIFIER_nondet_int()) [L1903] COND FALSE !(__VERIFIER_nondet_int()) [L1919] COND FALSE !(__VERIFIER_nondet_int()) [L1935] COND FALSE !(__VERIFIER_nondet_int()) [L1951] COND FALSE !(__VERIFIER_nondet_int()) [L1967] COND FALSE !(__VERIFIER_nondet_int()) [L1983] COND FALSE !(__VERIFIER_nondet_int()) [L1999] COND FALSE !(__VERIFIER_nondet_int()) [L2015] COND FALSE !(__VERIFIER_nondet_int()) [L2031] COND FALSE !(__VERIFIER_nondet_int()) [L2047] COND FALSE !(__VERIFIER_nondet_int()) [L2063] COND FALSE !(__VERIFIER_nondet_int()) [L2079] COND FALSE !(__VERIFIER_nondet_int()) [L2095] COND FALSE !(__VERIFIER_nondet_int()) [L2111] COND FALSE !(__VERIFIER_nondet_int()) [L2127] COND FALSE !(__VERIFIER_nondet_int()) [L2143] COND FALSE !(__VERIFIER_nondet_int()) [L2159] COND FALSE !(__VERIFIER_nondet_int()) [L2175] COND FALSE !(__VERIFIER_nondet_int()) [L2191] COND FALSE !(__VERIFIER_nondet_int()) [L2207] COND FALSE !(__VERIFIER_nondet_int()) [L2223] COND FALSE !(__VERIFIER_nondet_int()) [L2239] COND FALSE !(__VERIFIER_nondet_int()) [L2255] COND FALSE !(__VERIFIER_nondet_int()) [L2271] COND FALSE !(__VERIFIER_nondet_int()) [L2287] COND FALSE !(__VERIFIER_nondet_int()) [L2303] COND FALSE !(__VERIFIER_nondet_int()) [L2319] COND FALSE !(__VERIFIER_nondet_int()) [L2335] COND FALSE !(__VERIFIER_nondet_int()) [L2351] COND FALSE !(__VERIFIER_nondet_int()) [L2367] COND FALSE !(__VERIFIER_nondet_int()) [L2383] COND FALSE !(__VERIFIER_nondet_int()) [L2399] COND FALSE !(__VERIFIER_nondet_int()) [L2415] COND FALSE !(__VERIFIER_nondet_int()) [L2431] COND FALSE !(__VERIFIER_nondet_int()) [L2447] COND FALSE !(__VERIFIER_nondet_int()) [L2463] COND FALSE !(__VERIFIER_nondet_int()) [L2479] COND FALSE !(__VERIFIER_nondet_int()) [L2495] COND FALSE !(__VERIFIER_nondet_int()) [L2511] COND FALSE !(__VERIFIER_nondet_int()) [L2527] COND FALSE !(__VERIFIER_nondet_int()) [L2543] COND FALSE !(__VERIFIER_nondet_int()) [L2559] COND FALSE !(__VERIFIER_nondet_int()) [L2575] COND FALSE !(__VERIFIER_nondet_int()) [L2591] COND FALSE !(__VERIFIER_nondet_int()) [L2607] COND FALSE !(__VERIFIER_nondet_int()) [L2623] COND FALSE !(__VERIFIER_nondet_int()) [L2639] COND FALSE !(__VERIFIER_nondet_int()) [L2655] COND FALSE !(__VERIFIER_nondet_int()) [L2671] COND FALSE !(__VERIFIER_nondet_int()) [L2687] COND FALSE !(__VERIFIER_nondet_int()) [L2703] COND FALSE !(__VERIFIER_nondet_int()) [L2719] COND FALSE !(__VERIFIER_nondet_int()) [L2735] COND FALSE !(__VERIFIER_nondet_int()) [L2751] COND FALSE !(__VERIFIER_nondet_int()) [L2767] COND FALSE !(__VERIFIER_nondet_int()) [L2783] COND FALSE !(__VERIFIER_nondet_int()) [L2799] COND FALSE !(__VERIFIER_nondet_int()) [L2815] COND FALSE !(__VERIFIER_nondet_int()) [L2831] COND FALSE !(__VERIFIER_nondet_int()) [L2847] COND FALSE !(__VERIFIER_nondet_int()) [L2863] COND FALSE !(__VERIFIER_nondet_int()) [L2879] COND FALSE !(__VERIFIER_nondet_int()) [L2895] COND FALSE !(__VERIFIER_nondet_int()) [L2911] COND FALSE !(__VERIFIER_nondet_int()) [L2927] COND FALSE !(__VERIFIER_nondet_int()) [L2943] COND FALSE !(__VERIFIER_nondet_int()) [L2959] COND FALSE !(__VERIFIER_nondet_int()) [L2975] COND FALSE !(__VERIFIER_nondet_int()) [L2991] COND FALSE !(__VERIFIER_nondet_int()) [L3007] COND FALSE !(__VERIFIER_nondet_int()) [L3023] COND FALSE !(__VERIFIER_nondet_int()) [L3039] COND FALSE !(__VERIFIER_nondet_int()) [L3055] COND FALSE !(__VERIFIER_nondet_int()) [L3071] COND FALSE !(__VERIFIER_nondet_int()) [L3087] COND FALSE !(__VERIFIER_nondet_int()) [L3103] COND FALSE !(__VERIFIER_nondet_int()) [L3119] COND FALSE !(__VERIFIER_nondet_int()) [L3135] COND FALSE !(__VERIFIER_nondet_int()) [L3151] COND FALSE !(__VERIFIER_nondet_int()) [L3167] COND FALSE !(__VERIFIER_nondet_int()) [L3183] COND FALSE !(__VERIFIER_nondet_int()) [L3199] COND FALSE !(__VERIFIER_nondet_int()) [L3215] COND FALSE !(__VERIFIER_nondet_int()) [L3231] COND FALSE !(__VERIFIER_nondet_int()) [L3247] COND FALSE !(__VERIFIER_nondet_int()) [L3263] COND FALSE !(__VERIFIER_nondet_int()) [L3279] COND FALSE !(__VERIFIER_nondet_int()) [L3295] COND FALSE !(__VERIFIER_nondet_int()) [L3311] COND FALSE !(__VERIFIER_nondet_int()) [L3327] COND FALSE !(__VERIFIER_nondet_int()) [L3343] COND FALSE !(__VERIFIER_nondet_int()) [L3359] COND FALSE !(__VERIFIER_nondet_int()) [L3375] COND FALSE !(__VERIFIER_nondet_int()) [L3391] COND FALSE !(__VERIFIER_nondet_int()) [L3407] COND FALSE !(__VERIFIER_nondet_int()) [L3423] COND FALSE !(__VERIFIER_nondet_int()) [L3439] COND FALSE !(__VERIFIER_nondet_int()) [L3455] COND FALSE !(__VERIFIER_nondet_int()) [L3471] COND FALSE !(__VERIFIER_nondet_int()) [L3487] COND FALSE !(__VERIFIER_nondet_int()) [L3503] COND FALSE !(__VERIFIER_nondet_int()) [L3519] COND FALSE !(__VERIFIER_nondet_int()) [L3535] COND FALSE !(__VERIFIER_nondet_int()) [L3551] COND FALSE !(__VERIFIER_nondet_int()) [L3567] COND FALSE !(__VERIFIER_nondet_int()) [L3583] COND FALSE !(__VERIFIER_nondet_int()) [L3599] COND FALSE !(__VERIFIER_nondet_int()) [L3615] COND FALSE !(__VERIFIER_nondet_int()) [L3631] COND FALSE !(__VERIFIER_nondet_int()) [L3647] COND FALSE !(__VERIFIER_nondet_int()) [L3663] COND FALSE !(__VERIFIER_nondet_int()) [L3679] COND FALSE !(__VERIFIER_nondet_int()) [L3695] COND FALSE !(__VERIFIER_nondet_int()) [L3711] COND FALSE !(__VERIFIER_nondet_int()) [L3727] COND FALSE !(__VERIFIER_nondet_int()) [L3743] COND FALSE !(__VERIFIER_nondet_int()) [L3759] COND FALSE !(__VERIFIER_nondet_int()) [L3775] COND FALSE !(__VERIFIER_nondet_int()) [L3791] COND FALSE !(__VERIFIER_nondet_int()) [L3807] COND FALSE !(__VERIFIER_nondet_int()) [L3823] COND FALSE !(__VERIFIER_nondet_int()) [L3839] COND FALSE !(__VERIFIER_nondet_int()) [L3855] COND FALSE !(__VERIFIER_nondet_int()) [L3871] COND FALSE !(__VERIFIER_nondet_int()) [L3887] COND FALSE !(__VERIFIER_nondet_int()) [L3903] COND FALSE !(__VERIFIER_nondet_int()) [L3919] COND FALSE !(__VERIFIER_nondet_int()) [L3935] COND FALSE !(__VERIFIER_nondet_int()) [L3951] COND FALSE !(__VERIFIER_nondet_int()) [L3967] COND FALSE !(__VERIFIER_nondet_int()) [L3983] COND FALSE !(__VERIFIER_nondet_int()) [L3999] COND FALSE !(__VERIFIER_nondet_int()) [L4015] COND FALSE !(__VERIFIER_nondet_int()) [L4031] COND FALSE !(__VERIFIER_nondet_int()) [L4047] COND FALSE !(__VERIFIER_nondet_int()) [L4063] COND FALSE !(__VERIFIER_nondet_int()) [L4079] COND FALSE !(__VERIFIER_nondet_int()) [L4095] COND FALSE !(__VERIFIER_nondet_int()) [L4111] COND FALSE !(__VERIFIER_nondet_int()) [L4127] COND FALSE !(__VERIFIER_nondet_int()) [L4143] COND FALSE !(__VERIFIER_nondet_int()) [L4159] COND FALSE !(__VERIFIER_nondet_int()) [L4175] COND FALSE !(__VERIFIER_nondet_int()) [L4191] COND FALSE !(__VERIFIER_nondet_int()) [L4207] COND FALSE !(__VERIFIER_nondet_int()) [L4223] COND FALSE !(__VERIFIER_nondet_int()) [L4239] COND FALSE !(__VERIFIER_nondet_int()) [L4255] COND FALSE !(__VERIFIER_nondet_int()) [L4271] COND FALSE !(__VERIFIER_nondet_int()) [L4287] COND FALSE !(__VERIFIER_nondet_int()) [L4303] COND FALSE !(__VERIFIER_nondet_int()) [L4319] COND FALSE !(__VERIFIER_nondet_int()) [L4335] COND FALSE !(__VERIFIER_nondet_int()) [L4351] COND FALSE !(__VERIFIER_nondet_int()) [L4367] COND FALSE !(__VERIFIER_nondet_int()) [L4383] COND FALSE !(__VERIFIER_nondet_int()) [L4399] COND FALSE !(__VERIFIER_nondet_int()) [L4415] COND FALSE !(__VERIFIER_nondet_int()) [L4431] COND FALSE !(__VERIFIER_nondet_int()) [L4447] COND FALSE !(__VERIFIER_nondet_int()) [L4463] COND FALSE !(__VERIFIER_nondet_int()) [L4479] COND FALSE !(__VERIFIER_nondet_int()) [L4495] COND FALSE !(__VERIFIER_nondet_int()) [L4511] COND FALSE !(__VERIFIER_nondet_int()) [L4527] COND TRUE __VERIFIER_nondet_int() [L4531] method_id = 18 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4533] COND FALSE !(0) [L4537] q = 4 [L4539] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L4539] this_spacecraft_cCM=this_spacecraft_cCM [L4539] this_spacecraft_cSM=this_spacecraft_cSM [L4539] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L4539] this_spacecraft_cEDS=this_spacecraft_cEDS [L4539] this_spacecraft_cLAS=0 [L4539] this_spacecraft_cStage2=this_spacecraft_cStage2 [L4539] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=1, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=1, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=1, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND FALSE !(q == 2) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=1, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4594] COND FALSE !(q == 3) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=1, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L9014] COND TRUE q == 4 [L9015] COND FALSE !(__VERIFIER_nondet_int()) [L9031] COND FALSE !(__VERIFIER_nondet_int()) [L9047] COND FALSE !(__VERIFIER_nondet_int()) [L9063] COND FALSE !(__VERIFIER_nondet_int()) [L9079] COND FALSE !(__VERIFIER_nondet_int()) [L9095] COND FALSE !(__VERIFIER_nondet_int()) [L9111] COND FALSE !(__VERIFIER_nondet_int()) [L9127] COND FALSE !(__VERIFIER_nondet_int()) [L9143] COND FALSE !(__VERIFIER_nondet_int()) [L9159] COND FALSE !(__VERIFIER_nondet_int()) [L9175] COND FALSE !(__VERIFIER_nondet_int()) [L9191] COND FALSE !(__VERIFIER_nondet_int()) [L9207] COND FALSE !(__VERIFIER_nondet_int()) [L9223] COND FALSE !(__VERIFIER_nondet_int()) [L9239] COND FALSE !(__VERIFIER_nondet_int()) [L9255] COND FALSE !(__VERIFIER_nondet_int()) [L9271] COND FALSE !(__VERIFIER_nondet_int()) [L9287] COND FALSE !(__VERIFIER_nondet_int()) [L9303] COND FALSE !(__VERIFIER_nondet_int()) [L9319] COND FALSE !(__VERIFIER_nondet_int()) [L9335] COND FALSE !(__VERIFIER_nondet_int()) [L9351] COND FALSE !(__VERIFIER_nondet_int()) [L9367] COND FALSE !(__VERIFIER_nondet_int()) [L9383] COND FALSE !(__VERIFIER_nondet_int()) [L9399] COND FALSE !(__VERIFIER_nondet_int()) [L9415] COND FALSE !(__VERIFIER_nondet_int()) [L9431] COND FALSE !(__VERIFIER_nondet_int()) [L9447] COND FALSE !(__VERIFIER_nondet_int()) [L9463] COND FALSE !(__VERIFIER_nondet_int()) [L9479] COND FALSE !(__VERIFIER_nondet_int()) [L9495] COND FALSE !(__VERIFIER_nondet_int()) [L9511] COND FALSE !(__VERIFIER_nondet_int()) [L9527] COND FALSE !(__VERIFIER_nondet_int()) [L9543] COND FALSE !(__VERIFIER_nondet_int()) [L9559] COND FALSE !(__VERIFIER_nondet_int()) [L9575] COND FALSE !(__VERIFIER_nondet_int()) [L9591] COND FALSE !(__VERIFIER_nondet_int()) [L9607] COND FALSE !(__VERIFIER_nondet_int()) [L9623] COND FALSE !(__VERIFIER_nondet_int()) [L9639] COND FALSE !(__VERIFIER_nondet_int()) [L9655] COND FALSE !(__VERIFIER_nondet_int()) [L9671] COND FALSE !(__VERIFIER_nondet_int()) [L9687] COND FALSE !(__VERIFIER_nondet_int()) [L9703] COND FALSE !(__VERIFIER_nondet_int()) [L9719] COND FALSE !(__VERIFIER_nondet_int()) [L9735] COND FALSE !(__VERIFIER_nondet_int()) [L9751] COND FALSE !(__VERIFIER_nondet_int()) [L9767] COND FALSE !(__VERIFIER_nondet_int()) [L9783] COND FALSE !(__VERIFIER_nondet_int()) [L9799] COND FALSE !(__VERIFIER_nondet_int()) [L9815] COND FALSE !(__VERIFIER_nondet_int()) [L9831] COND FALSE !(__VERIFIER_nondet_int()) [L9847] COND FALSE !(__VERIFIER_nondet_int()) [L9863] COND FALSE !(__VERIFIER_nondet_int()) [L9879] COND FALSE !(__VERIFIER_nondet_int()) [L9895] COND FALSE !(__VERIFIER_nondet_int()) [L9911] COND FALSE !(__VERIFIER_nondet_int()) [L9927] COND FALSE !(__VERIFIER_nondet_int()) [L9943] COND FALSE !(__VERIFIER_nondet_int()) [L9959] COND FALSE !(__VERIFIER_nondet_int()) [L9975] COND FALSE !(__VERIFIER_nondet_int()) [L9991] COND FALSE !(__VERIFIER_nondet_int()) [L10007] COND FALSE !(__VERIFIER_nondet_int()) [L10023] COND FALSE !(__VERIFIER_nondet_int()) [L10039] COND FALSE !(__VERIFIER_nondet_int()) [L10055] COND FALSE !(__VERIFIER_nondet_int()) [L10071] COND FALSE !(__VERIFIER_nondet_int()) [L10087] COND FALSE !(__VERIFIER_nondet_int()) [L10103] COND FALSE !(__VERIFIER_nondet_int()) [L10119] COND FALSE !(__VERIFIER_nondet_int()) [L10135] COND FALSE !(__VERIFIER_nondet_int()) [L10151] COND FALSE !(__VERIFIER_nondet_int()) [L10167] COND FALSE !(__VERIFIER_nondet_int()) [L10183] COND FALSE !(__VERIFIER_nondet_int()) [L10199] COND FALSE !(__VERIFIER_nondet_int()) [L10215] COND FALSE !(__VERIFIER_nondet_int()) [L10231] COND FALSE !(__VERIFIER_nondet_int()) [L10247] COND FALSE !(__VERIFIER_nondet_int()) [L10263] COND FALSE !(__VERIFIER_nondet_int()) [L10279] COND FALSE !(__VERIFIER_nondet_int()) [L10295] COND FALSE !(__VERIFIER_nondet_int()) [L10311] COND FALSE !(__VERIFIER_nondet_int()) [L10327] COND FALSE !(__VERIFIER_nondet_int()) [L10343] COND FALSE !(__VERIFIER_nondet_int()) [L10359] COND FALSE !(__VERIFIER_nondet_int()) [L10375] COND FALSE !(__VERIFIER_nondet_int()) [L10391] COND FALSE !(__VERIFIER_nondet_int()) [L10407] COND FALSE !(__VERIFIER_nondet_int()) [L10423] COND FALSE !(__VERIFIER_nondet_int()) [L10439] COND FALSE !(__VERIFIER_nondet_int()) [L10455] COND FALSE !(__VERIFIER_nondet_int()) [L10471] COND FALSE !(__VERIFIER_nondet_int()) [L10487] COND FALSE !(__VERIFIER_nondet_int()) [L10503] COND FALSE !(__VERIFIER_nondet_int()) [L10519] COND FALSE !(__VERIFIER_nondet_int()) [L10535] COND FALSE !(__VERIFIER_nondet_int()) [L10551] COND FALSE !(__VERIFIER_nondet_int()) [L10567] COND FALSE !(__VERIFIER_nondet_int()) [L10583] COND FALSE !(__VERIFIER_nondet_int()) [L10599] COND FALSE !(__VERIFIER_nondet_int()) [L10615] COND FALSE !(__VERIFIER_nondet_int()) [L10631] COND FALSE !(__VERIFIER_nondet_int()) [L10647] COND FALSE !(__VERIFIER_nondet_int()) [L10663] COND FALSE !(__VERIFIER_nondet_int()) [L10679] COND FALSE !(__VERIFIER_nondet_int()) [L10695] COND FALSE !(__VERIFIER_nondet_int()) [L10711] COND FALSE !(__VERIFIER_nondet_int()) [L10727] COND FALSE !(__VERIFIER_nondet_int()) [L10743] COND FALSE !(__VERIFIER_nondet_int()) [L10759] COND FALSE !(__VERIFIER_nondet_int()) [L10775] COND FALSE !(__VERIFIER_nondet_int()) [L10791] COND FALSE !(__VERIFIER_nondet_int()) [L10807] COND FALSE !(__VERIFIER_nondet_int()) [L10823] COND FALSE !(__VERIFIER_nondet_int()) [L10839] COND FALSE !(__VERIFIER_nondet_int()) [L10855] COND FALSE !(__VERIFIER_nondet_int()) [L10871] COND FALSE !(__VERIFIER_nondet_int()) [L10887] COND FALSE !(__VERIFIER_nondet_int()) [L10903] COND FALSE !(__VERIFIER_nondet_int()) [L10919] COND FALSE !(__VERIFIER_nondet_int()) [L10935] COND FALSE !(__VERIFIER_nondet_int()) [L10951] COND FALSE !(__VERIFIER_nondet_int()) [L10967] COND FALSE !(__VERIFIER_nondet_int()) [L10983] COND FALSE !(__VERIFIER_nondet_int()) [L10999] COND FALSE !(__VERIFIER_nondet_int()) [L11015] COND FALSE !(__VERIFIER_nondet_int()) [L11031] COND FALSE !(__VERIFIER_nondet_int()) [L11047] COND FALSE !(__VERIFIER_nondet_int()) [L11063] COND FALSE !(__VERIFIER_nondet_int()) [L11079] COND FALSE !(__VERIFIER_nondet_int()) [L11095] COND FALSE !(__VERIFIER_nondet_int()) [L11111] COND FALSE !(__VERIFIER_nondet_int()) [L11127] COND FALSE !(__VERIFIER_nondet_int()) [L11143] COND FALSE !(__VERIFIER_nondet_int()) [L11159] COND FALSE !(__VERIFIER_nondet_int()) [L11175] COND FALSE !(__VERIFIER_nondet_int()) [L11191] COND FALSE !(__VERIFIER_nondet_int()) [L11207] COND FALSE !(__VERIFIER_nondet_int()) [L11223] COND FALSE !(__VERIFIER_nondet_int()) [L11239] COND FALSE !(__VERIFIER_nondet_int()) [L11255] COND FALSE !(__VERIFIER_nondet_int()) [L11271] COND FALSE !(__VERIFIER_nondet_int()) [L11287] COND FALSE !(__VERIFIER_nondet_int()) [L11303] COND FALSE !(__VERIFIER_nondet_int()) [L11319] COND FALSE !(__VERIFIER_nondet_int()) [L11335] COND FALSE !(__VERIFIER_nondet_int()) [L11351] COND FALSE !(__VERIFIER_nondet_int()) [L11367] COND FALSE !(__VERIFIER_nondet_int()) [L11383] COND FALSE !(__VERIFIER_nondet_int()) [L11399] COND FALSE !(__VERIFIER_nondet_int()) [L11415] COND FALSE !(__VERIFIER_nondet_int()) [L11431] COND FALSE !(__VERIFIER_nondet_int()) [L11447] COND FALSE !(__VERIFIER_nondet_int()) [L11463] COND FALSE !(__VERIFIER_nondet_int()) [L11479] COND FALSE !(__VERIFIER_nondet_int()) [L11495] COND FALSE !(__VERIFIER_nondet_int()) [L11511] COND FALSE !(__VERIFIER_nondet_int()) [L11527] COND FALSE !(__VERIFIER_nondet_int()) [L11543] COND FALSE !(__VERIFIER_nondet_int()) [L11559] COND FALSE !(__VERIFIER_nondet_int()) [L11575] COND FALSE !(__VERIFIER_nondet_int()) [L11591] COND FALSE !(__VERIFIER_nondet_int()) [L11607] COND FALSE !(__VERIFIER_nondet_int()) [L11623] COND FALSE !(__VERIFIER_nondet_int()) [L11639] COND FALSE !(__VERIFIER_nondet_int()) [L11655] COND FALSE !(__VERIFIER_nondet_int()) [L11671] COND FALSE !(__VERIFIER_nondet_int()) [L11687] COND FALSE !(__VERIFIER_nondet_int()) [L11703] COND FALSE !(__VERIFIER_nondet_int()) [L11719] COND FALSE !(__VERIFIER_nondet_int()) [L11735] COND FALSE !(__VERIFIER_nondet_int()) [L11751] COND FALSE !(__VERIFIER_nondet_int()) [L11767] COND FALSE !(__VERIFIER_nondet_int()) [L11783] COND FALSE !(__VERIFIER_nondet_int()) [L11799] COND FALSE !(__VERIFIER_nondet_int()) [L11815] COND FALSE !(__VERIFIER_nondet_int()) [L11831] COND FALSE !(__VERIFIER_nondet_int()) [L11847] COND FALSE !(__VERIFIER_nondet_int()) [L11863] COND FALSE !(__VERIFIER_nondet_int()) [L11879] COND FALSE !(__VERIFIER_nondet_int()) [L11895] COND FALSE !(__VERIFIER_nondet_int()) [L11911] COND FALSE !(__VERIFIER_nondet_int()) [L11927] COND FALSE !(__VERIFIER_nondet_int()) [L11943] COND FALSE !(__VERIFIER_nondet_int()) [L11959] COND FALSE !(__VERIFIER_nondet_int()) [L11975] COND FALSE !(__VERIFIER_nondet_int()) [L11991] COND FALSE !(__VERIFIER_nondet_int()) [L12007] COND FALSE !(__VERIFIER_nondet_int()) [L12023] COND FALSE !(__VERIFIER_nondet_int()) [L12039] COND FALSE !(__VERIFIER_nondet_int()) [L12055] COND FALSE !(__VERIFIER_nondet_int()) [L12071] COND FALSE !(__VERIFIER_nondet_int()) [L12087] COND FALSE !(__VERIFIER_nondet_int()) [L12103] COND FALSE !(__VERIFIER_nondet_int()) [L12119] COND FALSE !(__VERIFIER_nondet_int()) [L12135] COND FALSE !(__VERIFIER_nondet_int()) [L12151] COND FALSE !(__VERIFIER_nondet_int()) [L12167] COND FALSE !(__VERIFIER_nondet_int()) [L12183] COND FALSE !(__VERIFIER_nondet_int()) [L12199] COND FALSE !(__VERIFIER_nondet_int()) [L12215] COND FALSE !(__VERIFIER_nondet_int()) [L12231] COND FALSE !(__VERIFIER_nondet_int()) [L12247] COND FALSE !(__VERIFIER_nondet_int()) [L12263] COND FALSE !(__VERIFIER_nondet_int()) [L12279] COND FALSE !(__VERIFIER_nondet_int()) [L12295] COND FALSE !(__VERIFIER_nondet_int()) [L12311] COND FALSE !(__VERIFIER_nondet_int()) [L12327] COND FALSE !(__VERIFIER_nondet_int()) [L12343] COND FALSE !(__VERIFIER_nondet_int()) [L12359] COND FALSE !(__VERIFIER_nondet_int()) [L12375] COND FALSE !(__VERIFIER_nondet_int()) [L12391] COND FALSE !(__VERIFIER_nondet_int()) [L12407] COND FALSE !(__VERIFIER_nondet_int()) [L12423] COND FALSE !(__VERIFIER_nondet_int()) [L12439] COND FALSE !(__VERIFIER_nondet_int()) [L12455] COND FALSE !(__VERIFIER_nondet_int()) [L12471] COND FALSE !(__VERIFIER_nondet_int()) [L12487] COND FALSE !(__VERIFIER_nondet_int()) [L12503] COND FALSE !(__VERIFIER_nondet_int()) [L12519] COND FALSE !(__VERIFIER_nondet_int()) [L12535] COND FALSE !(__VERIFIER_nondet_int()) [L12551] COND FALSE !(__VERIFIER_nondet_int()) [L12567] COND FALSE !(__VERIFIER_nondet_int()) [L12583] COND FALSE !(__VERIFIER_nondet_int()) [L12599] COND FALSE !(__VERIFIER_nondet_int()) [L12615] COND FALSE !(__VERIFIER_nondet_int()) [L12631] COND FALSE !(__VERIFIER_nondet_int()) [L12647] COND FALSE !(__VERIFIER_nondet_int()) [L12663] COND FALSE !(__VERIFIER_nondet_int()) [L12679] COND FALSE !(__VERIFIER_nondet_int()) [L12695] COND FALSE !(__VERIFIER_nondet_int()) [L12711] COND FALSE !(__VERIFIER_nondet_int()) [L12727] COND FALSE !(__VERIFIER_nondet_int()) [L12743] COND FALSE !(__VERIFIER_nondet_int()) [L12759] COND FALSE !(__VERIFIER_nondet_int()) [L12775] COND FALSE !(__VERIFIER_nondet_int()) [L12791] COND FALSE !(__VERIFIER_nondet_int()) [L12807] COND FALSE !(__VERIFIER_nondet_int()) [L12823] COND FALSE !(__VERIFIER_nondet_int()) [L12839] COND FALSE !(__VERIFIER_nondet_int()) [L12855] COND FALSE !(__VERIFIER_nondet_int()) [L12871] COND FALSE !(__VERIFIER_nondet_int()) [L12887] COND FALSE !(__VERIFIER_nondet_int()) [L12903] COND FALSE !(__VERIFIER_nondet_int()) [L12919] COND FALSE !(__VERIFIER_nondet_int()) [L12935] COND FALSE !(__VERIFIER_nondet_int()) [L12951] COND FALSE !(__VERIFIER_nondet_int()) [L12967] COND FALSE !(__VERIFIER_nondet_int()) [L12983] COND FALSE !(__VERIFIER_nondet_int()) [L12999] COND FALSE !(__VERIFIER_nondet_int()) [L13015] COND FALSE !(__VERIFIER_nondet_int()) [L13031] COND FALSE !(__VERIFIER_nondet_int()) [L13047] COND FALSE !(__VERIFIER_nondet_int()) [L13063] COND FALSE !(__VERIFIER_nondet_int()) [L13079] COND FALSE !(__VERIFIER_nondet_int()) [L13095] COND FALSE !(__VERIFIER_nondet_int()) [L13111] COND FALSE !(__VERIFIER_nondet_int()) [L13127] COND FALSE !(__VERIFIER_nondet_int()) [L13143] COND FALSE !(__VERIFIER_nondet_int()) [L13159] COND FALSE !(__VERIFIER_nondet_int()) [L13175] COND FALSE !(__VERIFIER_nondet_int()) [L13191] COND FALSE !(__VERIFIER_nondet_int()) [L13207] COND FALSE !(__VERIFIER_nondet_int()) [L13223] COND FALSE !(__VERIFIER_nondet_int()) [L13239] COND FALSE !(__VERIFIER_nondet_int()) [L13255] COND FALSE !(__VERIFIER_nondet_int()) [L13271] COND FALSE !(__VERIFIER_nondet_int()) [L13287] COND FALSE !(__VERIFIER_nondet_int()) [L13303] COND FALSE !(__VERIFIER_nondet_int()) [L13319] COND FALSE !(__VERIFIER_nondet_int()) [L13335] COND FALSE !(__VERIFIER_nondet_int()) [L13351] COND FALSE !(__VERIFIER_nondet_int()) [L13367] COND FALSE !(__VERIFIER_nondet_int()) [L13383] COND FALSE !(__VERIFIER_nondet_int()) [L13399] COND FALSE !(__VERIFIER_nondet_int()) [L13415] COND TRUE __VERIFIER_nondet_int() [L13419] method_id = 21 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=1, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L13421] COND TRUE (!this_spacecraft_cEDS && (!this_spacecraft_cLSAM_ASCENT && (!this_spacecraft_cSM && !this_spacecraft_cLAS))) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=1, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L26700] __VERIFIER_error() VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=1, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 5012 locations, 1 error locations. UNSAFE Result, 7.6s OverallTime, 19 OverallIterations, 5 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96828 SDtfs, 43630 SDslu, 71188 SDs, 0 SdLazy, 2173 SolverSat, 852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20260occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 294 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 5158 NumberOfCodeBlocks, 5158 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4550 ConstructedInterpolants, 0 QuantifiedInterpolants, 6489767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 211/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...