./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b4145914802a18ceef375a77d9a4f2f13e6c70b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:39:57,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:39:57,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:39:57,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:39:57,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:39:57,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:39:57,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:39:57,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:39:57,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:39:57,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:39:57,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:39:57,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:39:57,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:39:57,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:39:57,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:39:57,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:39:57,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:39:57,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:39:57,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:39:57,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:39:57,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:39:57,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:39:57,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:39:57,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:39:57,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:39:57,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:39:57,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:39:57,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:39:57,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:39:57,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:39:57,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:39:57,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:39:57,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:39:57,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:39:57,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:39:57,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:39:57,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:39:57,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:39:57,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:39:57,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:39:57,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:39:57,808 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:39:57,848 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:39:57,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:39:57,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:39:57,849 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:39:57,849 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:39:57,849 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:39:57,850 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:39:57,850 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:39:57,850 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:39:57,850 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:39:57,851 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:39:57,851 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:39:57,851 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:39:57,851 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:39:57,851 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:39:57,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:39:57,852 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:39:57,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:39:57,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:39:57,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:39:57,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:39:57,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:39:57,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:39:57,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:39:57,854 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:39:57,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:39:57,855 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:39:57,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:39:57,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:39:57,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:39:57,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:39:57,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:39:57,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:39:57,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:39:57,856 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:39:57,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:39:57,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:39:57,857 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:39:57,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:39:57,857 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8 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(reach_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 -> 4b4145914802a18ceef375a77d9a4f2f13e6c70b [2021-10-13 07:39:58,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:39:58,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:39:58,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:39:58,098 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:39:58,099 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:39:58,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-13 07:39:58,154 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/data/31fcfdbaf/3e9e934ed6194ac4a1c3eed44ba653e8/FLAGc7b471bc5 [2021-10-13 07:39:58,585 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:39:58,586 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-13 07:39:58,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/data/31fcfdbaf/3e9e934ed6194ac4a1c3eed44ba653e8/FLAGc7b471bc5 [2021-10-13 07:39:58,963 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/data/31fcfdbaf/3e9e934ed6194ac4a1c3eed44ba653e8 [2021-10-13 07:39:58,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:39:58,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:39:58,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:39:58,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:39:58,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:39:58,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:39:58" (1/1) ... [2021-10-13 07:39:58,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ab6857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:58, skipping insertion in model container [2021-10-13 07:39:58,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:39:58" (1/1) ... [2021-10-13 07:39:58,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:39:59,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:39:59,198 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-13 07:39:59,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:39:59,278 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:39:59,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-13 07:39:59,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:39:59,331 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:39:59,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59 WrapperNode [2021-10-13 07:39:59,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:39:59,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:39:59,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:39:59,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:39:59,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:39:59,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:39:59,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:39:59,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:39:59,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:39:59,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:39:59,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:39:59,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:39:59,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (1/1) ... [2021-10-13 07:39:59,480 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:39:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:39:59,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:39:59,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:39:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:39:59,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:39:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:39:59,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:40:01,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:40:01,122 INFO L299 CfgBuilder]: Removed 103 assume(true) statements. [2021-10-13 07:40:01,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:40:01 BoogieIcfgContainer [2021-10-13 07:40:01,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:40:01,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:40:01,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:40:01,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:40:01,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:39:58" (1/3) ... [2021-10-13 07:40:01,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772cc30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:40:01, skipping insertion in model container [2021-10-13 07:40:01,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:59" (2/3) ... [2021-10-13 07:40:01,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772cc30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:40:01, skipping insertion in model container [2021-10-13 07:40:01,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:40:01" (3/3) ... [2021-10-13 07:40:01,135 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-10-13 07:40:01,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:40:01,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:40:01,194 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:40:01,200 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:40:01,200 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:40:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:40:01,223 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:01,223 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:40:01,224 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:01,228 INFO L82 PathProgramCache]: Analyzing trace with hash -94103792, now seen corresponding path program 1 times [2021-10-13 07:40:01,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:01,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315753741] [2021-10-13 07:40:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:01,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:01,447 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:01,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315753741] [2021-10-13 07:40:01,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315753741] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:01,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:01,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:40:01,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974159905] [2021-10-13 07:40:01,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:01,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:01,487 INFO L87 Difference]: Start difference. First operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:01,638 INFO L93 Difference]: Finished difference Result 275 states and 422 transitions. [2021-10-13 07:40:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:01,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 07:40:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:01,659 INFO L225 Difference]: With dead ends: 275 [2021-10-13 07:40:01,660 INFO L226 Difference]: Without dead ends: 173 [2021-10-13 07:40:01,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-13 07:40:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2021-10-13 07:40:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-10-13 07:40:01,712 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 19 [2021-10-13 07:40:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:01,712 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-10-13 07:40:01,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-10-13 07:40:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:40:01,715 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:01,715 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:40:01,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:40:01,716 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash -903760834, now seen corresponding path program 1 times [2021-10-13 07:40:01,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:01,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252090657] [2021-10-13 07:40:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:01,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:40:01,781 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:01,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252090657] [2021-10-13 07:40:01,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252090657] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:01,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:01,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:01,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682801824] [2021-10-13 07:40:01,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:01,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:01,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:01,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:01,788 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:01,939 INFO L93 Difference]: Finished difference Result 514 states and 747 transitions. [2021-10-13 07:40:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:40:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:01,946 INFO L225 Difference]: With dead ends: 514 [2021-10-13 07:40:01,946 INFO L226 Difference]: Without dead ends: 356 [2021-10-13 07:40:01,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-13 07:40:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 279. [2021-10-13 07:40:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4388489208633093) internal successors, (400), 278 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 400 transitions. [2021-10-13 07:40:02,002 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 400 transitions. Word has length 36 [2021-10-13 07:40:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:02,003 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 400 transitions. [2021-10-13 07:40:02,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 400 transitions. [2021-10-13 07:40:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:40:02,011 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:02,011 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:40:02,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:40:02,012 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 15213789, now seen corresponding path program 1 times [2021-10-13 07:40:02,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:02,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991933253] [2021-10-13 07:40:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:02,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:02,121 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:02,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991933253] [2021-10-13 07:40:02,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991933253] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:02,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:02,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:02,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230174619] [2021-10-13 07:40:02,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:02,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:02,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:02,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:02,134 INFO L87 Difference]: Start difference. First operand 279 states and 400 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:02,243 INFO L93 Difference]: Finished difference Result 877 states and 1246 transitions. [2021-10-13 07:40:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:02,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:40:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:02,248 INFO L225 Difference]: With dead ends: 877 [2021-10-13 07:40:02,248 INFO L226 Difference]: Without dead ends: 606 [2021-10-13 07:40:02,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-10-13 07:40:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2021-10-13 07:40:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4057971014492754) internal successors, (679), 483 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 679 transitions. [2021-10-13 07:40:02,297 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 679 transitions. Word has length 36 [2021-10-13 07:40:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:02,298 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 679 transitions. [2021-10-13 07:40:02,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 679 transitions. [2021-10-13 07:40:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:40:02,302 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:02,302 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:40:02,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:40:02,303 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:02,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:02,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1264110946, now seen corresponding path program 1 times [2021-10-13 07:40:02,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:02,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513178575] [2021-10-13 07:40:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:02,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:02,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:02,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513178575] [2021-10-13 07:40:02,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513178575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:02,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:02,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:02,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459954612] [2021-10-13 07:40:02,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:02,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:02,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:02,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:02,454 INFO L87 Difference]: Start difference. First operand 484 states and 679 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:02,507 INFO L93 Difference]: Finished difference Result 844 states and 1214 transitions. [2021-10-13 07:40:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:02,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 07:40:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:02,514 INFO L225 Difference]: With dead ends: 844 [2021-10-13 07:40:02,515 INFO L226 Difference]: Without dead ends: 568 [2021-10-13 07:40:02,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-10-13 07:40:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 532. [2021-10-13 07:40:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4293785310734464) internal successors, (759), 531 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 759 transitions. [2021-10-13 07:40:02,551 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 759 transitions. Word has length 36 [2021-10-13 07:40:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:02,552 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 759 transitions. [2021-10-13 07:40:02,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 759 transitions. [2021-10-13 07:40:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 07:40:02,556 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:02,556 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:02,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:40:02,557 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:02,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash -642955608, now seen corresponding path program 1 times [2021-10-13 07:40:02,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:02,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471479398] [2021-10-13 07:40:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:02,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:02,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:02,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471479398] [2021-10-13 07:40:02,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471479398] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:02,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:02,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:02,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984545703] [2021-10-13 07:40:02,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:02,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:02,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:02,727 INFO L87 Difference]: Start difference. First operand 532 states and 759 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:02,850 INFO L93 Difference]: Finished difference Result 1793 states and 2575 transitions. [2021-10-13 07:40:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-13 07:40:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:02,858 INFO L225 Difference]: With dead ends: 1793 [2021-10-13 07:40:02,858 INFO L226 Difference]: Without dead ends: 1271 [2021-10-13 07:40:02,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2021-10-13 07:40:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 966. [2021-10-13 07:40:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.4124352331606218) internal successors, (1363), 965 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1363 transitions. [2021-10-13 07:40:02,919 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1363 transitions. Word has length 52 [2021-10-13 07:40:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:02,921 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1363 transitions. [2021-10-13 07:40:02,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1363 transitions. [2021-10-13 07:40:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 07:40:02,924 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:02,925 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:02,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:40:02,925 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash -650280792, now seen corresponding path program 1 times [2021-10-13 07:40:02,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:02,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143265443] [2021-10-13 07:40:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:02,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:03,042 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:03,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143265443] [2021-10-13 07:40:03,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143265443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:03,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:03,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:03,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102734892] [2021-10-13 07:40:03,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:03,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:03,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:03,045 INFO L87 Difference]: Start difference. First operand 966 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:03,233 INFO L93 Difference]: Finished difference Result 3294 states and 4654 transitions. [2021-10-13 07:40:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-10-13 07:40:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:03,248 INFO L225 Difference]: With dead ends: 3294 [2021-10-13 07:40:03,248 INFO L226 Difference]: Without dead ends: 2338 [2021-10-13 07:40:03,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2021-10-13 07:40:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1748. [2021-10-13 07:40:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3892386949055524) internal successors, (2427), 1747 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2427 transitions. [2021-10-13 07:40:03,366 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2427 transitions. Word has length 53 [2021-10-13 07:40:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:03,367 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2427 transitions. [2021-10-13 07:40:03,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2427 transitions. [2021-10-13 07:40:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 07:40:03,372 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:03,373 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:03,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:40:03,373 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:03,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:03,374 INFO L82 PathProgramCache]: Analyzing trace with hash 128308584, now seen corresponding path program 1 times [2021-10-13 07:40:03,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:03,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682548666] [2021-10-13 07:40:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:03,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:03,449 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:03,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682548666] [2021-10-13 07:40:03,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682548666] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:03,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:03,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:03,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605186630] [2021-10-13 07:40:03,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:03,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:03,451 INFO L87 Difference]: Start difference. First operand 1748 states and 2427 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:03,590 INFO L93 Difference]: Finished difference Result 2978 states and 4160 transitions. [2021-10-13 07:40:03,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:03,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-13 07:40:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:03,604 INFO L225 Difference]: With dead ends: 2978 [2021-10-13 07:40:03,605 INFO L226 Difference]: Without dead ends: 1892 [2021-10-13 07:40:03,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2021-10-13 07:40:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1748. [2021-10-13 07:40:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3388666285060102) internal successors, (2339), 1747 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2339 transitions. [2021-10-13 07:40:03,723 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2339 transitions. Word has length 54 [2021-10-13 07:40:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:03,724 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2339 transitions. [2021-10-13 07:40:03,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2339 transitions. [2021-10-13 07:40:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 07:40:03,728 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:03,728 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:03,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:40:03,729 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:03,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1101797543, now seen corresponding path program 1 times [2021-10-13 07:40:03,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:03,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982793118] [2021-10-13 07:40:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:03,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:03,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:03,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982793118] [2021-10-13 07:40:03,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982793118] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:03,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:03,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:40:03,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730730121] [2021-10-13 07:40:03,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:40:03,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:40:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:03,826 INFO L87 Difference]: Start difference. First operand 1748 states and 2339 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:04,028 INFO L93 Difference]: Finished difference Result 3234 states and 4351 transitions. [2021-10-13 07:40:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:40:04,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-13 07:40:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:04,039 INFO L225 Difference]: With dead ends: 3234 [2021-10-13 07:40:04,039 INFO L226 Difference]: Without dead ends: 1496 [2021-10-13 07:40:04,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 25.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:40:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-10-13 07:40:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1333. [2021-10-13 07:40:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.3543543543543544) internal successors, (1804), 1332 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2021-10-13 07:40:04,124 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 54 [2021-10-13 07:40:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:04,124 INFO L470 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2021-10-13 07:40:04,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2021-10-13 07:40:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-13 07:40:04,128 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:04,128 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:04,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:40:04,129 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -711580186, now seen corresponding path program 1 times [2021-10-13 07:40:04,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:04,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049464207] [2021-10-13 07:40:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:04,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:04,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:04,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049464207] [2021-10-13 07:40:04,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049464207] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:04,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:04,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:40:04,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828199905] [2021-10-13 07:40:04,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:40:04,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:04,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:40:04,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:04,193 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:04,345 INFO L93 Difference]: Finished difference Result 2602 states and 3527 transitions. [2021-10-13 07:40:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:40:04,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-10-13 07:40:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:04,353 INFO L225 Difference]: With dead ends: 2602 [2021-10-13 07:40:04,353 INFO L226 Difference]: Without dead ends: 1280 [2021-10-13 07:40:04,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:40:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-10-13 07:40:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1125. [2021-10-13 07:40:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3665480427046264) internal successors, (1536), 1124 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1536 transitions. [2021-10-13 07:40:04,451 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1536 transitions. Word has length 56 [2021-10-13 07:40:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:04,452 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1536 transitions. [2021-10-13 07:40:04,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1536 transitions. [2021-10-13 07:40:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 07:40:04,455 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:04,455 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:04,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:40:04,456 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1828301811, now seen corresponding path program 1 times [2021-10-13 07:40:04,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:04,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637185968] [2021-10-13 07:40:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:04,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:04,536 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:04,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637185968] [2021-10-13 07:40:04,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637185968] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:04,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:04,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:40:04,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094605168] [2021-10-13 07:40:04,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:40:04,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:04,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:40:04,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:04,539 INFO L87 Difference]: Start difference. First operand 1125 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:04,716 INFO L93 Difference]: Finished difference Result 2435 states and 3301 transitions. [2021-10-13 07:40:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:40:04,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-13 07:40:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:04,725 INFO L225 Difference]: With dead ends: 2435 [2021-10-13 07:40:04,725 INFO L226 Difference]: Without dead ends: 1321 [2021-10-13 07:40:04,727 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:40:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-10-13 07:40:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1125. [2021-10-13 07:40:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3487544483985765) internal successors, (1516), 1124 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1516 transitions. [2021-10-13 07:40:04,794 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1516 transitions. Word has length 58 [2021-10-13 07:40:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:04,795 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1516 transitions. [2021-10-13 07:40:04,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1516 transitions. [2021-10-13 07:40:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 07:40:04,798 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:04,799 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:04,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:40:04,799 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1326313774, now seen corresponding path program 1 times [2021-10-13 07:40:04,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:04,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812479767] [2021-10-13 07:40:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:04,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:04,868 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:04,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812479767] [2021-10-13 07:40:04,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812479767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:04,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:04,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:04,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434865943] [2021-10-13 07:40:04,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:04,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:04,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:04,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:04,870 INFO L87 Difference]: Start difference. First operand 1125 states and 1516 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:04,938 INFO L93 Difference]: Finished difference Result 1915 states and 2588 transitions. [2021-10-13 07:40:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:04,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-13 07:40:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:04,944 INFO L225 Difference]: With dead ends: 1915 [2021-10-13 07:40:04,944 INFO L226 Difference]: Without dead ends: 801 [2021-10-13 07:40:04,946 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:04,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-10-13 07:40:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 786. [2021-10-13 07:40:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2955414012738853) internal successors, (1017), 785 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1017 transitions. [2021-10-13 07:40:05,006 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1017 transitions. Word has length 58 [2021-10-13 07:40:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:05,007 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1017 transitions. [2021-10-13 07:40:05,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1017 transitions. [2021-10-13 07:40:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-13 07:40:05,010 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:05,010 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:05,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:40:05,010 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash -906808733, now seen corresponding path program 1 times [2021-10-13 07:40:05,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:05,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573718344] [2021-10-13 07:40:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:05,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:05,189 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:05,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573718344] [2021-10-13 07:40:05,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573718344] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:05,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214104292] [2021-10-13 07:40:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:05,191 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:05,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:05,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:05,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:40:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:05,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 07:40:05,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:05,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:05,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214104292] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:05,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:05,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [8] total 12 [2021-10-13 07:40:05,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681253029] [2021-10-13 07:40:05,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:40:05,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:40:05,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-13 07:40:05,969 INFO L87 Difference]: Start difference. First operand 786 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:06,040 INFO L93 Difference]: Finished difference Result 1544 states and 2000 transitions. [2021-10-13 07:40:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:40:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-13 07:40:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:06,045 INFO L225 Difference]: With dead ends: 1544 [2021-10-13 07:40:06,045 INFO L226 Difference]: Without dead ends: 790 [2021-10-13 07:40:06,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 78.2ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-13 07:40:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-10-13 07:40:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 786. [2021-10-13 07:40:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2751592356687897) internal successors, (1001), 785 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1001 transitions. [2021-10-13 07:40:06,096 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1001 transitions. Word has length 59 [2021-10-13 07:40:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:06,097 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1001 transitions. [2021-10-13 07:40:06,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1001 transitions. [2021-10-13 07:40:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-13 07:40:06,099 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:06,099 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:06,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:06,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:06,314 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1977232412, now seen corresponding path program 1 times [2021-10-13 07:40:06,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:06,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860068308] [2021-10-13 07:40:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:06,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:06,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:06,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860068308] [2021-10-13 07:40:06,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860068308] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:06,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:06,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:06,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076652595] [2021-10-13 07:40:06,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:06,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:06,388 INFO L87 Difference]: Start difference. First operand 786 states and 1001 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:06,444 INFO L93 Difference]: Finished difference Result 1384 states and 1770 transitions. [2021-10-13 07:40:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:06,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-10-13 07:40:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:06,448 INFO L225 Difference]: With dead ends: 1384 [2021-10-13 07:40:06,448 INFO L226 Difference]: Without dead ends: 630 [2021-10-13 07:40:06,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-10-13 07:40:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 617. [2021-10-13 07:40:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.228896103896104) internal successors, (757), 616 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 757 transitions. [2021-10-13 07:40:06,488 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 757 transitions. Word has length 59 [2021-10-13 07:40:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:06,488 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 757 transitions. [2021-10-13 07:40:06,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 757 transitions. [2021-10-13 07:40:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 07:40:06,493 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:06,494 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:06,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:40:06,494 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1340286050, now seen corresponding path program 1 times [2021-10-13 07:40:06,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:06,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129218129] [2021-10-13 07:40:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:06,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:06,643 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:06,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129218129] [2021-10-13 07:40:06,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129218129] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:06,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49707379] [2021-10-13 07:40:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:06,644 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:06,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:06,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:06,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 07:40:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:06,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:40:06,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:07,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:07,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49707379] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:07,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:07,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 5] imperfect sequences [8] total 13 [2021-10-13 07:40:07,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421172437] [2021-10-13 07:40:07,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:40:07,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:40:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-13 07:40:07,754 INFO L87 Difference]: Start difference. First operand 617 states and 757 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:08,005 INFO L93 Difference]: Finished difference Result 2176 states and 2676 transitions. [2021-10-13 07:40:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:40:08,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-13 07:40:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:08,015 INFO L225 Difference]: With dead ends: 2176 [2021-10-13 07:40:08,015 INFO L226 Difference]: Without dead ends: 1710 [2021-10-13 07:40:08,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 132.6ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-13 07:40:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-10-13 07:40:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1000. [2021-10-13 07:40:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 1.2392392392392393) internal successors, (1238), 999 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1238 transitions. [2021-10-13 07:40:08,134 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1238 transitions. Word has length 60 [2021-10-13 07:40:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:08,135 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1238 transitions. [2021-10-13 07:40:08,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1238 transitions. [2021-10-13 07:40:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 07:40:08,138 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:08,138 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-10-13 07:40:08,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:08,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-13 07:40:08,362 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash -630394364, now seen corresponding path program 1 times [2021-10-13 07:40:08,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:08,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944223754] [2021-10-13 07:40:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:08,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:08,415 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:08,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944223754] [2021-10-13 07:40:08,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944223754] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:08,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185986574] [2021-10-13 07:40:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:08,418 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:08,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:08,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:08,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 07:40:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:08,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:40:08,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:08,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:08,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185986574] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:08,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:08,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:40:08,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784602376] [2021-10-13 07:40:08,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:08,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:08,889 INFO L87 Difference]: Start difference. First operand 1000 states and 1238 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:08,986 INFO L93 Difference]: Finished difference Result 1701 states and 2103 transitions. [2021-10-13 07:40:08,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:08,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-13 07:40:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:08,993 INFO L225 Difference]: With dead ends: 1701 [2021-10-13 07:40:08,993 INFO L226 Difference]: Without dead ends: 1040 [2021-10-13 07:40:08,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-10-13 07:40:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 942. [2021-10-13 07:40:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.234856535600425) internal successors, (1162), 941 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1162 transitions. [2021-10-13 07:40:09,074 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1162 transitions. Word has length 60 [2021-10-13 07:40:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:09,075 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1162 transitions. [2021-10-13 07:40:09,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1162 transitions. [2021-10-13 07:40:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 07:40:09,077 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:09,077 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-10-13 07:40:09,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:09,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-13 07:40:09,297 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 799905747, now seen corresponding path program 1 times [2021-10-13 07:40:09,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:09,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7582510] [2021-10-13 07:40:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:09,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:09,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:09,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7582510] [2021-10-13 07:40:09,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7582510] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:09,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395381586] [2021-10-13 07:40:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:09,360 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:09,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:09,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 07:40:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:09,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:40:09,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:09,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:09,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395381586] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:09,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:09,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:40:09,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221725345] [2021-10-13 07:40:09,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:09,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:09,887 INFO L87 Difference]: Start difference. First operand 942 states and 1162 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:09,980 INFO L93 Difference]: Finished difference Result 1668 states and 2049 transitions. [2021-10-13 07:40:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-13 07:40:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:09,987 INFO L225 Difference]: With dead ends: 1668 [2021-10-13 07:40:09,987 INFO L226 Difference]: Without dead ends: 1109 [2021-10-13 07:40:09,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-10-13 07:40:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 943. [2021-10-13 07:40:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.2388535031847134) internal successors, (1167), 942 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1167 transitions. [2021-10-13 07:40:10,062 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1167 transitions. Word has length 60 [2021-10-13 07:40:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:10,063 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1167 transitions. [2021-10-13 07:40:10,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1167 transitions. [2021-10-13 07:40:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 07:40:10,065 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:10,065 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-10-13 07:40:10,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:10,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:10,283 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1422165127, now seen corresponding path program 1 times [2021-10-13 07:40:10,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:10,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400943941] [2021-10-13 07:40:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:10,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:10,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:10,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400943941] [2021-10-13 07:40:10,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400943941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:10,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:10,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:10,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864012984] [2021-10-13 07:40:10,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:10,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:10,314 INFO L87 Difference]: Start difference. First operand 943 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:10,411 INFO L93 Difference]: Finished difference Result 2143 states and 2688 transitions. [2021-10-13 07:40:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-10-13 07:40:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:10,418 INFO L225 Difference]: With dead ends: 2143 [2021-10-13 07:40:10,419 INFO L226 Difference]: Without dead ends: 1211 [2021-10-13 07:40:10,420 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-10-13 07:40:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1063. [2021-10-13 07:40:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.2448210922787193) internal successors, (1322), 1062 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1322 transitions. [2021-10-13 07:40:10,529 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1322 transitions. Word has length 60 [2021-10-13 07:40:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:10,530 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1322 transitions. [2021-10-13 07:40:10,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1322 transitions. [2021-10-13 07:40:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 07:40:10,534 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:10,535 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-13 07:40:10,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:40:10,535 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash 510128812, now seen corresponding path program 1 times [2021-10-13 07:40:10,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:10,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706312819] [2021-10-13 07:40:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:10,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:10,593 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:10,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706312819] [2021-10-13 07:40:10,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706312819] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:10,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731530904] [2021-10-13 07:40:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:10,594 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:10,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:10,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:10,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 07:40:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:10,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:40:10,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 07:40:11,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 07:40:11,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731530904] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:11,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:11,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-10-13 07:40:11,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284562370] [2021-10-13 07:40:11,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:11,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:40:11,211 INFO L87 Difference]: Start difference. First operand 1063 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:11,304 INFO L93 Difference]: Finished difference Result 1525 states and 1892 transitions. [2021-10-13 07:40:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:11,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 07:40:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:11,311 INFO L225 Difference]: With dead ends: 1525 [2021-10-13 07:40:11,311 INFO L226 Difference]: Without dead ends: 1089 [2021-10-13 07:40:11,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:40:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-10-13 07:40:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 708. [2021-10-13 07:40:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.2347949080622347) internal successors, (873), 707 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 873 transitions. [2021-10-13 07:40:11,378 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 873 transitions. Word has length 61 [2021-10-13 07:40:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:11,379 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 873 transitions. [2021-10-13 07:40:11,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 873 transitions. [2021-10-13 07:40:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 07:40:11,381 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:11,381 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:11,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:11,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 07:40:11,594 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:11,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1779942747, now seen corresponding path program 1 times [2021-10-13 07:40:11,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:11,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185620831] [2021-10-13 07:40:11,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:11,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 07:40:11,680 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:11,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185620831] [2021-10-13 07:40:11,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185620831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:11,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:11,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:40:11,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800290896] [2021-10-13 07:40:11,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:40:11,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:40:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:40:11,682 INFO L87 Difference]: Start difference. First operand 708 states and 873 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:11,861 INFO L93 Difference]: Finished difference Result 1350 states and 1635 transitions. [2021-10-13 07:40:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 07:40:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 07:40:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:11,865 INFO L225 Difference]: With dead ends: 1350 [2021-10-13 07:40:11,866 INFO L226 Difference]: Without dead ends: 577 [2021-10-13 07:40:11,867 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.3ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:40:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-10-13 07:40:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 464. [2021-10-13 07:40:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.1771058315334773) internal successors, (545), 463 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 545 transitions. [2021-10-13 07:40:11,911 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 545 transitions. Word has length 61 [2021-10-13 07:40:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:11,911 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 545 transitions. [2021-10-13 07:40:11,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 545 transitions. [2021-10-13 07:40:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 07:40:11,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:11,913 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-13 07:40:11,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 07:40:11,914 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash -984781663, now seen corresponding path program 1 times [2021-10-13 07:40:11,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:11,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319608322] [2021-10-13 07:40:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:11,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:11,960 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:11,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319608322] [2021-10-13 07:40:11,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319608322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:11,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:11,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:40:11,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529315108] [2021-10-13 07:40:11,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:11,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:11,962 INFO L87 Difference]: Start difference. First operand 464 states and 545 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:12,049 INFO L93 Difference]: Finished difference Result 840 states and 974 transitions. [2021-10-13 07:40:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:12,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-13 07:40:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:12,052 INFO L225 Difference]: With dead ends: 840 [2021-10-13 07:40:12,053 INFO L226 Difference]: Without dead ends: 507 [2021-10-13 07:40:12,053 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-13 07:40:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 448. [2021-10-13 07:40:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.1565995525727069) internal successors, (517), 447 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 517 transitions. [2021-10-13 07:40:12,095 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 517 transitions. Word has length 62 [2021-10-13 07:40:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:12,095 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 517 transitions. [2021-10-13 07:40:12,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 517 transitions. [2021-10-13 07:40:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-13 07:40:12,097 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:12,097 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-13 07:40:12,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 07:40:12,098 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1150400836, now seen corresponding path program 1 times [2021-10-13 07:40:12,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:12,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299920755] [2021-10-13 07:40:12,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:12,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:12,194 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:12,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299920755] [2021-10-13 07:40:12,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299920755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:12,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:12,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:40:12,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373670797] [2021-10-13 07:40:12,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:40:12,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:12,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:40:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:12,196 INFO L87 Difference]: Start difference. First operand 448 states and 517 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:12,364 INFO L93 Difference]: Finished difference Result 1300 states and 1491 transitions. [2021-10-13 07:40:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:40:12,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-10-13 07:40:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:12,370 INFO L225 Difference]: With dead ends: 1300 [2021-10-13 07:40:12,371 INFO L226 Difference]: Without dead ends: 1007 [2021-10-13 07:40:12,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-10-13 07:40:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 774. [2021-10-13 07:40:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.1617076326002587) internal successors, (898), 773 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 898 transitions. [2021-10-13 07:40:12,469 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 898 transitions. Word has length 79 [2021-10-13 07:40:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:12,469 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 898 transitions. [2021-10-13 07:40:12,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 898 transitions. [2021-10-13 07:40:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 07:40:12,471 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:12,472 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:40:12,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 07:40:12,472 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1659025345, now seen corresponding path program 1 times [2021-10-13 07:40:12,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:12,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772458293] [2021-10-13 07:40:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:12,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-13 07:40:12,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:12,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772458293] [2021-10-13 07:40:12,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772458293] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:12,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:12,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:40:12,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060968877] [2021-10-13 07:40:12,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:40:12,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:40:12,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:12,534 INFO L87 Difference]: Start difference. First operand 774 states and 898 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:12,668 INFO L93 Difference]: Finished difference Result 1169 states and 1348 transitions. [2021-10-13 07:40:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:40:12,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 07:40:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:12,672 INFO L225 Difference]: With dead ends: 1169 [2021-10-13 07:40:12,672 INFO L226 Difference]: Without dead ends: 567 [2021-10-13 07:40:12,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-10-13 07:40:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 531. [2021-10-13 07:40:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.1566037735849057) internal successors, (613), 530 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 613 transitions. [2021-10-13 07:40:12,726 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 613 transitions. Word has length 100 [2021-10-13 07:40:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:12,726 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 613 transitions. [2021-10-13 07:40:12,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 613 transitions. [2021-10-13 07:40:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 07:40:12,728 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:12,729 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:40:12,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 07:40:12,729 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash -31532579, now seen corresponding path program 1 times [2021-10-13 07:40:12,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:12,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062300107] [2021-10-13 07:40:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:12,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-13 07:40:12,785 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:12,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062300107] [2021-10-13 07:40:12,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062300107] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:12,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:12,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:40:12,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962557858] [2021-10-13 07:40:12,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:12,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:12,787 INFO L87 Difference]: Start difference. First operand 531 states and 613 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:12,910 INFO L93 Difference]: Finished difference Result 774 states and 882 transitions. [2021-10-13 07:40:12,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-10-13 07:40:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:12,911 INFO L225 Difference]: With dead ends: 774 [2021-10-13 07:40:12,911 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 07:40:12,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 07:40:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 07:40:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 07:40:12,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2021-10-13 07:40:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:12,914 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 07:40:12,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:40:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 07:40:12,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 07:40:12,916 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:40:12,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 07:40:12,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 07:40:12,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:13,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:14,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:15,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:22,491 INFO L853 garLoopResultBuilder]: At program point L564(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-13 07:40:22,491 INFO L853 garLoopResultBuilder]: At program point L564-1(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-13 07:40:22,491 INFO L857 garLoopResultBuilder]: For program point L300(lines 300 307) no Hoare annotation was computed. [2021-10-13 07:40:22,492 INFO L853 garLoopResultBuilder]: At program point L169(lines 157 171) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-13 07:40:22,492 INFO L853 garLoopResultBuilder]: At program point L169-1(lines 157 171) the Hoare annotation is: (let ((.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse14)) (.cse1 (= ~t1_st~0 0)) (.cse12 (= 2 ~t2_st~0)) (.cse15 (= 2 ~t1_st~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse13)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse12 .cse15 .cse13 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2021-10-13 07:40:22,492 INFO L853 garLoopResultBuilder]: At program point L169-2(lines 157 171) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-13 07:40:22,493 INFO L853 garLoopResultBuilder]: At program point L169-3(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse9 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse9 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse10 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-13 07:40:22,493 INFO L853 garLoopResultBuilder]: At program point L169-4(lines 157 171) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-13 07:40:22,493 INFO L853 garLoopResultBuilder]: At program point L169-5(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-13 07:40:22,493 INFO L853 garLoopResultBuilder]: At program point L207(lines 195 209) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-13 07:40:22,494 INFO L853 garLoopResultBuilder]: At program point L207-1(lines 195 209) the Hoare annotation is: (let ((.cse15 (= ~t2_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (= 2 ~t2_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse15)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2021-10-13 07:40:22,494 INFO L853 garLoopResultBuilder]: At program point L207-2(lines 195 209) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse2 (<= ~token~0 .cse12)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse8 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (<= .cse12 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t2_st~0) (not .cse8) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse8 .cse4 .cse6 (= ~m_pc~0 0) .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 (not .cse11) .cse8 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2021-10-13 07:40:22,494 INFO L853 garLoopResultBuilder]: At program point L207-3(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t1_st~0)) (.cse3 (< 0 ~t2_st~0)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< (+ ~local~0 1) ~token~0) .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 (= ~m_pc~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11 .cse8 .cse9))) [2021-10-13 07:40:22,494 INFO L853 garLoopResultBuilder]: At program point L207-4(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-13 07:40:22,495 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2021-10-13 07:40:22,495 INFO L853 garLoopResultBuilder]: At program point L207-5(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-13 07:40:22,495 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,495 INFO L857 garLoopResultBuilder]: For program point L177-2(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,495 INFO L857 garLoopResultBuilder]: For program point L177-3(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,495 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-13 07:40:22,496 INFO L857 garLoopResultBuilder]: For program point L177-5(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,496 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 07:40:22,496 INFO L857 garLoopResultBuilder]: For program point L177-6(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,496 INFO L857 garLoopResultBuilder]: For program point L177-8(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,496 INFO L857 garLoopResultBuilder]: For program point L177-9(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,496 INFO L857 garLoopResultBuilder]: For program point L177-11(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,497 INFO L857 garLoopResultBuilder]: For program point L177-12(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,497 INFO L857 garLoopResultBuilder]: For program point L177-14(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,497 INFO L857 garLoopResultBuilder]: For program point L177-15(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,497 INFO L857 garLoopResultBuilder]: For program point L177-17(lines 177 186) no Hoare annotation was computed. [2021-10-13 07:40:22,497 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 183) no Hoare annotation was computed. [2021-10-13 07:40:22,497 INFO L857 garLoopResultBuilder]: For program point L178-1(lines 178 183) no Hoare annotation was computed. [2021-10-13 07:40:22,497 INFO L857 garLoopResultBuilder]: For program point L178-2(lines 178 183) no Hoare annotation was computed. [2021-10-13 07:40:22,498 INFO L857 garLoopResultBuilder]: For program point L178-3(lines 178 183) no Hoare annotation was computed. [2021-10-13 07:40:22,498 INFO L853 garLoopResultBuilder]: At program point L46(lines 41 80) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2)) [2021-10-13 07:40:22,498 INFO L857 garLoopResultBuilder]: For program point L178-4(lines 178 183) no Hoare annotation was computed. [2021-10-13 07:40:22,498 INFO L857 garLoopResultBuilder]: For program point L178-5(lines 178 183) no Hoare annotation was computed. [2021-10-13 07:40:22,499 INFO L853 garLoopResultBuilder]: At program point L311(lines 273 325) the Hoare annotation is: (let ((.cse2 (= ~t2_pc~0 1)) (.cse22 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (not .cse0)) (.cse7 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (<= ~token~0 .cse22)) (.cse12 (<= .cse22 ~token~0)) (.cse16 (= ~t1_st~0 0)) (.cse15 (= 2 ~t2_st~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ~m_pc~0 1)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse24 (= ~m_st~0 ~E_1~0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (not .cse2)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse14 .cse8) (and .cse15 .cse16 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse8) (and .cse0 .cse21 .cse15 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse21 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse2 .cse11 .cse3 (< .cse22 ~token~0) .cse6 .cse8) (and .cse15 .cse19 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse10 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse19 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse10 .cse11 .cse23 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse23 .cse12 .cse3 .cse4 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse16 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse15 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse8) (and .cse0 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8)))) [2021-10-13 07:40:22,499 INFO L857 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2021-10-13 07:40:22,499 INFO L857 garLoopResultBuilder]: For program point L278-1(lines 273 325) no Hoare annotation was computed. [2021-10-13 07:40:22,499 INFO L857 garLoopResultBuilder]: For program point L577(lines 577 581) no Hoare annotation was computed. [2021-10-13 07:40:22,499 INFO L853 garLoopResultBuilder]: At program point L545-1(lines 370 582) the Hoare annotation is: (let ((.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse13 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse10 (= ~E_1~0 2)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (not .cse0) (= ~t1_st~0 0) .cse5 .cse13 .cse7 (= 0 ~t2_st~0) .cse8 .cse9 (not .cse2) .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse13 .cse7 .cse10) (and .cse0 .cse12 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11))) [2021-10-13 07:40:22,499 INFO L857 garLoopResultBuilder]: For program point L314(lines 314 321) no Hoare annotation was computed. [2021-10-13 07:40:22,499 INFO L853 garLoopResultBuilder]: At program point L283(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-13 07:40:22,499 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-13 07:40:22,499 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2021-10-13 07:40:22,499 INFO L860 garLoopResultBuilder]: At program point L583(lines 530 588) the Hoare annotation is: true [2021-10-13 07:40:22,500 INFO L857 garLoopResultBuilder]: For program point L286(lines 286 293) no Hoare annotation was computed. [2021-10-13 07:40:22,500 INFO L853 garLoopResultBuilder]: At program point L188(lines 176 190) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-13 07:40:22,500 INFO L853 garLoopResultBuilder]: At program point L188-1(lines 176 190) the Hoare annotation is: (let ((.cse4 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse1 (= 2 ~t2_st~0)) (.cse16 (= 2 ~t1_st~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse14 (not .cse4)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12) (and .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12)))) [2021-10-13 07:40:22,500 INFO L853 garLoopResultBuilder]: At program point L188-2(lines 176 190) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-13 07:40:22,500 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2021-10-13 07:40:22,500 INFO L853 garLoopResultBuilder]: At program point L89(lines 89 93) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse15 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= 2 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse10 (not .cse0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (< 0 ~t1_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse11 (= 0 ~t2_st~0)) (.cse14 (not .cse1)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t2_st~0) .cse8 .cse9) (and .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse12 .cse13 .cse8 .cse9) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse16 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse15 .cse2 .cse3 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse16 .cse10 .cse1 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse14 .cse8 .cse9)))) [2021-10-13 07:40:22,500 INFO L853 garLoopResultBuilder]: At program point L188-3(lines 176 190) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse11 (= ~m_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 (<= ~token~0 (+ 2 ~local~0)) .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse11 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8))) [2021-10-13 07:40:22,501 INFO L853 garLoopResultBuilder]: At program point L188-4(lines 176 190) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-13 07:40:22,501 INFO L853 garLoopResultBuilder]: At program point L188-5(lines 176 190) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-13 07:40:22,501 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 07:40:22,501 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,501 INFO L853 garLoopResultBuilder]: At program point L125(lines 125 129) the Hoare annotation is: (let ((.cse19 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (+ ~local~0 1))) (let ((.cse5 (= ~m_st~0 ~E_1~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse17 (<= ~token~0 .cse20)) (.cse16 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse18 (<= .cse20 ~token~0)) (.cse12 (not .cse0)) (.cse13 (= ~t1_st~0 0)) (.cse1 (< 0 ~t2_st~0)) (.cse4 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse14 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse9 (not .cse19)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse16 .cse1 .cse2 .cse3 .cse18 .cse4 .cse15 .cse6 .cse9 .cse10 .cse11) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse14 .cse6 .cse10 .cse11) (and .cse0 .cse17 .cse16 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse19 .cse2 .cse18 .cse4 .cse15 .cse6 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11)))) [2021-10-13 07:40:22,502 INFO L857 garLoopResultBuilder]: For program point L158-2(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,502 INFO L857 garLoopResultBuilder]: For program point L158-3(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,502 INFO L857 garLoopResultBuilder]: For program point L158-5(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,502 INFO L857 garLoopResultBuilder]: For program point L158-6(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,502 INFO L857 garLoopResultBuilder]: For program point L158-8(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,502 INFO L857 garLoopResultBuilder]: For program point L158-9(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,502 INFO L857 garLoopResultBuilder]: For program point L158-11(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,503 INFO L857 garLoopResultBuilder]: For program point L158-12(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,503 INFO L857 garLoopResultBuilder]: For program point L158-14(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,503 INFO L857 garLoopResultBuilder]: For program point L158-15(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,503 INFO L857 garLoopResultBuilder]: For program point L158-17(lines 158 167) no Hoare annotation was computed. [2021-10-13 07:40:22,503 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-13 07:40:22,503 INFO L857 garLoopResultBuilder]: For program point L159-1(lines 159 164) no Hoare annotation was computed. [2021-10-13 07:40:22,503 INFO L857 garLoopResultBuilder]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-13 07:40:22,504 INFO L857 garLoopResultBuilder]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-13 07:40:22,504 INFO L857 garLoopResultBuilder]: For program point L159-4(lines 159 164) no Hoare annotation was computed. [2021-10-13 07:40:22,504 INFO L857 garLoopResultBuilder]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-13 07:40:22,504 INFO L853 garLoopResultBuilder]: At program point L326(lines 267 331) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7))) [2021-10-13 07:40:22,504 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,504 INFO L857 garLoopResultBuilder]: For program point L196-2(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,505 INFO L857 garLoopResultBuilder]: For program point L196-3(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,505 INFO L853 garLoopResultBuilder]: At program point L97-1(lines 85 116) the Hoare annotation is: (let ((.cse0 (= ~t2_pc~0 1))) (let ((.cse19 (+ ~local~0 1)) (.cse3 (< 0 ~t1_st~0)) (.cse17 (= ~m_pc~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse5 (= ~E_M~0 2)) (.cse15 (not .cse0)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2))) (let ((.cse8 (or (and .cse17 .cse12 .cse1 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse15 .cse6 .cse7) (and (= ~t1_pc~0 1) .cse17 .cse12 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7))) (.cse9 (<= ~token~0 .cse19)) (.cse18 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse10 (<= .cse19 ~token~0)) (.cse11 (= 0 ~t2_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse4 (= ~m_pc~0 0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse11 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse15 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse13 .cse14 .cse15 .cse6 .cse7) (and (or (and .cse16 .cse0 .cse17 .cse12 .cse1 .cse2 .cse5 .cse6 .cse7 .cse18) (and .cse16 .cse0 .cse17 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7)) .cse13 .cse14) (and .cse9 (not .cse18) .cse0 .cse17 .cse12 .cse10 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse16 .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7))))) [2021-10-13 07:40:22,505 INFO L857 garLoopResultBuilder]: For program point L196-5(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,505 INFO L857 garLoopResultBuilder]: For program point L196-6(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,505 INFO L857 garLoopResultBuilder]: For program point L196-8(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,506 INFO L857 garLoopResultBuilder]: For program point L196-9(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,506 INFO L857 garLoopResultBuilder]: For program point L196-11(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,506 INFO L857 garLoopResultBuilder]: For program point L196-12(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,506 INFO L857 garLoopResultBuilder]: For program point L196-14(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,506 INFO L857 garLoopResultBuilder]: For program point L196-15(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,506 INFO L857 garLoopResultBuilder]: For program point L196-17(lines 196 205) no Hoare annotation was computed. [2021-10-13 07:40:22,506 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-10-13 07:40:22,507 INFO L857 garLoopResultBuilder]: For program point L197-1(lines 197 202) no Hoare annotation was computed. [2021-10-13 07:40:22,507 INFO L857 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-10-13 07:40:22,507 INFO L857 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-10-13 07:40:22,507 INFO L857 garLoopResultBuilder]: For program point L197-4(lines 197 202) no Hoare annotation was computed. [2021-10-13 07:40:22,507 INFO L857 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-10-13 07:40:22,507 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:40:22,514 INFO L853 garLoopResultBuilder]: At program point L297(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-13 07:40:22,514 INFO L853 garLoopResultBuilder]: At program point L133-1(lines 121 152) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse0)) (.cse11 (= ~t1_st~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= 2 ~t1_st~0)) (.cse12 (< 0 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse16 (+ ~local~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse13 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse15 .cse8 .cse9) (and (or (and .cse11 .cse12 .cse3 .cse4 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse8 .cse9) (and .cse11 (= ~t2_pc~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse14 .cse15) (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse5 (< .cse16 ~token~0) .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 (<= 2 ~t1_st~0) .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 (<= ~token~0 .cse16) .cse2 .cse12 .cse3 .cse4 (<= .cse16 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9)))) [2021-10-13 07:40:22,515 INFO L853 garLoopResultBuilder]: At program point L67(lines 41 80) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse3 (= ~t2_pc~0 1))) (let ((.cse10 (= 0 ~t2_st~0)) (.cse13 (not .cse3)) (.cse2 (= 2 ~t1_st~0)) (.cse1 (= 2 ~t2_st~0)) (.cse14 (not .cse0)) (.cse15 (= ~t1_st~0 0)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse9 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) .cse1 .cse2 .cse3 (= ~m_pc~0 1) .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse14 .cse15 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8) (and .cse1 .cse14 .cse15 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8)))) [2021-10-13 07:40:22,519 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:40:22,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:40:22 BoogieIcfgContainer [2021-10-13 07:40:22,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:40:22,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:40:22,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:40:22,601 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:40:22,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:40:01" (3/4) ... [2021-10-13 07:40:22,604 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 07:40:22,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2021-10-13 07:40:22,625 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-10-13 07:40:22,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 07:40:22,628 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:40:22,769 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:40:22,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:40:22,771 INFO L168 Benchmark]: Toolchain (without parser) took 23803.25 ms. Allocated memory was 127.9 MB in the beginning and 385.9 MB in the end (delta: 257.9 MB). Free memory was 96.2 MB in the beginning and 332.6 MB in the end (delta: -236.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:40:22,772 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 92.3 MB. Free memory is still 46.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:40:22,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.45 ms. Allocated memory is still 127.9 MB. Free memory was 96.2 MB in the beginning and 100.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:40:22,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.99 ms. Allocated memory is still 127.9 MB. Free memory was 100.6 MB in the beginning and 97.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:40:22,773 INFO L168 Benchmark]: Boogie Preprocessor took 72.96 ms. Allocated memory is still 127.9 MB. Free memory was 97.7 MB in the beginning and 95.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:40:22,775 INFO L168 Benchmark]: RCFGBuilder took 1653.65 ms. Allocated memory is still 127.9 MB. Free memory was 95.2 MB in the beginning and 68.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:40:22,776 INFO L168 Benchmark]: TraceAbstraction took 21471.41 ms. Allocated memory was 127.9 MB in the beginning and 385.9 MB in the end (delta: 257.9 MB). Free memory was 68.3 MB in the beginning and 349.3 MB in the end (delta: -281.0 MB). Peak memory consumption was 204.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:40:22,776 INFO L168 Benchmark]: Witness Printer took 169.59 ms. Allocated memory is still 385.9 MB. Free memory was 349.3 MB in the beginning and 332.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:40:22,779 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 92.3 MB. Free memory is still 46.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 362.45 ms. Allocated memory is still 127.9 MB. Free memory was 96.2 MB in the beginning and 100.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.99 ms. Allocated memory is still 127.9 MB. Free memory was 100.6 MB in the beginning and 97.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.96 ms. Allocated memory is still 127.9 MB. Free memory was 97.7 MB in the beginning and 95.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1653.65 ms. Allocated memory is still 127.9 MB. Free memory was 95.2 MB in the beginning and 68.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21471.41 ms. Allocated memory was 127.9 MB in the beginning and 385.9 MB in the end (delta: 257.9 MB). Free memory was 68.3 MB in the beginning and 349.3 MB in the end (delta: -281.0 MB). Peak memory consumption was 204.7 MB. Max. memory is 16.1 GB. * Witness Printer took 169.59 ms. Allocated memory is still 385.9 MB. Free memory was 349.3 MB in the beginning and 332.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21325.2ms, OverallIterations: 23, TraceHistogramMax: 4, EmptinessCheckTime: 72.6ms, AutomataDifference: 3240.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 9573.0ms, InitialAbstractionConstructionTime: 12.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3520 SDtfs, 4838 SDslu, 4429 SDs, 0 SdLazy, 930 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 925.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 442.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1748occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1521.4ms AutomataMinimizationTime, 23 MinimizatonAttempts, 3774 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 288 NumberOfFragments, 6220 HoareAnnotationTreeSize, 33 FomulaSimplifications, 179031 FormulaSimplificationTreeSizeReduction, 2110.6ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 47486 FormulaSimplificationTreeSizeReductionInter, 7441.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 180.5ms SsaConstructionTime, 723.7ms SatisfiabilityAnalysisTime, 3737.1ms InterpolantComputationTime, 1634 NumberOfCodeBlocks, 1634 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1901 ConstructedInterpolants, 0 QuantifiedInterpolants, 4748 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 33 InterpolantComputations, 28 PerfectInterpolantSequences, 482/493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || ((((((((((((__retres1 == 0 && 2 == t2_st) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || (((((((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_st == 0 && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) || ((((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2)) || ((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((((((t2_pc == 1 && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && token <= local + 1) && local + 1 <= token) && 0 == t2_st)) || (((((((t2_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && 0 == t2_st) && token <= local) && local <= token)) || ((((((((E_2 == 2 && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((E_2 == 2 && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((((token <= local + 1 && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((!(t1_pc == 1) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((m_pc == t1_pc && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && __retres1 == 0)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) RESULT: Ultimate proved your program to be correct! [2021-10-13 07:40:22,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e58b9d93-8392-4270-9b1a-5187aa07966e/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...