./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_cev_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_cev_1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/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.25-f470102 [2019-12-07 19:15:30,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:15:30,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:15:30,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:15:30,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:15:30,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:15:30,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:15:30,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:15:30,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:15:30,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:15:30,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:15:30,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:15:30,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:15:30,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:15:30,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:15:30,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:15:30,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:15:30,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:15:30,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:15:30,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:15:30,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:15:30,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:15:30,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:15:30,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:15:30,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:15:30,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:15:30,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:15:30,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:15:30,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:15:30,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:15:30,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:15:30,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:15:30,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:15:30,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:15:30,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:15:30,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:15:30,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:15:30,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:15:30,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:15:30,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:15:30,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:15:30,564 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:15:30,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:15:30,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:15:30,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:15:30,575 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:15:30,575 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:15:30,575 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:15:30,576 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:15:30,576 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:15:30,576 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:15:30,576 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:15:30,576 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:15:30,576 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:15:30,576 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:15:30,577 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:15:30,577 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:15:30,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:15:30,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:15:30,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:15:30,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:15:30,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:15:30,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:15:30,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:15:30,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:15:30,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:15:30,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:15:30,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:15:30,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:15:30,579 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:15:30,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:15:30,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:15:30,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:15:30,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:15:30,580 INFO L138 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/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/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 [2019-12-07 19:15:30,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:15:30,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:15:30,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:15:30,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:15:30,697 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:15:30,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/../../sv-benchmarks/c/psyco/psyco_cev_1.c [2019-12-07 19:15:30,739 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/data/1dc909623/aab85cf4818b4c51bf5a8461d6e23b6d/FLAGba55f95f1 [2019-12-07 19:15:35,490 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:15:35,491 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/sv-benchmarks/c/psyco/psyco_cev_1.c [2019-12-07 19:15:36,376 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/data/1dc909623/aab85cf4818b4c51bf5a8461d6e23b6d/FLAGba55f95f1 [2019-12-07 19:15:36,790 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/data/1dc909623/aab85cf4818b4c51bf5a8461d6e23b6d [2019-12-07 19:15:36,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:15:36,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:15:36,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:15:36,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:15:36,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:15:36,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:15:36" (1/1) ... [2019-12-07 19:15:36,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a8f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:15:36, skipping insertion in model container [2019-12-07 19:15:36,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:15:36" (1/1) ... [2019-12-07 19:15:36,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:15:41,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:16:55,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:16:55,499 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:17:57,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:17:57,901 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:17:57,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57 WrapperNode [2019-12-07 19:17:57,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:17:57,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:17:57,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:17:57,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:17:57,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:00,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:14,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:18:14,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:18:14,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:18:14,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:18:14,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:14,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:16,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:16,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:20,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:28,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:30,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... [2019-12-07 19:18:33,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:18:33,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:18:33,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:18:33,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:18:33,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/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 [2019-12-07 19:18:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:18:33,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:18:44,928 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:18:44,928 INFO L287 CfgBuilder]: Removed 126 assume(true) statements. [2019-12-07 19:18:44,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:18:44 BoogieIcfgContainer [2019-12-07 19:18:44,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:18:44,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:18:44,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:18:44,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:18:44,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:15:36" (1/3) ... [2019-12-07 19:18:44,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5ab610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:18:44, skipping insertion in model container [2019-12-07 19:18:44,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:17:57" (2/3) ... [2019-12-07 19:18:44,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5ab610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:18:44, skipping insertion in model container [2019-12-07 19:18:44,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:18:44" (3/3) ... [2019-12-07 19:18:44,938 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_cev_1.c [2019-12-07 19:18:44,947 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:18:44,956 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:18:44,964 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:18:44,993 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:18:44,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:18:44,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:18:44,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:18:44,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:18:44,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:18:44,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:18:44,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:18:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5005 states. [2019-12-07 19:18:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:18:45,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:45,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:45,048 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:45,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:45,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1974014897, now seen corresponding path program 1 times [2019-12-07 19:18:45,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:45,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081246179] [2019-12-07 19:18:45,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:18:45,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081246179] [2019-12-07 19:18:45,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:45,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:18:45,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872081870] [2019-12-07 19:18:45,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 19:18:45,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 19:18:45,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:18:45,186 INFO L87 Difference]: Start difference. First operand 5005 states. Second operand 2 states. [2019-12-07 19:18:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:45,276 INFO L93 Difference]: Finished difference Result 8473 states and 16933 transitions. [2019-12-07 19:18:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:18:45,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 19:18:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:45,302 INFO L225 Difference]: With dead ends: 8473 [2019-12-07 19:18:45,302 INFO L226 Difference]: Without dead ends: 3438 [2019-12-07 19:18:45,312 INFO L630 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 [2019-12-07 19:18:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2019-12-07 19:18:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3438. [2019-12-07 19:18:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2019-12-07 19:18:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 5111 transitions. [2019-12-07 19:18:45,408 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 5111 transitions. Word has length 8 [2019-12-07 19:18:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:45,409 INFO L462 AbstractCegarLoop]: Abstraction has 3438 states and 5111 transitions. [2019-12-07 19:18:45,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 19:18:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 5111 transitions. [2019-12-07 19:18:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:18:45,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:45,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:45,409 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1596623639, now seen corresponding path program 1 times [2019-12-07 19:18:45,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:45,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210924232] [2019-12-07 19:18:45,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:18:45,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210924232] [2019-12-07 19:18:45,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:45,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:18:45,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382529809] [2019-12-07 19:18:45,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:45,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:45,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:45,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:45,451 INFO L87 Difference]: Start difference. First operand 3438 states and 5111 transitions. Second operand 3 states. [2019-12-07 19:18:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:45,658 INFO L93 Difference]: Finished difference Result 6878 states and 10225 transitions. [2019-12-07 19:18:45,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:45,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 19:18:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:45,671 INFO L225 Difference]: With dead ends: 6878 [2019-12-07 19:18:45,671 INFO L226 Difference]: Without dead ends: 3441 [2019-12-07 19:18:45,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2019-12-07 19:18:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3441. [2019-12-07 19:18:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3441 states. [2019-12-07 19:18:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 5114 transitions. [2019-12-07 19:18:45,726 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 5114 transitions. Word has length 9 [2019-12-07 19:18:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:45,726 INFO L462 AbstractCegarLoop]: Abstraction has 3441 states and 5114 transitions. [2019-12-07 19:18:45,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 5114 transitions. [2019-12-07 19:18:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:18:45,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:45,727 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:45,727 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:45,728 INFO L82 PathProgramCache]: Analyzing trace with hash 833523668, now seen corresponding path program 1 times [2019-12-07 19:18:45,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:45,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197321381] [2019-12-07 19:18:45,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:18:45,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197321381] [2019-12-07 19:18:45,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:45,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:45,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268879857] [2019-12-07 19:18:45,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:45,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:45,767 INFO L87 Difference]: Start difference. First operand 3441 states and 5114 transitions. Second operand 3 states. [2019-12-07 19:18:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:45,928 INFO L93 Difference]: Finished difference Result 6866 states and 10208 transitions. [2019-12-07 19:18:45,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:45,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 19:18:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:45,942 INFO L225 Difference]: With dead ends: 6866 [2019-12-07 19:18:45,942 INFO L226 Difference]: Without dead ends: 3427 [2019-12-07 19:18:45,946 INFO L630 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 [2019-12-07 19:18:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2019-12-07 19:18:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3427. [2019-12-07 19:18:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-12-07 19:18:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 5094 transitions. [2019-12-07 19:18:45,993 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 5094 transitions. Word has length 14 [2019-12-07 19:18:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:45,994 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 5094 transitions. [2019-12-07 19:18:45,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 5094 transitions. [2019-12-07 19:18:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:18:45,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:45,995 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:45,995 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:45,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1800100549, now seen corresponding path program 1 times [2019-12-07 19:18:45,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:45,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343949035] [2019-12-07 19:18:45,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:18:46,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343949035] [2019-12-07 19:18:46,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:46,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:18:46,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834961818] [2019-12-07 19:18:46,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:46,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:46,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:46,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:46,031 INFO L87 Difference]: Start difference. First operand 3427 states and 5094 transitions. Second operand 3 states. [2019-12-07 19:18:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:46,412 INFO L93 Difference]: Finished difference Result 10261 states and 15260 transitions. [2019-12-07 19:18:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:46,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 19:18:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:46,441 INFO L225 Difference]: With dead ends: 10261 [2019-12-07 19:18:46,442 INFO L226 Difference]: Without dead ends: 6831 [2019-12-07 19:18:46,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6831 states. [2019-12-07 19:18:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6831 to 6787. [2019-12-07 19:18:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6787 states. [2019-12-07 19:18:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6787 states to 6787 states and 10102 transitions. [2019-12-07 19:18:46,545 INFO L78 Accepts]: Start accepts. Automaton has 6787 states and 10102 transitions. Word has length 17 [2019-12-07 19:18:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:46,546 INFO L462 AbstractCegarLoop]: Abstraction has 6787 states and 10102 transitions. [2019-12-07 19:18:46,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6787 states and 10102 transitions. [2019-12-07 19:18:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:18:46,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:46,547 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:18:46,547 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 327252739, now seen corresponding path program 1 times [2019-12-07 19:18:46,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:46,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096247112] [2019-12-07 19:18:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:18:46,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096247112] [2019-12-07 19:18:46,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:46,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:46,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857581699] [2019-12-07 19:18:46,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:46,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:46,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:46,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:46,584 INFO L87 Difference]: Start difference. First operand 6787 states and 10102 transitions. Second operand 3 states. [2019-12-07 19:18:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:46,820 INFO L93 Difference]: Finished difference Result 13577 states and 20207 transitions. [2019-12-07 19:18:46,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:46,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:18:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:46,856 INFO L225 Difference]: With dead ends: 13577 [2019-12-07 19:18:46,856 INFO L226 Difference]: Without dead ends: 6797 [2019-12-07 19:18:46,865 INFO L630 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 [2019-12-07 19:18:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6797 states. [2019-12-07 19:18:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6797 to 6795. [2019-12-07 19:18:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6795 states. [2019-12-07 19:18:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6795 states to 6795 states and 10110 transitions. [2019-12-07 19:18:46,978 INFO L78 Accepts]: Start accepts. Automaton has 6795 states and 10110 transitions. Word has length 20 [2019-12-07 19:18:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:46,978 INFO L462 AbstractCegarLoop]: Abstraction has 6795 states and 10110 transitions. [2019-12-07 19:18:46,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6795 states and 10110 transitions. [2019-12-07 19:18:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:18:46,980 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:46,980 INFO L410 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] [2019-12-07 19:18:46,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash -29332125, now seen corresponding path program 1 times [2019-12-07 19:18:46,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:46,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26885554] [2019-12-07 19:18:46,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:18:47,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26885554] [2019-12-07 19:18:47,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:47,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:47,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467739244] [2019-12-07 19:18:47,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:47,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:47,020 INFO L87 Difference]: Start difference. First operand 6795 states and 10110 transitions. Second operand 3 states. [2019-12-07 19:18:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:47,316 INFO L93 Difference]: Finished difference Result 13595 states and 20227 transitions. [2019-12-07 19:18:47,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:47,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 19:18:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:47,330 INFO L225 Difference]: With dead ends: 13595 [2019-12-07 19:18:47,331 INFO L226 Difference]: Without dead ends: 6807 [2019-12-07 19:18:47,338 INFO L630 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 [2019-12-07 19:18:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2019-12-07 19:18:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 6805. [2019-12-07 19:18:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2019-12-07 19:18:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 10120 transitions. [2019-12-07 19:18:47,429 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 10120 transitions. Word has length 28 [2019-12-07 19:18:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:47,429 INFO L462 AbstractCegarLoop]: Abstraction has 6805 states and 10120 transitions. [2019-12-07 19:18:47,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 10120 transitions. [2019-12-07 19:18:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-12-07 19:18:47,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:47,435 INFO L410 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] [2019-12-07 19:18:47,435 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1317626767, now seen corresponding path program 1 times [2019-12-07 19:18:47,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:47,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015121560] [2019-12-07 19:18:47,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:18:47,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015121560] [2019-12-07 19:18:47,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:47,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:18:47,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214793948] [2019-12-07 19:18:47,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:47,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:47,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:47,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:47,657 INFO L87 Difference]: Start difference. First operand 6805 states and 10120 transitions. Second operand 3 states. [2019-12-07 19:18:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:47,844 INFO L93 Difference]: Finished difference Result 7378 states and 10965 transitions. [2019-12-07 19:18:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:47,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-12-07 19:18:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:47,857 INFO L225 Difference]: With dead ends: 7378 [2019-12-07 19:18:47,857 INFO L226 Difference]: Without dead ends: 7372 [2019-12-07 19:18:47,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7372 states. [2019-12-07 19:18:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7372 to 7364. [2019-12-07 19:18:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7364 states. [2019-12-07 19:18:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 10951 transitions. [2019-12-07 19:18:47,941 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 10951 transitions. Word has length 280 [2019-12-07 19:18:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:47,942 INFO L462 AbstractCegarLoop]: Abstraction has 7364 states and 10951 transitions. [2019-12-07 19:18:47,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 10951 transitions. [2019-12-07 19:18:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 19:18:47,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:47,945 INFO L410 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] [2019-12-07 19:18:47,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:47,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2114031622, now seen corresponding path program 1 times [2019-12-07 19:18:47,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:47,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350086559] [2019-12-07 19:18:47,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:18:48,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350086559] [2019-12-07 19:18:48,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:48,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:18:48,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850135435] [2019-12-07 19:18:48,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:48,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:48,210 INFO L87 Difference]: Start difference. First operand 7364 states and 10951 transitions. Second operand 3 states. [2019-12-07 19:18:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:48,574 INFO L93 Difference]: Finished difference Result 20954 states and 31169 transitions. [2019-12-07 19:18:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:48,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-12-07 19:18:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:48,595 INFO L225 Difference]: With dead ends: 20954 [2019-12-07 19:18:48,596 INFO L226 Difference]: Without dead ends: 14156 [2019-12-07 19:18:48,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-07 19:18:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 14116. [2019-12-07 19:18:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14116 states. [2019-12-07 19:18:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 21000 transitions. [2019-12-07 19:18:48,746 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 21000 transitions. Word has length 281 [2019-12-07 19:18:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:48,746 INFO L462 AbstractCegarLoop]: Abstraction has 14116 states and 21000 transitions. [2019-12-07 19:18:48,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 21000 transitions. [2019-12-07 19:18:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-12-07 19:18:48,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:48,750 INFO L410 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] [2019-12-07 19:18:48,750 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash 521988626, now seen corresponding path program 1 times [2019-12-07 19:18:48,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:48,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640792753] [2019-12-07 19:18:48,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:18:48,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640792753] [2019-12-07 19:18:48,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:48,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:48,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426834508] [2019-12-07 19:18:48,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:48,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:48,906 INFO L87 Difference]: Start difference. First operand 14116 states and 21000 transitions. Second operand 3 states. [2019-12-07 19:18:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:49,160 INFO L93 Difference]: Finished difference Result 27666 states and 41162 transitions. [2019-12-07 19:18:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:49,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-12-07 19:18:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:49,181 INFO L225 Difference]: With dead ends: 27666 [2019-12-07 19:18:49,181 INFO L226 Difference]: Without dead ends: 14116 [2019-12-07 19:18:49,193 INFO L630 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 [2019-12-07 19:18:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14116 states. [2019-12-07 19:18:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14116 to 14110. [2019-12-07 19:18:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14110 states. [2019-12-07 19:18:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14110 states to 14110 states and 20983 transitions. [2019-12-07 19:18:49,325 INFO L78 Accepts]: Start accepts. Automaton has 14110 states and 20983 transitions. Word has length 289 [2019-12-07 19:18:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:49,325 INFO L462 AbstractCegarLoop]: Abstraction has 14110 states and 20983 transitions. [2019-12-07 19:18:49,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14110 states and 20983 transitions. [2019-12-07 19:18:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-12-07 19:18:49,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:49,329 INFO L410 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] [2019-12-07 19:18:49,329 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1482940028, now seen corresponding path program 1 times [2019-12-07 19:18:49,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:49,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978753687] [2019-12-07 19:18:49,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:18:49,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978753687] [2019-12-07 19:18:49,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:49,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:49,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621876836] [2019-12-07 19:18:49,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:49,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:49,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:49,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:49,442 INFO L87 Difference]: Start difference. First operand 14110 states and 20983 transitions. Second operand 3 states. [2019-12-07 19:18:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:49,616 INFO L93 Difference]: Finished difference Result 22609 states and 33613 transitions. [2019-12-07 19:18:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:49,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-12-07 19:18:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:49,643 INFO L225 Difference]: With dead ends: 22609 [2019-12-07 19:18:49,643 INFO L226 Difference]: Without dead ends: 9065 [2019-12-07 19:18:49,654 INFO L630 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 [2019-12-07 19:18:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2019-12-07 19:18:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 9063. [2019-12-07 19:18:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2019-12-07 19:18:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 13458 transitions. [2019-12-07 19:18:49,751 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 13458 transitions. Word has length 298 [2019-12-07 19:18:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:49,751 INFO L462 AbstractCegarLoop]: Abstraction has 9063 states and 13458 transitions. [2019-12-07 19:18:49,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 13458 transitions. [2019-12-07 19:18:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-12-07 19:18:49,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:49,755 INFO L410 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] [2019-12-07 19:18:49,755 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:49,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash 101111048, now seen corresponding path program 1 times [2019-12-07 19:18:49,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:49,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473894561] [2019-12-07 19:18:49,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:18:49,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473894561] [2019-12-07 19:18:49,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:49,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:49,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668992366] [2019-12-07 19:18:49,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:49,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:49,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:49,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:49,886 INFO L87 Difference]: Start difference. First operand 9063 states and 13458 transitions. Second operand 3 states. [2019-12-07 19:18:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:50,029 INFO L93 Difference]: Finished difference Result 15306 states and 22723 transitions. [2019-12-07 19:18:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:50,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-12-07 19:18:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:50,038 INFO L225 Difference]: With dead ends: 15306 [2019-12-07 19:18:50,038 INFO L226 Difference]: Without dead ends: 6809 [2019-12-07 19:18:50,043 INFO L630 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 [2019-12-07 19:18:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2019-12-07 19:18:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 6807. [2019-12-07 19:18:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-07 19:18:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 10099 transitions. [2019-12-07 19:18:50,099 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 10099 transitions. Word has length 299 [2019-12-07 19:18:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:50,100 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 10099 transitions. [2019-12-07 19:18:50,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 10099 transitions. [2019-12-07 19:18:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-12-07 19:18:50,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:50,104 INFO L410 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] [2019-12-07 19:18:50,104 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash -645815740, now seen corresponding path program 1 times [2019-12-07 19:18:50,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:50,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515142206] [2019-12-07 19:18:50,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:18:50,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515142206] [2019-12-07 19:18:50,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:50,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:50,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535403553] [2019-12-07 19:18:50,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:18:50,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:18:50,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:18:50,949 INFO L87 Difference]: Start difference. First operand 6807 states and 10099 transitions. Second operand 4 states. [2019-12-07 19:18:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:51,232 INFO L93 Difference]: Finished difference Result 7951 states and 11789 transitions. [2019-12-07 19:18:51,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:18:51,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-12-07 19:18:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:51,240 INFO L225 Difference]: With dead ends: 7951 [2019-12-07 19:18:51,240 INFO L226 Difference]: Without dead ends: 7949 [2019-12-07 19:18:51,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:18:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7949 states. [2019-12-07 19:18:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7949 to 7939. [2019-12-07 19:18:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7939 states. [2019-12-07 19:18:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7939 states to 7939 states and 11778 transitions. [2019-12-07 19:18:51,300 INFO L78 Accepts]: Start accepts. Automaton has 7939 states and 11778 transitions. Word has length 299 [2019-12-07 19:18:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:51,300 INFO L462 AbstractCegarLoop]: Abstraction has 7939 states and 11778 transitions. [2019-12-07 19:18:51,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:18:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 11778 transitions. [2019-12-07 19:18:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-12-07 19:18:51,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:51,303 INFO L410 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] [2019-12-07 19:18:51,303 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 260687844, now seen corresponding path program 1 times [2019-12-07 19:18:51,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:51,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209281296] [2019-12-07 19:18:51,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:18:51,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209281296] [2019-12-07 19:18:51,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:51,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:51,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137044356] [2019-12-07 19:18:51,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:51,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:51,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:51,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:51,403 INFO L87 Difference]: Start difference. First operand 7939 states and 11778 transitions. Second operand 3 states. [2019-12-07 19:18:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:51,626 INFO L93 Difference]: Finished difference Result 13639 states and 20227 transitions. [2019-12-07 19:18:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:51,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-12-07 19:18:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:51,634 INFO L225 Difference]: With dead ends: 13639 [2019-12-07 19:18:51,635 INFO L226 Difference]: Without dead ends: 7971 [2019-12-07 19:18:51,638 INFO L630 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 [2019-12-07 19:18:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7971 states. [2019-12-07 19:18:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7971 to 7943. [2019-12-07 19:18:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7943 states. [2019-12-07 19:18:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 11779 transitions. [2019-12-07 19:18:51,697 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 11779 transitions. Word has length 301 [2019-12-07 19:18:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:51,698 INFO L462 AbstractCegarLoop]: Abstraction has 7943 states and 11779 transitions. [2019-12-07 19:18:51,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 11779 transitions. [2019-12-07 19:18:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-12-07 19:18:51,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:51,700 INFO L410 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] [2019-12-07 19:18:51,701 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1186969471, now seen corresponding path program 1 times [2019-12-07 19:18:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:51,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013085611] [2019-12-07 19:18:51,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:18:51,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013085611] [2019-12-07 19:18:51,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:51,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:51,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698798186] [2019-12-07 19:18:51,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:51,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:51,803 INFO L87 Difference]: Start difference. First operand 7943 states and 11779 transitions. Second operand 3 states. [2019-12-07 19:18:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:51,939 INFO L93 Difference]: Finished difference Result 11365 states and 16847 transitions. [2019-12-07 19:18:51,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:51,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-12-07 19:18:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:51,945 INFO L225 Difference]: With dead ends: 11365 [2019-12-07 19:18:51,945 INFO L226 Difference]: Without dead ends: 5697 [2019-12-07 19:18:51,948 INFO L630 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 [2019-12-07 19:18:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2019-12-07 19:18:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 5695. [2019-12-07 19:18:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5695 states. [2019-12-07 19:18:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 8432 transitions. [2019-12-07 19:18:52,024 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 8432 transitions. Word has length 302 [2019-12-07 19:18:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:52,025 INFO L462 AbstractCegarLoop]: Abstraction has 5695 states and 8432 transitions. [2019-12-07 19:18:52,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 8432 transitions. [2019-12-07 19:18:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-12-07 19:18:52,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:52,030 INFO L410 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] [2019-12-07 19:18:52,030 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1899417793, now seen corresponding path program 1 times [2019-12-07 19:18:52,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:52,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788874589] [2019-12-07 19:18:52,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 19:18:52,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788874589] [2019-12-07 19:18:52,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:52,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:52,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043445996] [2019-12-07 19:18:52,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:52,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:52,150 INFO L87 Difference]: Start difference. First operand 5695 states and 8432 transitions. Second operand 3 states. [2019-12-07 19:18:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:52,271 INFO L93 Difference]: Finished difference Result 8549 states and 12656 transitions. [2019-12-07 19:18:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:52,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-12-07 19:18:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:52,275 INFO L225 Difference]: With dead ends: 8549 [2019-12-07 19:18:52,275 INFO L226 Difference]: Without dead ends: 5129 [2019-12-07 19:18:52,277 INFO L630 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 [2019-12-07 19:18:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2019-12-07 19:18:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 5127. [2019-12-07 19:18:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5127 states. [2019-12-07 19:18:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 7589 transitions. [2019-12-07 19:18:52,312 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 7589 transitions. Word has length 316 [2019-12-07 19:18:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:52,313 INFO L462 AbstractCegarLoop]: Abstraction has 5127 states and 7589 transitions. [2019-12-07 19:18:52,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 7589 transitions. [2019-12-07 19:18:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-12-07 19:18:52,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:52,320 INFO L410 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] [2019-12-07 19:18:52,320 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1494620892, now seen corresponding path program 1 times [2019-12-07 19:18:52,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:52,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376106587] [2019-12-07 19:18:52,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:18:52,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376106587] [2019-12-07 19:18:52,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:52,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:52,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456745366] [2019-12-07 19:18:52,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:52,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:52,623 INFO L87 Difference]: Start difference. First operand 5127 states and 7589 transitions. Second operand 3 states. [2019-12-07 19:18:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:52,865 INFO L93 Difference]: Finished difference Result 10263 states and 15191 transitions. [2019-12-07 19:18:52,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:52,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 565 [2019-12-07 19:18:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:52,872 INFO L225 Difference]: With dead ends: 10263 [2019-12-07 19:18:52,872 INFO L226 Difference]: Without dead ends: 7403 [2019-12-07 19:18:52,875 INFO L630 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 [2019-12-07 19:18:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2019-12-07 19:18:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 7385. [2019-12-07 19:18:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7385 states. [2019-12-07 19:18:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 10937 transitions. [2019-12-07 19:18:52,936 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 10937 transitions. Word has length 565 [2019-12-07 19:18:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:52,937 INFO L462 AbstractCegarLoop]: Abstraction has 7385 states and 10937 transitions. [2019-12-07 19:18:52,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 10937 transitions. [2019-12-07 19:18:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2019-12-07 19:18:52,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:52,945 INFO L410 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] [2019-12-07 19:18:52,945 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2075086280, now seen corresponding path program 1 times [2019-12-07 19:18:52,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:52,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020794203] [2019-12-07 19:18:52,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 19:18:53,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020794203] [2019-12-07 19:18:53,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:53,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:18:53,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664559677] [2019-12-07 19:18:53,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:53,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:53,313 INFO L87 Difference]: Start difference. First operand 7385 states and 10937 transitions. Second operand 3 states. [2019-12-07 19:18:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:53,587 INFO L93 Difference]: Finished difference Result 18741 states and 27757 transitions. [2019-12-07 19:18:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:53,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 571 [2019-12-07 19:18:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:53,599 INFO L225 Difference]: With dead ends: 18741 [2019-12-07 19:18:53,599 INFO L226 Difference]: Without dead ends: 13627 [2019-12-07 19:18:53,603 INFO L630 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 [2019-12-07 19:18:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13627 states. [2019-12-07 19:18:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13627 to 13541. [2019-12-07 19:18:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13541 states. [2019-12-07 19:18:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13541 states to 13541 states and 20093 transitions. [2019-12-07 19:18:53,711 INFO L78 Accepts]: Start accepts. Automaton has 13541 states and 20093 transitions. Word has length 571 [2019-12-07 19:18:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:53,712 INFO L462 AbstractCegarLoop]: Abstraction has 13541 states and 20093 transitions. [2019-12-07 19:18:53,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 13541 states and 20093 transitions. [2019-12-07 19:18:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-12-07 19:18:53,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:53,726 INFO L410 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] [2019-12-07 19:18:53,727 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1914421398, now seen corresponding path program 1 times [2019-12-07 19:18:53,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:53,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932386193] [2019-12-07 19:18:53,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:18:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 19:18:54,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932386193] [2019-12-07 19:18:54,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:18:54,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:18:54,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390255877] [2019-12-07 19:18:54,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:18:54,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:18:54,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:18:54,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:18:54,043 INFO L87 Difference]: Start difference. First operand 13541 states and 20093 transitions. Second operand 3 states. [2019-12-07 19:18:54,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:18:54,253 INFO L93 Difference]: Finished difference Result 20305 states and 30131 transitions. [2019-12-07 19:18:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:18:54,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 581 [2019-12-07 19:18:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:18:54,269 INFO L225 Difference]: With dead ends: 20305 [2019-12-07 19:18:54,269 INFO L226 Difference]: Without dead ends: 20297 [2019-12-07 19:18:54,273 INFO L630 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 [2019-12-07 19:18:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20297 states. [2019-12-07 19:18:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20297 to 20255. [2019-12-07 19:18:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20255 states. [2019-12-07 19:18:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20255 states to 20255 states and 30077 transitions. [2019-12-07 19:18:54,428 INFO L78 Accepts]: Start accepts. Automaton has 20255 states and 30077 transitions. Word has length 581 [2019-12-07 19:18:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:18:54,429 INFO L462 AbstractCegarLoop]: Abstraction has 20255 states and 30077 transitions. [2019-12-07 19:18:54,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:18:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 20255 states and 30077 transitions. [2019-12-07 19:18:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-12-07 19:18:54,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:18:54,439 INFO L410 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] [2019-12-07 19:18:54,439 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:18:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:18:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1271026584, now seen corresponding path program 1 times [2019-12-07 19:18:54,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:18:54,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211922497] [2019-12-07 19:18:54,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:18:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:18:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:18:54,821 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:18:54,821 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:18:54,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:18:54 BoogieIcfgContainer [2019-12-07 19:18:54,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:18:54,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:18:54,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:18:54,976 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:18:54,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:18:44" (3/4) ... [2019-12-07 19:18:54,978 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:18:55,141 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1fa4d7c8-7e68-4de0-b5d6-97a08cef3265/bin/utaipan/witness.graphml [2019-12-07 19:18:55,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:18:55,143 INFO L168 Benchmark]: Toolchain (without parser) took 198344.93 ms. Allocated memory was 2.0 GB in the beginning and 11.5 GB in the end (delta: 9.5 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 6.6 GB. Max. memory is 11.5 GB. [2019-12-07 19:18:55,143 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:18:55,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141101.43 ms. Allocated memory was 2.0 GB in the beginning and 7.2 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-12-07 19:18:55,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 16296.97 ms. Allocated memory was 7.2 GB in the beginning and 9.0 GB in the end (delta: 1.7 GB). Free memory was 2.8 GB in the beginning and 3.8 GB in the end (delta: -930.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 19:18:55,144 INFO L168 Benchmark]: Boogie Preprocessor took 19029.43 ms. Allocated memory was 9.0 GB in the beginning and 11.5 GB in the end (delta: 2.5 GB). Free memory was 3.8 GB in the beginning and 5.0 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 19:18:55,144 INFO L168 Benchmark]: RCFGBuilder took 11702.63 ms. Allocated memory is still 11.5 GB. Free memory was 5.0 GB in the beginning and 4.2 GB in the end (delta: 824.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 19:18:55,144 INFO L168 Benchmark]: TraceAbstraction took 10043.23 ms. Allocated memory is still 11.5 GB. Free memory was 4.2 GB in the beginning and 4.0 GB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:18:55,145 INFO L168 Benchmark]: Witness Printer took 165.24 ms. Allocated memory is still 11.5 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:18:55,147 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141101.43 ms. Allocated memory was 2.0 GB in the beginning and 7.2 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16296.97 ms. Allocated memory was 7.2 GB in the beginning and 9.0 GB in the end (delta: 1.7 GB). Free memory was 2.8 GB in the beginning and 3.8 GB in the end (delta: -930.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19029.43 ms. Allocated memory was 9.0 GB in the beginning and 11.5 GB in the end (delta: 2.5 GB). Free memory was 3.8 GB in the beginning and 5.0 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * RCFGBuilder took 11702.63 ms. Allocated memory is still 11.5 GB. Free memory was 5.0 GB in the beginning and 4.2 GB in the end (delta: 824.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * TraceAbstraction took 10043.23 ms. Allocated memory is still 11.5 GB. Free memory was 4.2 GB in the beginning and 4.0 GB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 11.5 GB. * Witness Printer took 165.24 ms. Allocated memory is still 11.5 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.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; [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] [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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5005 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.8s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 96736 SDtfs, 43630 SDslu, 71098 SDs, 0 SdLazy, 2173 SolverSat, 852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20255occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 294 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 5063 NumberOfCodeBlocks, 5063 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4460 ConstructedInterpolants, 0 QuantifiedInterpolants, 6907758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 211/211 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...