./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43303747b241581a2f6fa42bd0d545137dba7f4f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:19:19,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:19:19,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:19:19,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:19:19,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:19:19,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:19:19,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:19:19,717 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:19:19,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:19:19,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:19:19,719 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:19:19,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:19:19,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:19:19,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:19:19,722 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:19:19,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:19:19,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:19:19,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:19:19,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:19:19,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:19:19,728 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:19:19,729 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:19:19,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:19:19,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:19:19,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:19:19,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:19:19,733 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:19:19,734 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:19:19,735 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:19:19,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:19:19,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:19:19,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:19:19,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:19:19,736 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:19:19,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:19:19,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:19:19,737 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:19:19,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:19:19,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:19:19,748 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:19:19,748 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:19:19,748 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:19:19,748 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:19:19,748 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:19:19,748 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:19:19,749 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:19:19,749 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:19:19,749 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:19:19,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:19:19,750 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:19:19,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:19:19,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:19:19,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:19:19,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:19:19,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:19:19,750 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:19:19,751 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:19:19,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:19:19,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:19:19,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:19:19,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:19:19,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:19:19,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:19:19,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:19:19,753 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:19:19,753 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:19:19,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:19:19,754 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:19:19,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:19:19,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:19:19,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:19:19,754 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43303747b241581a2f6fa42bd0d545137dba7f4f [2018-11-10 11:19:19,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:19:19,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:19:19,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:19:19,794 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:19:19,795 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:19:19,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c [2018-11-10 11:19:19,845 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/data/7ed3bee61/da08c727b27d4ff7b3048a7319f7e57c/FLAG9822a3718 [2018-11-10 11:19:30,223 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:19:30,224 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/sv-benchmarks/c/psyco/psyco_cev_3_false-unreach-call.c [2018-11-10 11:19:31,524 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/data/7ed3bee61/da08c727b27d4ff7b3048a7319f7e57c/FLAG9822a3718 [2018-11-10 11:19:31,535 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/data/7ed3bee61/da08c727b27d4ff7b3048a7319f7e57c [2018-11-10 11:19:31,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:19:31,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:19:31,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:19:31,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:19:31,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:19:31,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:19:31" (1/1) ... [2018-11-10 11:19:31,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496ea709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:19:31, skipping insertion in model container [2018-11-10 11:19:31,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:19:31" (1/1) ... [2018-11-10 11:19:31,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:19:37,216 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:21:47,097 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:21:47,101 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:23:33,078 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:23:33,088 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:23:33,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33 WrapperNode [2018-11-10 11:23:33,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:23:33,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:23:33,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:23:33,090 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:23:33,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:23:37,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:23:37,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:23:37,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:23:37,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:23:37,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:23:37,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:23:37,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:23:40,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:23:40,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:24:00,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:24:01,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:24:05,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... [2018-11-10 11:24:08,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:24:08,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:24:08,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:24:08,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:24:08,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:24:08,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:24:08,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:24:08,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:24:08,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:24:08,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:24:08,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:24:29,932 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:24:29,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:24:29 BoogieIcfgContainer [2018-11-10 11:24:29,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:24:29,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:24:29,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:24:29,935 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:24:29,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:19:31" (1/3) ... [2018-11-10 11:24:29,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f8dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:24:29, skipping insertion in model container [2018-11-10 11:24:29,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:23:33" (2/3) ... [2018-11-10 11:24:29,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f8dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:24:29, skipping insertion in model container [2018-11-10 11:24:29,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:24:29" (3/3) ... [2018-11-10 11:24:29,938 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_cev_3_false-unreach-call.c [2018-11-10 11:24:29,944 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:24:29,952 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:24:29,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:24:30,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:24:30,002 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:24:30,002 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:24:30,002 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:24:30,002 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:24:30,002 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:24:30,002 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:24:30,002 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:24:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8328 states. [2018-11-10 11:24:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:24:30,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:30,070 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:30,072 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:30,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1256227157, now seen corresponding path program 1 times [2018-11-10 11:24:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:30,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:30,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:30,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:30,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:24:30,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:30,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:24:30,189 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:30,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 11:24:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 11:24:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 11:24:30,202 INFO L87 Difference]: Start difference. First operand 8328 states. Second operand 2 states. [2018-11-10 11:24:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:30,381 INFO L93 Difference]: Finished difference Result 14090 states and 28158 transitions. [2018-11-10 11:24:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:24:30,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-10 11:24:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:30,413 INFO L225 Difference]: With dead ends: 14090 [2018-11-10 11:24:30,414 INFO L226 Difference]: Without dead ends: 5719 [2018-11-10 11:24:30,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 11:24:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2018-11-10 11:24:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5719. [2018-11-10 11:24:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5719 states. [2018-11-10 11:24:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 8504 transitions. [2018-11-10 11:24:30,566 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 8504 transitions. Word has length 13 [2018-11-10 11:24:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:30,566 INFO L481 AbstractCegarLoop]: Abstraction has 5719 states and 8504 transitions. [2018-11-10 11:24:30,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 11:24:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 8504 transitions. [2018-11-10 11:24:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 11:24:30,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:30,567 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:30,568 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:30,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:30,568 INFO L82 PathProgramCache]: Analyzing trace with hash 819510173, now seen corresponding path program 1 times [2018-11-10 11:24:30,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:30,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:30,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:24:30,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:30,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:30,625 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:30,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:30,627 INFO L87 Difference]: Start difference. First operand 5719 states and 8504 transitions. Second operand 3 states. [2018-11-10 11:24:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:31,096 INFO L93 Difference]: Finished difference Result 11435 states and 17006 transitions. [2018-11-10 11:24:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:31,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 11:24:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:31,113 INFO L225 Difference]: With dead ends: 11435 [2018-11-10 11:24:31,113 INFO L226 Difference]: Without dead ends: 5722 [2018-11-10 11:24:31,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5722 states. [2018-11-10 11:24:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5722 to 5722. [2018-11-10 11:24:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5722 states. [2018-11-10 11:24:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5722 states to 5722 states and 8507 transitions. [2018-11-10 11:24:31,211 INFO L78 Accepts]: Start accepts. Automaton has 5722 states and 8507 transitions. Word has length 14 [2018-11-10 11:24:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:31,212 INFO L481 AbstractCegarLoop]: Abstraction has 5722 states and 8507 transitions. [2018-11-10 11:24:31,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5722 states and 8507 transitions. [2018-11-10 11:24:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:24:31,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:31,213 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:31,213 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:31,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1187045944, now seen corresponding path program 1 times [2018-11-10 11:24:31,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:31,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:31,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:31,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:31,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:24:31,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:31,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:31,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:31,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:31,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:31,264 INFO L87 Difference]: Start difference. First operand 5722 states and 8507 transitions. Second operand 3 states. [2018-11-10 11:24:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:31,606 INFO L93 Difference]: Finished difference Result 11423 states and 16989 transitions. [2018-11-10 11:24:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:31,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 11:24:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:31,623 INFO L225 Difference]: With dead ends: 11423 [2018-11-10 11:24:31,624 INFO L226 Difference]: Without dead ends: 5708 [2018-11-10 11:24:31,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2018-11-10 11:24:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 5708. [2018-11-10 11:24:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2018-11-10 11:24:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 8487 transitions. [2018-11-10 11:24:31,722 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 8487 transitions. Word has length 19 [2018-11-10 11:24:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:31,722 INFO L481 AbstractCegarLoop]: Abstraction has 5708 states and 8487 transitions. [2018-11-10 11:24:31,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 8487 transitions. [2018-11-10 11:24:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 11:24:31,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:31,723 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:31,724 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:31,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1796119115, now seen corresponding path program 1 times [2018-11-10 11:24:31,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:31,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:31,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:24:31,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:31,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:31,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:31,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:31,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:31,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:31,764 INFO L87 Difference]: Start difference. First operand 5708 states and 8487 transitions. Second operand 3 states. [2018-11-10 11:24:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:32,651 INFO L93 Difference]: Finished difference Result 17090 states and 25425 transitions. [2018-11-10 11:24:32,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:32,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 11:24:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:32,699 INFO L225 Difference]: With dead ends: 17090 [2018-11-10 11:24:32,699 INFO L226 Difference]: Without dead ends: 11382 [2018-11-10 11:24:32,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11382 states. [2018-11-10 11:24:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11382 to 11308. [2018-11-10 11:24:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11308 states. [2018-11-10 11:24:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11308 states to 11308 states and 16835 transitions. [2018-11-10 11:24:32,879 INFO L78 Accepts]: Start accepts. Automaton has 11308 states and 16835 transitions. Word has length 22 [2018-11-10 11:24:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:32,879 INFO L481 AbstractCegarLoop]: Abstraction has 11308 states and 16835 transitions. [2018-11-10 11:24:32,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11308 states and 16835 transitions. [2018-11-10 11:24:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 11:24:32,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:32,881 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:32,881 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:32,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1449140775, now seen corresponding path program 1 times [2018-11-10 11:24:32,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:32,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:32,882 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:24:32,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:32,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:32,908 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:32,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:32,909 INFO L87 Difference]: Start difference. First operand 11308 states and 16835 transitions. Second operand 3 states. [2018-11-10 11:24:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:33,342 INFO L93 Difference]: Finished difference Result 22614 states and 33668 transitions. [2018-11-10 11:24:33,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:33,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 11:24:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:33,367 INFO L225 Difference]: With dead ends: 22614 [2018-11-10 11:24:33,367 INFO L226 Difference]: Without dead ends: 11318 [2018-11-10 11:24:33,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11318 states. [2018-11-10 11:24:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11318 to 11316. [2018-11-10 11:24:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11316 states. [2018-11-10 11:24:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 16843 transitions. [2018-11-10 11:24:33,555 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 16843 transitions. Word has length 25 [2018-11-10 11:24:33,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:33,556 INFO L481 AbstractCegarLoop]: Abstraction has 11316 states and 16843 transitions. [2018-11-10 11:24:33,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 16843 transitions. [2018-11-10 11:24:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 11:24:33,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:33,557 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:33,557 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:33,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1285203335, now seen corresponding path program 1 times [2018-11-10 11:24:33,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:33,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:33,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:33,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:33,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:24:33,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:33,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:33,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:33,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:33,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:33,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:33,594 INFO L87 Difference]: Start difference. First operand 11316 states and 16843 transitions. Second operand 3 states. [2018-11-10 11:24:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:33,980 INFO L93 Difference]: Finished difference Result 22632 states and 33688 transitions. [2018-11-10 11:24:33,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:33,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 11:24:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:34,003 INFO L225 Difference]: With dead ends: 22632 [2018-11-10 11:24:34,003 INFO L226 Difference]: Without dead ends: 11328 [2018-11-10 11:24:34,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11328 states. [2018-11-10 11:24:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11328 to 11326. [2018-11-10 11:24:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11326 states. [2018-11-10 11:24:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11326 states to 11326 states and 16853 transitions. [2018-11-10 11:24:34,183 INFO L78 Accepts]: Start accepts. Automaton has 11326 states and 16853 transitions. Word has length 33 [2018-11-10 11:24:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:34,183 INFO L481 AbstractCegarLoop]: Abstraction has 11326 states and 16853 transitions. [2018-11-10 11:24:34,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11326 states and 16853 transitions. [2018-11-10 11:24:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 11:24:34,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:34,189 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:34,189 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:34,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -40285163, now seen corresponding path program 1 times [2018-11-10 11:24:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:34,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:34,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:24:34,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:34,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:34,429 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:34,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:34,430 INFO L87 Difference]: Start difference. First operand 11326 states and 16853 transitions. Second operand 3 states. [2018-11-10 11:24:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:34,654 INFO L93 Difference]: Finished difference Result 11899 states and 17698 transitions. [2018-11-10 11:24:34,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:34,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-11-10 11:24:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:34,675 INFO L225 Difference]: With dead ends: 11899 [2018-11-10 11:24:34,675 INFO L226 Difference]: Without dead ends: 11893 [2018-11-10 11:24:34,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2018-11-10 11:24:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 11885. [2018-11-10 11:24:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11885 states. [2018-11-10 11:24:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11885 states to 11885 states and 17684 transitions. [2018-11-10 11:24:34,792 INFO L78 Accepts]: Start accepts. Automaton has 11885 states and 17684 transitions. Word has length 285 [2018-11-10 11:24:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:34,792 INFO L481 AbstractCegarLoop]: Abstraction has 11885 states and 17684 transitions. [2018-11-10 11:24:34,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 11885 states and 17684 transitions. [2018-11-10 11:24:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-10 11:24:34,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:34,796 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:34,796 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:34,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1238581620, now seen corresponding path program 1 times [2018-11-10 11:24:34,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:34,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:34,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:24:34,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:34,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:34,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:34,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:34,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:34,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:34,995 INFO L87 Difference]: Start difference. First operand 11885 states and 17684 transitions. Second operand 3 states. [2018-11-10 11:24:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:35,438 INFO L93 Difference]: Finished difference Result 34503 states and 51354 transitions. [2018-11-10 11:24:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:35,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-11-10 11:24:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:35,476 INFO L225 Difference]: With dead ends: 34503 [2018-11-10 11:24:35,476 INFO L226 Difference]: Without dead ends: 23189 [2018-11-10 11:24:35,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23189 states. [2018-11-10 11:24:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23189 to 23119. [2018-11-10 11:24:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23119 states. [2018-11-10 11:24:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23119 states to 23119 states and 34417 transitions. [2018-11-10 11:24:35,788 INFO L78 Accepts]: Start accepts. Automaton has 23119 states and 34417 transitions. Word has length 286 [2018-11-10 11:24:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:35,789 INFO L481 AbstractCegarLoop]: Abstraction has 23119 states and 34417 transitions. [2018-11-10 11:24:35,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 23119 states and 34417 transitions. [2018-11-10 11:24:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-10 11:24:35,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:35,794 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:35,794 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:35,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash 796862360, now seen corresponding path program 1 times [2018-11-10 11:24:35,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:35,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:24:35,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:35,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:35,957 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:35,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:35,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:35,958 INFO L87 Difference]: Start difference. First operand 23119 states and 34417 transitions. Second operand 3 states. [2018-11-10 11:24:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:36,444 INFO L93 Difference]: Finished difference Result 45663 states and 67987 transitions. [2018-11-10 11:24:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:36,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-11-10 11:24:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:36,468 INFO L225 Difference]: With dead ends: 45663 [2018-11-10 11:24:36,468 INFO L226 Difference]: Without dead ends: 23115 [2018-11-10 11:24:36,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23115 states. [2018-11-10 11:24:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23115 to 23109. [2018-11-10 11:24:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2018-11-10 11:24:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 34388 transitions. [2018-11-10 11:24:36,703 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 34388 transitions. Word has length 294 [2018-11-10 11:24:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:36,703 INFO L481 AbstractCegarLoop]: Abstraction has 23109 states and 34388 transitions. [2018-11-10 11:24:36,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 34388 transitions. [2018-11-10 11:24:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-10 11:24:36,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:36,709 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:36,710 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:36,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1724075880, now seen corresponding path program 1 times [2018-11-10 11:24:36,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:36,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:36,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:36,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:36,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 11:24:36,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:36,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:36,825 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:36,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:36,826 INFO L87 Difference]: Start difference. First operand 23109 states and 34388 transitions. Second operand 3 states. [2018-11-10 11:24:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:37,085 INFO L93 Difference]: Finished difference Result 42289 states and 62938 transitions. [2018-11-10 11:24:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:37,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-11-10 11:24:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:37,105 INFO L225 Difference]: With dead ends: 42289 [2018-11-10 11:24:37,105 INFO L226 Difference]: Without dead ends: 19751 [2018-11-10 11:24:37,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19751 states. [2018-11-10 11:24:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19751 to 19749. [2018-11-10 11:24:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19749 states. [2018-11-10 11:24:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19749 states to 19749 states and 29380 transitions. [2018-11-10 11:24:37,295 INFO L78 Accepts]: Start accepts. Automaton has 19749 states and 29380 transitions. Word has length 303 [2018-11-10 11:24:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:37,295 INFO L481 AbstractCegarLoop]: Abstraction has 19749 states and 29380 transitions. [2018-11-10 11:24:37,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 19749 states and 29380 transitions. [2018-11-10 11:24:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 11:24:37,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:37,300 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:37,300 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:37,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash 733826382, now seen corresponding path program 1 times [2018-11-10 11:24:37,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:37,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:37,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:37,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:24:37,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:37,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:37,380 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:37,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:37,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:37,381 INFO L87 Difference]: Start difference. First operand 19749 states and 29380 transitions. Second operand 3 states. [2018-11-10 11:24:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:37,624 INFO L93 Difference]: Finished difference Result 38358 states and 57067 transitions. [2018-11-10 11:24:37,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:37,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2018-11-10 11:24:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:37,649 INFO L225 Difference]: With dead ends: 38358 [2018-11-10 11:24:37,650 INFO L226 Difference]: Without dead ends: 19180 [2018-11-10 11:24:37,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19180 states. [2018-11-10 11:24:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19180 to 19178. [2018-11-10 11:24:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19178 states. [2018-11-10 11:24:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19178 states to 19178 states and 28526 transitions. [2018-11-10 11:24:37,840 INFO L78 Accepts]: Start accepts. Automaton has 19178 states and 28526 transitions. Word has length 304 [2018-11-10 11:24:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:37,840 INFO L481 AbstractCegarLoop]: Abstraction has 19178 states and 28526 transitions. [2018-11-10 11:24:37,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19178 states and 28526 transitions. [2018-11-10 11:24:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 11:24:37,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:37,842 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:37,843 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:37,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash -13100406, now seen corresponding path program 1 times [2018-11-10 11:24:37,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:37,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:37,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:24:38,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:38,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:24:38,690 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:38,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:24:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:24:38,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:24:38,692 INFO L87 Difference]: Start difference. First operand 19178 states and 28526 transitions. Second operand 4 states. [2018-11-10 11:24:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:38,966 INFO L93 Difference]: Finished difference Result 20322 states and 30216 transitions. [2018-11-10 11:24:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:24:38,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-11-10 11:24:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:38,988 INFO L225 Difference]: With dead ends: 20322 [2018-11-10 11:24:38,988 INFO L226 Difference]: Without dead ends: 20320 [2018-11-10 11:24:38,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:24:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20320 states. [2018-11-10 11:24:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20320 to 20310. [2018-11-10 11:24:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20310 states. [2018-11-10 11:24:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20310 states to 20310 states and 30205 transitions. [2018-11-10 11:24:39,156 INFO L78 Accepts]: Start accepts. Automaton has 20310 states and 30205 transitions. Word has length 304 [2018-11-10 11:24:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:39,157 INFO L481 AbstractCegarLoop]: Abstraction has 20310 states and 30205 transitions. [2018-11-10 11:24:39,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:24:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 20310 states and 30205 transitions. [2018-11-10 11:24:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-10 11:24:39,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:39,160 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:39,160 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:39,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1602192406, now seen corresponding path program 1 times [2018-11-10 11:24:39,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:39,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:39,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:39,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:39,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 11:24:39,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:39,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:39,253 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:39,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:39,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:39,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:39,254 INFO L87 Difference]: Start difference. First operand 20310 states and 30205 transitions. Second operand 3 states. [2018-11-10 11:24:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:39,616 INFO L93 Difference]: Finished difference Result 38422 states and 57123 transitions. [2018-11-10 11:24:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:39,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-11-10 11:24:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:39,636 INFO L225 Difference]: With dead ends: 38422 [2018-11-10 11:24:39,637 INFO L226 Difference]: Without dead ends: 20380 [2018-11-10 11:24:39,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20380 states. [2018-11-10 11:24:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20380 to 20314. [2018-11-10 11:24:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20314 states. [2018-11-10 11:24:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20314 states to 20314 states and 30189 transitions. [2018-11-10 11:24:39,816 INFO L78 Accepts]: Start accepts. Automaton has 20314 states and 30189 transitions. Word has length 306 [2018-11-10 11:24:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:39,816 INFO L481 AbstractCegarLoop]: Abstraction has 20314 states and 30189 transitions. [2018-11-10 11:24:39,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 20314 states and 30189 transitions. [2018-11-10 11:24:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-10 11:24:39,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:39,819 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:39,819 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:39,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1192754917, now seen corresponding path program 1 times [2018-11-10 11:24:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:39,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:39,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 11:24:39,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:39,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:39,906 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:39,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:39,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:39,906 INFO L87 Difference]: Start difference. First operand 20314 states and 30189 transitions. Second operand 3 states. [2018-11-10 11:24:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:40,126 INFO L93 Difference]: Finished difference Result 38378 states and 57039 transitions. [2018-11-10 11:24:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:40,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-11-10 11:24:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:40,146 INFO L225 Difference]: With dead ends: 38378 [2018-11-10 11:24:40,146 INFO L226 Difference]: Without dead ends: 20344 [2018-11-10 11:24:40,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20344 states. [2018-11-10 11:24:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20344 to 20342. [2018-11-10 11:24:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20342 states. [2018-11-10 11:24:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20342 states to 20342 states and 30217 transitions. [2018-11-10 11:24:40,358 INFO L78 Accepts]: Start accepts. Automaton has 20342 states and 30217 transitions. Word has length 307 [2018-11-10 11:24:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:40,359 INFO L481 AbstractCegarLoop]: Abstraction has 20342 states and 30217 transitions. [2018-11-10 11:24:40,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20342 states and 30217 transitions. [2018-11-10 11:24:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-11-10 11:24:40,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:40,363 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:40,364 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:40,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1323864859, now seen corresponding path program 1 times [2018-11-10 11:24:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:40,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:40,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 11:24:40,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:40,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:40,496 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:40,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:40,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:40,497 INFO L87 Difference]: Start difference. First operand 20342 states and 30217 transitions. Second operand 3 states. [2018-11-10 11:24:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:40,733 INFO L93 Difference]: Finished difference Result 36706 states and 54542 transitions. [2018-11-10 11:24:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:40,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2018-11-10 11:24:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:40,750 INFO L225 Difference]: With dead ends: 36706 [2018-11-10 11:24:40,750 INFO L226 Difference]: Without dead ends: 18644 [2018-11-10 11:24:40,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18644 states. [2018-11-10 11:24:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18644 to 18642. [2018-11-10 11:24:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18642 states. [2018-11-10 11:24:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18642 states to 18642 states and 27692 transitions. [2018-11-10 11:24:41,013 INFO L78 Accepts]: Start accepts. Automaton has 18642 states and 27692 transitions. Word has length 321 [2018-11-10 11:24:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:41,013 INFO L481 AbstractCegarLoop]: Abstraction has 18642 states and 27692 transitions. [2018-11-10 11:24:41,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18642 states and 27692 transitions. [2018-11-10 11:24:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-10 11:24:41,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:41,017 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2018-11-10 11:24:41,017 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:41,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:41,017 INFO L82 PathProgramCache]: Analyzing trace with hash 357933491, now seen corresponding path program 1 times [2018-11-10 11:24:41,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:41,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:41,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:41,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:41,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 11:24:41,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:41,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:41,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:41,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:41,151 INFO L87 Difference]: Start difference. First operand 18642 states and 27692 transitions. Second operand 3 states. [2018-11-10 11:24:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:41,411 INFO L93 Difference]: Finished difference Result 35062 states and 52093 transitions. [2018-11-10 11:24:41,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:41,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2018-11-10 11:24:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:41,427 INFO L225 Difference]: With dead ends: 35062 [2018-11-10 11:24:41,427 INFO L226 Difference]: Without dead ends: 18700 [2018-11-10 11:24:41,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18700 states. [2018-11-10 11:24:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18700 to 18698. [2018-11-10 11:24:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18698 states. [2018-11-10 11:24:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18698 states to 18698 states and 27752 transitions. [2018-11-10 11:24:41,599 INFO L78 Accepts]: Start accepts. Automaton has 18698 states and 27752 transitions. Word has length 323 [2018-11-10 11:24:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:41,599 INFO L481 AbstractCegarLoop]: Abstraction has 18698 states and 27752 transitions. [2018-11-10 11:24:41,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 18698 states and 27752 transitions. [2018-11-10 11:24:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-10 11:24:41,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:41,602 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2018-11-10 11:24:41,602 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:41,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash 752773097, now seen corresponding path program 1 times [2018-11-10 11:24:41,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:41,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:41,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:41,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:41,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 11:24:41,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:41,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:41,723 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:41,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:41,724 INFO L87 Difference]: Start difference. First operand 18698 states and 27752 transitions. Second operand 3 states. [2018-11-10 11:24:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:41,947 INFO L93 Difference]: Finished difference Result 35150 states and 52169 transitions. [2018-11-10 11:24:41,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:41,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2018-11-10 11:24:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:41,967 INFO L225 Difference]: With dead ends: 35150 [2018-11-10 11:24:41,967 INFO L226 Difference]: Without dead ends: 18732 [2018-11-10 11:24:41,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18732 states. [2018-11-10 11:24:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18732 to 18730. [2018-11-10 11:24:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18730 states. [2018-11-10 11:24:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18730 states to 18730 states and 27784 transitions. [2018-11-10 11:24:42,150 INFO L78 Accepts]: Start accepts. Automaton has 18730 states and 27784 transitions. Word has length 324 [2018-11-10 11:24:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:42,151 INFO L481 AbstractCegarLoop]: Abstraction has 18730 states and 27784 transitions. [2018-11-10 11:24:42,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 18730 states and 27784 transitions. [2018-11-10 11:24:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-10 11:24:42,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:42,154 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2018-11-10 11:24:42,154 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:42,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1585610927, now seen corresponding path program 1 times [2018-11-10 11:24:42,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:42,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:42,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:42,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:42,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 11:24:42,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:42,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:42,238 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:42,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:42,239 INFO L87 Difference]: Start difference. First operand 18730 states and 27784 transitions. Second operand 3 states. [2018-11-10 11:24:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:42,467 INFO L93 Difference]: Finished difference Result 35218 states and 52241 transitions. [2018-11-10 11:24:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:42,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-11-10 11:24:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:42,491 INFO L225 Difference]: With dead ends: 35218 [2018-11-10 11:24:42,491 INFO L226 Difference]: Without dead ends: 18768 [2018-11-10 11:24:42,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2018-11-10 11:24:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 18766. [2018-11-10 11:24:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18766 states. [2018-11-10 11:24:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18766 states to 18766 states and 27820 transitions. [2018-11-10 11:24:42,660 INFO L78 Accepts]: Start accepts. Automaton has 18766 states and 27820 transitions. Word has length 341 [2018-11-10 11:24:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:42,660 INFO L481 AbstractCegarLoop]: Abstraction has 18766 states and 27820 transitions. [2018-11-10 11:24:42,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 18766 states and 27820 transitions. [2018-11-10 11:24:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-11-10 11:24:42,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:42,666 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:42,666 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:42,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash 708577322, now seen corresponding path program 1 times [2018-11-10 11:24:42,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:42,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:42,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:42,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 11:24:43,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:43,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:43,011 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:43,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:43,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:43,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:43,012 INFO L87 Difference]: Start difference. First operand 18766 states and 27820 transitions. Second operand 3 states. [2018-11-10 11:24:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:43,233 INFO L93 Difference]: Finished difference Result 20496 states and 30369 transitions. [2018-11-10 11:24:43,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:43,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 570 [2018-11-10 11:24:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:43,251 INFO L225 Difference]: With dead ends: 20496 [2018-11-10 11:24:43,251 INFO L226 Difference]: Without dead ends: 20486 [2018-11-10 11:24:43,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2018-11-10 11:24:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20470. [2018-11-10 11:24:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20470 states. [2018-11-10 11:24:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20470 states to 20470 states and 30341 transitions. [2018-11-10 11:24:43,422 INFO L78 Accepts]: Start accepts. Automaton has 20470 states and 30341 transitions. Word has length 570 [2018-11-10 11:24:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:43,422 INFO L481 AbstractCegarLoop]: Abstraction has 20470 states and 30341 transitions. [2018-11-10 11:24:43,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20470 states and 30341 transitions. [2018-11-10 11:24:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-11-10 11:24:43,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:43,428 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:43,428 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:43,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash -882686962, now seen corresponding path program 1 times [2018-11-10 11:24:43,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:43,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:43,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:43,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:43,430 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:24:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 11:24:43,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:24:43,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:24:43,684 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:24:43,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:24:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:24:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:43,685 INFO L87 Difference]: Start difference. First operand 20470 states and 30341 transitions. Second operand 3 states. [2018-11-10 11:24:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:24:44,119 INFO L93 Difference]: Finished difference Result 57986 states and 85959 transitions. [2018-11-10 11:24:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:24:44,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2018-11-10 11:24:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:24:44,158 INFO L225 Difference]: With dead ends: 57986 [2018-11-10 11:24:44,158 INFO L226 Difference]: Without dead ends: 39784 [2018-11-10 11:24:44,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:24:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39784 states. [2018-11-10 11:24:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39784 to 39540. [2018-11-10 11:24:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39540 states. [2018-11-10 11:24:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39540 states to 39540 states and 58718 transitions. [2018-11-10 11:24:44,505 INFO L78 Accepts]: Start accepts. Automaton has 39540 states and 58718 transitions. Word has length 576 [2018-11-10 11:24:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:24:44,506 INFO L481 AbstractCegarLoop]: Abstraction has 39540 states and 58718 transitions. [2018-11-10 11:24:44,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:24:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 39540 states and 58718 transitions. [2018-11-10 11:24:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-11-10 11:24:44,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:24:44,512 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:24:44,512 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:24:44,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:24:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash 794344478, now seen corresponding path program 1 times [2018-11-10 11:24:44,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:24:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:44,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:24:44,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:24:44,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:24:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:24:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:24:45,038 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 11:24:45,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:24:45 BoogieIcfgContainer [2018-11-10 11:24:45,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:24:45,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:24:45,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:24:45,149 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:24:45,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:24:29" (3/4) ... [2018-11-10 11:24:45,151 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 11:24:45,351 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_03772300-a939-47a5-8861-a9065af698c2/bin-2019/utaipan/witness.graphml [2018-11-10 11:24:45,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:24:45,352 INFO L168 Benchmark]: Toolchain (without parser) took 313813.33 ms. Allocated memory was 3.8 GB in the beginning and 10.2 GB in the end (delta: 6.4 GB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -612.2 MB). Peak memory consumption was 7.4 GB. Max. memory is 11.5 GB. [2018-11-10 11:24:45,353 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:24:45,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241549.31 ms. Allocated memory was 3.8 GB in the beginning and 10.6 GB in the end (delta: 6.9 GB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -483.2 MB). Peak memory consumption was 8.3 GB. Max. memory is 11.5 GB. [2018-11-10 11:24:45,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 4232.55 ms. Allocated memory is still 10.6 GB. Free memory was 2.7 GB in the beginning and 3.0 GB in the end (delta: -338.9 MB). Peak memory consumption was 739.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:24:45,354 INFO L168 Benchmark]: Boogie Preprocessor took 31127.55 ms. Allocated memory was 10.6 GB in the beginning and 11.5 GB in the end (delta: 823.1 MB). Free memory was 3.0 GB in the beginning and 4.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-10 11:24:45,354 INFO L168 Benchmark]: RCFGBuilder took 21482.59 ms. Allocated memory was 11.5 GB in the beginning and 10.0 GB in the end (delta: -1.4 GB). Free memory was 4.1 GB in the beginning and 1.7 GB in the end (delta: 2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-10 11:24:45,354 INFO L168 Benchmark]: TraceAbstraction took 15215.56 ms. Allocated memory was 10.0 GB in the beginning and 11.2 GB in the end (delta: 1.1 GB). Free memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: -444.1 MB). Peak memory consumption was 681.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:24:45,354 INFO L168 Benchmark]: Witness Printer took 202.17 ms. Allocated memory was 11.2 GB in the beginning and 10.2 GB in the end (delta: -976.7 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -613.1 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:24:45,356 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241549.31 ms. Allocated memory was 3.8 GB in the beginning and 10.6 GB in the end (delta: 6.9 GB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -483.2 MB). Peak memory consumption was 8.3 GB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 4232.55 ms. Allocated memory is still 10.6 GB. Free memory was 2.7 GB in the beginning and 3.0 GB in the end (delta: -338.9 MB). Peak memory consumption was 739.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31127.55 ms. Allocated memory was 10.6 GB in the beginning and 11.5 GB in the end (delta: 823.1 MB). Free memory was 3.0 GB in the beginning and 4.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * RCFGBuilder took 21482.59 ms. Allocated memory was 11.5 GB in the beginning and 10.0 GB in the end (delta: -1.4 GB). Free memory was 4.1 GB in the beginning and 1.7 GB in the end (delta: 2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * TraceAbstraction took 15215.56 ms. Allocated memory was 10.0 GB in the beginning and 11.2 GB in the end (delta: 1.1 GB). Free memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: -444.1 MB). Peak memory consumption was 681.5 MB. Max. memory is 11.5 GB. * Witness Printer took 202.17 ms. Allocated memory was 11.2 GB in the beginning and 10.2 GB in the end (delta: -976.7 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -613.1 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44380]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_stage2Separation = 1; [L6] int m_completion = 2; [L7] int m_tliBurn = 3; [L8] int m_loiBurn = 4; [L9] int m_stage1Separation = 5; [L10] int m_edsSeparation = 6; [L11] int m_lsamAscentRendezvous = 7; [L12] int m_smSeparation = 8; [L13] int m_eiBurn = 9; [L14] int m_lsamRendezvous = 10; [L15] int m_teiBurn = 11; [L16] int m_CEV = 12; [L17] int m_abort = 13; [L18] int m_enterOrbitOps = 14; [L19] int m_failure = 15; [L20] int m_lsamSeparation = 16; [L21] int m_abortPassiveLAScompletion = 17; [L22] int m_lasJettison = 18; [L23] int m_lsamAscentBurn = 19; [L24] int m_srbIgnition = 20; [L25] int m_deOrbit = 21; VAL [\old(m_abort)=9, \old(m_abortPassiveLAScompletion)=11, \old(m_CEV)=10, \old(m_completion)=2, \old(m_deOrbit)=3, \old(m_edsSeparation)=5, \old(m_eiBurn)=7, \old(m_enterOrbitOps)=15, \old(m_failure)=12, \old(m_lasJettison)=4, \old(m_loiBurn)=13, \old(m_lsamAscentBurn)=19, \old(m_lsamAscentRendezvous)=6, \old(m_lsamRendezvous)=14, \old(m_lsamSeparation)=17, \old(m_smSeparation)=8, \old(m_srbIgnition)=16, \old(m_stage1Separation)=21, \old(m_stage2Separation)=22, \old(m_teiBurn)=20, \old(m_tliBurn)=18, m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3] [L30] int q = 0; [L31] int method_id; [L34] int this_spacecraft_cLSAM_ASCENT = 0; [L35] int this_spacecraft_cEDS = 0; [L36] int this_spacecraft_cLSAM_DESCENT = 0; [L37] int this_spacecraft_cLAS = 1; [L38] int this_spacecraft_cStage1 = 1; [L39] int this_spacecraft_cStage2 = 1; [L40] int this_spacecraft_cCM = 1; [L41] int this_spacecraft_cSM = 1; VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND TRUE q == 0 [L56] COND TRUE __VERIFIER_nondet_int() [L58] COND TRUE 1 [L60] method_id = 12 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L62] COND FALSE !(0) [L66] q = 2 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND TRUE __VERIFIER_nondet_int() [L289] COND TRUE 1 [L291] method_id = 8 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L293] COND FALSE !(0) [L297] q = 2 [L299] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L299] this_spacecraft_cCM=this_spacecraft_cCM [L299] this_spacecraft_cSM=0 [L299] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L299] this_spacecraft_cEDS=this_spacecraft_cEDS [L299] this_spacecraft_cLAS=this_spacecraft_cLAS [L299] this_spacecraft_cStage2=this_spacecraft_cStage2 [L299] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND FALSE !(__VERIFIER_nondet_int()) [L303] COND FALSE !(__VERIFIER_nondet_int()) [L319] COND FALSE !(__VERIFIER_nondet_int()) [L335] COND FALSE !(__VERIFIER_nondet_int()) [L351] COND FALSE !(__VERIFIER_nondet_int()) [L367] COND FALSE !(__VERIFIER_nondet_int()) [L383] COND FALSE !(__VERIFIER_nondet_int()) [L399] COND FALSE !(__VERIFIER_nondet_int()) [L415] COND FALSE !(__VERIFIER_nondet_int()) [L431] COND FALSE !(__VERIFIER_nondet_int()) [L447] COND FALSE !(__VERIFIER_nondet_int()) [L463] COND FALSE !(__VERIFIER_nondet_int()) [L479] COND FALSE !(__VERIFIER_nondet_int()) [L495] COND FALSE !(__VERIFIER_nondet_int()) [L511] COND FALSE !(__VERIFIER_nondet_int()) [L527] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L559] COND FALSE !(__VERIFIER_nondet_int()) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L591] COND FALSE !(__VERIFIER_nondet_int()) [L607] COND FALSE !(__VERIFIER_nondet_int()) [L623] COND FALSE !(__VERIFIER_nondet_int()) [L639] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND FALSE !(__VERIFIER_nondet_int()) [L671] COND FALSE !(__VERIFIER_nondet_int()) [L687] COND FALSE !(__VERIFIER_nondet_int()) [L703] COND FALSE !(__VERIFIER_nondet_int()) [L719] COND FALSE !(__VERIFIER_nondet_int()) [L735] COND FALSE !(__VERIFIER_nondet_int()) [L751] COND FALSE !(__VERIFIER_nondet_int()) [L767] COND FALSE !(__VERIFIER_nondet_int()) [L783] COND FALSE !(__VERIFIER_nondet_int()) [L799] COND FALSE !(__VERIFIER_nondet_int()) [L815] COND FALSE !(__VERIFIER_nondet_int()) [L831] COND FALSE !(__VERIFIER_nondet_int()) [L847] COND FALSE !(__VERIFIER_nondet_int()) [L863] COND FALSE !(__VERIFIER_nondet_int()) [L879] COND FALSE !(__VERIFIER_nondet_int()) [L895] COND FALSE !(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L927] COND FALSE !(__VERIFIER_nondet_int()) [L943] COND FALSE !(__VERIFIER_nondet_int()) [L959] COND FALSE !(__VERIFIER_nondet_int()) [L975] COND FALSE !(__VERIFIER_nondet_int()) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1007] COND FALSE !(__VERIFIER_nondet_int()) [L1023] COND FALSE !(__VERIFIER_nondet_int()) [L1039] COND FALSE !(__VERIFIER_nondet_int()) [L1055] COND FALSE !(__VERIFIER_nondet_int()) [L1071] COND FALSE !(__VERIFIER_nondet_int()) [L1087] COND FALSE !(__VERIFIER_nondet_int()) [L1103] COND FALSE !(__VERIFIER_nondet_int()) [L1119] COND FALSE !(__VERIFIER_nondet_int()) [L1135] COND FALSE !(__VERIFIER_nondet_int()) [L1151] COND FALSE !(__VERIFIER_nondet_int()) [L1167] COND FALSE !(__VERIFIER_nondet_int()) [L1183] COND FALSE !(__VERIFIER_nondet_int()) [L1199] COND FALSE !(__VERIFIER_nondet_int()) [L1215] COND FALSE !(__VERIFIER_nondet_int()) [L1231] COND FALSE !(__VERIFIER_nondet_int()) [L1247] COND FALSE !(__VERIFIER_nondet_int()) [L1263] COND FALSE !(__VERIFIER_nondet_int()) [L1279] COND FALSE !(__VERIFIER_nondet_int()) [L1295] COND FALSE !(__VERIFIER_nondet_int()) [L1311] COND FALSE !(__VERIFIER_nondet_int()) [L1327] COND FALSE !(__VERIFIER_nondet_int()) [L1343] COND FALSE !(__VERIFIER_nondet_int()) [L1359] COND FALSE !(__VERIFIER_nondet_int()) [L1375] COND FALSE !(__VERIFIER_nondet_int()) [L1391] COND FALSE !(__VERIFIER_nondet_int()) [L1407] COND FALSE !(__VERIFIER_nondet_int()) [L1423] COND FALSE !(__VERIFIER_nondet_int()) [L1439] COND FALSE !(__VERIFIER_nondet_int()) [L1455] COND FALSE !(__VERIFIER_nondet_int()) [L1471] COND FALSE !(__VERIFIER_nondet_int()) [L1487] COND FALSE !(__VERIFIER_nondet_int()) [L1503] COND FALSE !(__VERIFIER_nondet_int()) [L1519] COND FALSE !(__VERIFIER_nondet_int()) [L1535] COND FALSE !(__VERIFIER_nondet_int()) [L1551] COND FALSE !(__VERIFIER_nondet_int()) [L1567] COND FALSE !(__VERIFIER_nondet_int()) [L1583] COND FALSE !(__VERIFIER_nondet_int()) [L1599] COND FALSE !(__VERIFIER_nondet_int()) [L1615] COND FALSE !(__VERIFIER_nondet_int()) [L1631] COND FALSE !(__VERIFIER_nondet_int()) [L1647] COND FALSE !(__VERIFIER_nondet_int()) [L1663] COND FALSE !(__VERIFIER_nondet_int()) [L1679] COND FALSE !(__VERIFIER_nondet_int()) [L1695] COND FALSE !(__VERIFIER_nondet_int()) [L1711] COND FALSE !(__VERIFIER_nondet_int()) [L1727] COND FALSE !(__VERIFIER_nondet_int()) [L1743] COND FALSE !(__VERIFIER_nondet_int()) [L1759] COND FALSE !(__VERIFIER_nondet_int()) [L1775] COND FALSE !(__VERIFIER_nondet_int()) [L1791] COND FALSE !(__VERIFIER_nondet_int()) [L1807] COND FALSE !(__VERIFIER_nondet_int()) [L1823] COND FALSE !(__VERIFIER_nondet_int()) [L1839] COND FALSE !(__VERIFIER_nondet_int()) [L1855] COND FALSE !(__VERIFIER_nondet_int()) [L1871] COND FALSE !(__VERIFIER_nondet_int()) [L1887] COND FALSE !(__VERIFIER_nondet_int()) [L1903] COND FALSE !(__VERIFIER_nondet_int()) [L1919] COND FALSE !(__VERIFIER_nondet_int()) [L1935] COND FALSE !(__VERIFIER_nondet_int()) [L1951] COND FALSE !(__VERIFIER_nondet_int()) [L1967] COND FALSE !(__VERIFIER_nondet_int()) [L1983] COND FALSE !(__VERIFIER_nondet_int()) [L1999] COND FALSE !(__VERIFIER_nondet_int()) [L2015] COND FALSE !(__VERIFIER_nondet_int()) [L2031] COND FALSE !(__VERIFIER_nondet_int()) [L2047] COND FALSE !(__VERIFIER_nondet_int()) [L2063] COND FALSE !(__VERIFIER_nondet_int()) [L2079] COND FALSE !(__VERIFIER_nondet_int()) [L2095] COND FALSE !(__VERIFIER_nondet_int()) [L2111] COND FALSE !(__VERIFIER_nondet_int()) [L2127] COND FALSE !(__VERIFIER_nondet_int()) [L2143] COND FALSE !(__VERIFIER_nondet_int()) [L2159] COND FALSE !(__VERIFIER_nondet_int()) [L2175] COND FALSE !(__VERIFIER_nondet_int()) [L2191] COND FALSE !(__VERIFIER_nondet_int()) [L2207] COND FALSE !(__VERIFIER_nondet_int()) [L2223] COND FALSE !(__VERIFIER_nondet_int()) [L2239] COND FALSE !(__VERIFIER_nondet_int()) [L2255] COND FALSE !(__VERIFIER_nondet_int()) [L2271] COND FALSE !(__VERIFIER_nondet_int()) [L2287] COND FALSE !(__VERIFIER_nondet_int()) [L2303] COND FALSE !(__VERIFIER_nondet_int()) [L2319] COND FALSE !(__VERIFIER_nondet_int()) [L2335] COND FALSE !(__VERIFIER_nondet_int()) [L2351] COND FALSE !(__VERIFIER_nondet_int()) [L2367] COND FALSE !(__VERIFIER_nondet_int()) [L2383] COND FALSE !(__VERIFIER_nondet_int()) [L2399] COND FALSE !(__VERIFIER_nondet_int()) [L2415] COND FALSE !(__VERIFIER_nondet_int()) [L2431] COND FALSE !(__VERIFIER_nondet_int()) [L2447] COND FALSE !(__VERIFIER_nondet_int()) [L2463] COND FALSE !(__VERIFIER_nondet_int()) [L2479] COND FALSE !(__VERIFIER_nondet_int()) [L2495] COND FALSE !(__VERIFIER_nondet_int()) [L2511] COND FALSE !(__VERIFIER_nondet_int()) [L2527] COND FALSE !(__VERIFIER_nondet_int()) [L2543] COND FALSE !(__VERIFIER_nondet_int()) [L2559] COND FALSE !(__VERIFIER_nondet_int()) [L2575] COND FALSE !(__VERIFIER_nondet_int()) [L2591] COND FALSE !(__VERIFIER_nondet_int()) [L2607] COND FALSE !(__VERIFIER_nondet_int()) [L2623] COND FALSE !(__VERIFIER_nondet_int()) [L2639] COND FALSE !(__VERIFIER_nondet_int()) [L2655] COND FALSE !(__VERIFIER_nondet_int()) [L2671] COND FALSE !(__VERIFIER_nondet_int()) [L2687] COND FALSE !(__VERIFIER_nondet_int()) [L2703] COND FALSE !(__VERIFIER_nondet_int()) [L2719] COND FALSE !(__VERIFIER_nondet_int()) [L2735] COND FALSE !(__VERIFIER_nondet_int()) [L2751] COND FALSE !(__VERIFIER_nondet_int()) [L2767] COND FALSE !(__VERIFIER_nondet_int()) [L2783] COND FALSE !(__VERIFIER_nondet_int()) [L2799] COND FALSE !(__VERIFIER_nondet_int()) [L2815] COND FALSE !(__VERIFIER_nondet_int()) [L2831] COND FALSE !(__VERIFIER_nondet_int()) [L2847] COND FALSE !(__VERIFIER_nondet_int()) [L2863] COND FALSE !(__VERIFIER_nondet_int()) [L2879] COND FALSE !(__VERIFIER_nondet_int()) [L2895] COND FALSE !(__VERIFIER_nondet_int()) [L2911] COND FALSE !(__VERIFIER_nondet_int()) [L2927] COND FALSE !(__VERIFIER_nondet_int()) [L2943] COND FALSE !(__VERIFIER_nondet_int()) [L2959] COND FALSE !(__VERIFIER_nondet_int()) [L2975] COND FALSE !(__VERIFIER_nondet_int()) [L2991] COND FALSE !(__VERIFIER_nondet_int()) [L3007] COND FALSE !(__VERIFIER_nondet_int()) [L3023] COND FALSE !(__VERIFIER_nondet_int()) [L3039] COND FALSE !(__VERIFIER_nondet_int()) [L3055] COND FALSE !(__VERIFIER_nondet_int()) [L3071] COND FALSE !(__VERIFIER_nondet_int()) [L3087] COND FALSE !(__VERIFIER_nondet_int()) [L3103] COND FALSE !(__VERIFIER_nondet_int()) [L3119] COND FALSE !(__VERIFIER_nondet_int()) [L3135] COND FALSE !(__VERIFIER_nondet_int()) [L3151] COND FALSE !(__VERIFIER_nondet_int()) [L3167] COND FALSE !(__VERIFIER_nondet_int()) [L3183] COND FALSE !(__VERIFIER_nondet_int()) [L3199] COND FALSE !(__VERIFIER_nondet_int()) [L3215] COND FALSE !(__VERIFIER_nondet_int()) [L3231] COND FALSE !(__VERIFIER_nondet_int()) [L3247] COND FALSE !(__VERIFIER_nondet_int()) [L3263] COND FALSE !(__VERIFIER_nondet_int()) [L3279] COND FALSE !(__VERIFIER_nondet_int()) [L3295] COND FALSE !(__VERIFIER_nondet_int()) [L3311] COND FALSE !(__VERIFIER_nondet_int()) [L3327] COND FALSE !(__VERIFIER_nondet_int()) [L3343] COND FALSE !(__VERIFIER_nondet_int()) [L3359] COND FALSE !(__VERIFIER_nondet_int()) [L3375] COND FALSE !(__VERIFIER_nondet_int()) [L3391] COND FALSE !(__VERIFIER_nondet_int()) [L3407] COND FALSE !(__VERIFIER_nondet_int()) [L3423] COND FALSE !(__VERIFIER_nondet_int()) [L3439] COND FALSE !(__VERIFIER_nondet_int()) [L3455] COND FALSE !(__VERIFIER_nondet_int()) [L3471] COND FALSE !(__VERIFIER_nondet_int()) [L3487] COND FALSE !(__VERIFIER_nondet_int()) [L3503] COND FALSE !(__VERIFIER_nondet_int()) [L3519] COND FALSE !(__VERIFIER_nondet_int()) [L3535] COND FALSE !(__VERIFIER_nondet_int()) [L3551] COND FALSE !(__VERIFIER_nondet_int()) [L3567] COND FALSE !(__VERIFIER_nondet_int()) [L3583] COND FALSE !(__VERIFIER_nondet_int()) [L3599] COND FALSE !(__VERIFIER_nondet_int()) [L3615] COND FALSE !(__VERIFIER_nondet_int()) [L3631] COND FALSE !(__VERIFIER_nondet_int()) [L3647] COND FALSE !(__VERIFIER_nondet_int()) [L3663] COND FALSE !(__VERIFIER_nondet_int()) [L3679] COND FALSE !(__VERIFIER_nondet_int()) [L3695] COND FALSE !(__VERIFIER_nondet_int()) [L3711] COND FALSE !(__VERIFIER_nondet_int()) [L3727] COND FALSE !(__VERIFIER_nondet_int()) [L3743] COND FALSE !(__VERIFIER_nondet_int()) [L3759] COND FALSE !(__VERIFIER_nondet_int()) [L3775] COND FALSE !(__VERIFIER_nondet_int()) [L3791] COND FALSE !(__VERIFIER_nondet_int()) [L3807] COND FALSE !(__VERIFIER_nondet_int()) [L3823] COND FALSE !(__VERIFIER_nondet_int()) [L3839] COND FALSE !(__VERIFIER_nondet_int()) [L3855] COND FALSE !(__VERIFIER_nondet_int()) [L3871] COND FALSE !(__VERIFIER_nondet_int()) [L3887] COND FALSE !(__VERIFIER_nondet_int()) [L3903] COND FALSE !(__VERIFIER_nondet_int()) [L3919] COND FALSE !(__VERIFIER_nondet_int()) [L3935] COND FALSE !(__VERIFIER_nondet_int()) [L3951] COND FALSE !(__VERIFIER_nondet_int()) [L3967] COND FALSE !(__VERIFIER_nondet_int()) [L3983] COND FALSE !(__VERIFIER_nondet_int()) [L3999] COND FALSE !(__VERIFIER_nondet_int()) [L4015] COND FALSE !(__VERIFIER_nondet_int()) [L4031] COND FALSE !(__VERIFIER_nondet_int()) [L4047] COND FALSE !(__VERIFIER_nondet_int()) [L4063] COND FALSE !(__VERIFIER_nondet_int()) [L4079] COND FALSE !(__VERIFIER_nondet_int()) [L4095] COND FALSE !(__VERIFIER_nondet_int()) [L4111] COND FALSE !(__VERIFIER_nondet_int()) [L4127] COND FALSE !(__VERIFIER_nondet_int()) [L4143] COND FALSE !(__VERIFIER_nondet_int()) [L4159] COND FALSE !(__VERIFIER_nondet_int()) [L4175] COND FALSE !(__VERIFIER_nondet_int()) [L4191] COND FALSE !(__VERIFIER_nondet_int()) [L4207] COND FALSE !(__VERIFIER_nondet_int()) [L4223] COND FALSE !(__VERIFIER_nondet_int()) [L4239] COND FALSE !(__VERIFIER_nondet_int()) [L4255] COND FALSE !(__VERIFIER_nondet_int()) [L4271] COND FALSE !(__VERIFIER_nondet_int()) [L4287] COND FALSE !(__VERIFIER_nondet_int()) [L4303] COND FALSE !(__VERIFIER_nondet_int()) [L4319] COND FALSE !(__VERIFIER_nondet_int()) [L4335] COND FALSE !(__VERIFIER_nondet_int()) [L4351] COND FALSE !(__VERIFIER_nondet_int()) [L4367] COND FALSE !(__VERIFIER_nondet_int()) [L4383] COND FALSE !(__VERIFIER_nondet_int()) [L4399] COND FALSE !(__VERIFIER_nondet_int()) [L4415] COND FALSE !(__VERIFIER_nondet_int()) [L4431] COND FALSE !(__VERIFIER_nondet_int()) [L4447] COND FALSE !(__VERIFIER_nondet_int()) [L4463] COND FALSE !(__VERIFIER_nondet_int()) [L4479] COND FALSE !(__VERIFIER_nondet_int()) [L4495] COND FALSE !(__VERIFIER_nondet_int()) [L4511] COND FALSE !(__VERIFIER_nondet_int()) [L4527] COND TRUE __VERIFIER_nondet_int() [L4529] COND TRUE 1 [L4531] method_id = 18 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4533] COND FALSE !(0) [L4537] q = 4 [L4539] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L4539] this_spacecraft_cCM=this_spacecraft_cCM [L4539] this_spacecraft_cSM=this_spacecraft_cSM [L4539] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L4539] this_spacecraft_cEDS=this_spacecraft_cEDS [L4539] this_spacecraft_cLAS=0 [L4539] this_spacecraft_cStage2=this_spacecraft_cStage2 [L4539] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND FALSE !(q == 2) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4594] COND FALSE !(q == 3) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [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() [L13417] COND TRUE 1 [L13419] method_id = 21 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L13421] COND TRUE (!this_spacecraft_cEDS && (!this_spacecraft_cLSAM_ASCENT && (!this_spacecraft_cSM && !this_spacecraft_cLAS))) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44380] __VERIFIER_error() VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 8328 locations, 1 error locations. UNSAFE Result, 15.1s OverallTime, 21 OverallIterations, 6 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 176918 SDtfs, 71005 SDslu, 124977 SDs, 0 SdLazy, 3644 SolverSat, 1384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39540occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 512 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5560 NumberOfCodeBlocks, 5560 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4950 ConstructedInterpolants, 0 QuantifiedInterpolants, 6145955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 304/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...