./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8 --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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:57:01,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:57:01,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:57:02,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:57:02,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:57:02,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:57:02,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:57:02,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:57:02,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:57:02,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:57:02,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:57:02,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:57:02,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:57:02,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:57:02,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:57:02,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:57:02,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:57:02,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:57:02,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:57:02,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:57:02,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:57:02,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:57:02,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:57:02,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:57:02,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:57:02,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:57:02,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:57:02,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:57:02,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:57:02,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:57:02,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:57:02,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:57:02,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:57:02,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:57:02,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:57:02,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:57:02,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:57:02,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:57:02,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:57:02,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:57:02,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:57:02,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:57:02,178 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:57:02,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:57:02,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:57:02,181 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:57:02,182 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:57:02,182 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:57:02,182 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:57:02,182 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:57:02,190 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:57:02,190 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:57:02,192 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:57:02,192 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:57:02,192 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:57:02,192 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:57:02,193 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:57:02,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:57:02,194 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:57:02,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:57:02,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:57:02,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:57:02,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:57:02,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:57:02,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:57:02,196 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:57:02,196 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:57:02,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:57:02,196 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:57:02,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:57:02,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:57:02,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:57:02,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:57:02,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:57:02,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:57:02,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:57:02,200 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:57:02,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:57:02,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:57:02,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:57:02,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:57:02,201 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_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/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_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2021-11-07 01:57:02,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:57:02,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:57:02,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:57:02,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:57:02,564 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:57:02,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-11-07 01:57:02,674 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/data/1e377863b/a3c8dbafa67e4cd3828f52a360310e8c/FLAG1d3c74bd0 [2021-11-07 01:57:03,267 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:57:03,268 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-11-07 01:57:03,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/data/1e377863b/a3c8dbafa67e4cd3828f52a360310e8c/FLAG1d3c74bd0 [2021-11-07 01:57:03,637 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/data/1e377863b/a3c8dbafa67e4cd3828f52a360310e8c [2021-11-07 01:57:03,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:57:03,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:57:03,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:57:03,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:57:03,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:57:03,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:03" (1/1) ... [2021-11-07 01:57:03,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77da47d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:03, skipping insertion in model container [2021-11-07 01:57:03,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:03" (1/1) ... [2021-11-07 01:57:03,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:57:03,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:57:03,863 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_9d520966-37a2-4716-b605-5ee650172c6b/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2021-11-07 01:57:03,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:57:03,944 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:57:03,955 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_9d520966-37a2-4716-b605-5ee650172c6b/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2021-11-07 01:57:03,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:57:04,009 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:57:04,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04 WrapperNode [2021-11-07 01:57:04,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:57:04,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:57:04,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:57:04,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:57:04,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:57:04,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:57:04,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:57:04,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:57:04,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:57:04,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:57:04,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:57:04,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:57:04,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (1/1) ... [2021-11-07 01:57:04,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:57:04,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:57:04,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:57:04,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:57:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:57:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:57:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:57:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:57:05,720 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:57:05,721 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-11-07 01:57:05,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:05 BoogieIcfgContainer [2021-11-07 01:57:05,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:57:05,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:57:05,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:57:05,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:57:05,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:57:03" (1/3) ... [2021-11-07 01:57:05,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5389edcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:57:05, skipping insertion in model container [2021-11-07 01:57:05,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:04" (2/3) ... [2021-11-07 01:57:05,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5389edcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:57:05, skipping insertion in model container [2021-11-07 01:57:05,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:05" (3/3) ... [2021-11-07 01:57:05,738 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-11-07 01:57:05,745 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:57:05,745 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:57:05,815 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:57:05,825 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, mAutomataTypeConcurrency=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-11-07 01:57:05,825 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:57:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 62 states have internal predecessors, (97), 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-11-07 01:57:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 01:57:05,868 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:05,868 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:05,869 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:05,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1969411625, now seen corresponding path program 1 times [2021-11-07 01:57:05,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:05,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502036454] [2021-11-07 01:57:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:05,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:06,154 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:06,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502036454] [2021-11-07 01:57:06,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502036454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:06,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:06,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:57:06,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215427387] [2021-11-07 01:57:06,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:57:06,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:57:06,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:06,180 INFO L87 Difference]: Start difference. First operand has 63 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 62 states have internal predecessors, (97), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-07 01:57:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:06,348 INFO L93 Difference]: Finished difference Result 204 states and 311 transitions. [2021-11-07 01:57:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:57:06,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-11-07 01:57:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:06,361 INFO L225 Difference]: With dead ends: 204 [2021-11-07 01:57:06,362 INFO L226 Difference]: Without dead ends: 137 [2021-11-07 01:57:06,365 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:57:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-07 01:57:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2021-11-07 01:57:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 123 states have internal predecessors, (173), 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-11-07 01:57:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2021-11-07 01:57:06,422 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 16 [2021-11-07 01:57:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:06,422 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2021-11-07 01:57:06,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-07 01:57:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2021-11-07 01:57:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:57:06,427 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:06,427 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:06,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:57:06,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash -371387725, now seen corresponding path program 1 times [2021-11-07 01:57:06,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:06,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540955526] [2021-11-07 01:57:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:06,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:06,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:06,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540955526] [2021-11-07 01:57:06,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540955526] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:06,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:06,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:57:06,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905036498] [2021-11-07 01:57:06,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:57:06,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:57:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:06,550 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-11-07 01:57:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:06,721 INFO L93 Difference]: Finished difference Result 354 states and 502 transitions. [2021-11-07 01:57:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:57:06,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2021-11-07 01:57:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:06,729 INFO L225 Difference]: With dead ends: 354 [2021-11-07 01:57:06,730 INFO L226 Difference]: Without dead ends: 237 [2021-11-07 01:57:06,732 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-07 01:57:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 187. [2021-11-07 01:57:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.4086021505376345) internal successors, (262), 186 states have internal predecessors, (262), 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-11-07 01:57:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 262 transitions. [2021-11-07 01:57:06,781 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 262 transitions. Word has length 23 [2021-11-07 01:57:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:06,781 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 262 transitions. [2021-11-07 01:57:06,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-11-07 01:57:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 262 transitions. [2021-11-07 01:57:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:57:06,783 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:06,784 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:06,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:57:06,785 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1370035568, now seen corresponding path program 1 times [2021-11-07 01:57:06,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:06,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971096385] [2021-11-07 01:57:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:06,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:57:06,882 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:06,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971096385] [2021-11-07 01:57:06,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971096385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:06,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:06,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:57:06,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560887612] [2021-11-07 01:57:06,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:57:06,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:57:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:06,885 INFO L87 Difference]: Start difference. First operand 187 states and 262 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-11-07 01:57:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:06,925 INFO L93 Difference]: Finished difference Result 419 states and 593 transitions. [2021-11-07 01:57:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:57:06,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 24 [2021-11-07 01:57:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:06,927 INFO L225 Difference]: With dead ends: 419 [2021-11-07 01:57:06,927 INFO L226 Difference]: Without dead ends: 263 [2021-11-07 01:57:06,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-11-07 01:57:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2021-11-07 01:57:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.3955555555555557) internal successors, (314), 225 states have internal predecessors, (314), 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-11-07 01:57:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2021-11-07 01:57:06,946 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 24 [2021-11-07 01:57:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:06,946 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2021-11-07 01:57:06,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-11-07 01:57:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2021-11-07 01:57:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:57:06,948 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:06,949 INFO L513 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] [2021-11-07 01:57:06,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:57:06,949 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash -465627275, now seen corresponding path program 1 times [2021-11-07 01:57:06,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:06,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047029529] [2021-11-07 01:57:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:06,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:07,012 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:07,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047029529] [2021-11-07 01:57:07,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047029529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:07,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:07,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:57:07,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842593521] [2021-11-07 01:57:07,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:57:07,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:07,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:57:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:07,022 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-07 01:57:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:07,063 INFO L93 Difference]: Finished difference Result 412 states and 586 transitions. [2021-11-07 01:57:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:57:07,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-11-07 01:57:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:07,065 INFO L225 Difference]: With dead ends: 412 [2021-11-07 01:57:07,066 INFO L226 Difference]: Without dead ends: 255 [2021-11-07 01:57:07,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-07 01:57:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2021-11-07 01:57:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.4083333333333334) internal successors, (338), 240 states have internal predecessors, (338), 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-11-07 01:57:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 338 transitions. [2021-11-07 01:57:07,089 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 338 transitions. Word has length 29 [2021-11-07 01:57:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:07,090 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 338 transitions. [2021-11-07 01:57:07,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-07 01:57:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 338 transitions. [2021-11-07 01:57:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 01:57:07,104 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:07,105 INFO L513 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] [2021-11-07 01:57:07,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:57:07,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 283737111, now seen corresponding path program 1 times [2021-11-07 01:57:07,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:07,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388309940] [2021-11-07 01:57:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:07,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:57:07,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:07,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388309940] [2021-11-07 01:57:07,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388309940] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:07,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:07,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:57:07,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306523268] [2021-11-07 01:57:07,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:57:07,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:07,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:57:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:07,210 INFO L87 Difference]: Start difference. First operand 241 states and 338 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-11-07 01:57:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:07,317 INFO L93 Difference]: Finished difference Result 784 states and 1099 transitions. [2021-11-07 01:57:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:57:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 42 [2021-11-07 01:57:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:07,321 INFO L225 Difference]: With dead ends: 784 [2021-11-07 01:57:07,322 INFO L226 Difference]: Without dead ends: 550 [2021-11-07 01:57:07,322 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-11-07 01:57:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 422. [2021-11-07 01:57:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.3752969121140142) internal successors, (579), 421 states have internal predecessors, (579), 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-11-07 01:57:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 579 transitions. [2021-11-07 01:57:07,350 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 579 transitions. Word has length 42 [2021-11-07 01:57:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:07,350 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 579 transitions. [2021-11-07 01:57:07,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-11-07 01:57:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 579 transitions. [2021-11-07 01:57:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 01:57:07,352 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:07,353 INFO L513 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] [2021-11-07 01:57:07,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:57:07,353 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1416969614, now seen corresponding path program 1 times [2021-11-07 01:57:07,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:07,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543373997] [2021-11-07 01:57:07,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:07,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:07,453 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:07,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543373997] [2021-11-07 01:57:07,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543373997] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:07,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:07,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:57:07,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804388855] [2021-11-07 01:57:07,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:57:07,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:07,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:57:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:07,460 INFO L87 Difference]: Start difference. First operand 422 states and 579 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-11-07 01:57:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:07,533 INFO L93 Difference]: Finished difference Result 787 states and 1096 transitions. [2021-11-07 01:57:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:57:07,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2021-11-07 01:57:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:07,536 INFO L225 Difference]: With dead ends: 787 [2021-11-07 01:57:07,537 INFO L226 Difference]: Without dead ends: 372 [2021-11-07 01:57:07,538 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:57:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-07 01:57:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 307. [2021-11-07 01:57:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3790849673202614) internal successors, (422), 306 states have internal predecessors, (422), 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-11-07 01:57:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 422 transitions. [2021-11-07 01:57:07,561 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 422 transitions. Word has length 43 [2021-11-07 01:57:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:07,563 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 422 transitions. [2021-11-07 01:57:07,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-11-07 01:57:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 422 transitions. [2021-11-07 01:57:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 01:57:07,565 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:07,565 INFO L513 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] [2021-11-07 01:57:07,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:57:07,566 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash -791937807, now seen corresponding path program 1 times [2021-11-07 01:57:07,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:07,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719430389] [2021-11-07 01:57:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:07,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:07,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:07,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719430389] [2021-11-07 01:57:07,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719430389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:07,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:07,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:57:07,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103158939] [2021-11-07 01:57:07,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:57:07,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:57:07,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:07,669 INFO L87 Difference]: Start difference. First operand 307 states and 422 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-07 01:57:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:07,704 INFO L93 Difference]: Finished difference Result 499 states and 691 transitions. [2021-11-07 01:57:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:57:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2021-11-07 01:57:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:07,706 INFO L225 Difference]: With dead ends: 499 [2021-11-07 01:57:07,707 INFO L226 Difference]: Without dead ends: 200 [2021-11-07 01:57:07,708 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-07 01:57:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2021-11-07 01:57:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.3010204081632653) internal successors, (255), 196 states have internal predecessors, (255), 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-11-07 01:57:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 255 transitions. [2021-11-07 01:57:07,729 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 255 transitions. Word has length 45 [2021-11-07 01:57:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:07,729 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 255 transitions. [2021-11-07 01:57:07,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-07 01:57:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 255 transitions. [2021-11-07 01:57:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 01:57:07,731 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:07,731 INFO L513 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] [2021-11-07 01:57:07,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:57:07,731 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 278485872, now seen corresponding path program 1 times [2021-11-07 01:57:07,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:07,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299560871] [2021-11-07 01:57:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:07,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:07,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:07,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299560871] [2021-11-07 01:57:07,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299560871] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:07,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:07,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:57:07,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922658569] [2021-11-07 01:57:07,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:57:07,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:07,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:57:07,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:07,801 INFO L87 Difference]: Start difference. First operand 197 states and 255 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-07 01:57:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:07,836 INFO L93 Difference]: Finished difference Result 362 states and 473 transitions. [2021-11-07 01:57:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:57:07,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2021-11-07 01:57:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:07,839 INFO L225 Difference]: With dead ends: 362 [2021-11-07 01:57:07,839 INFO L226 Difference]: Without dead ends: 197 [2021-11-07 01:57:07,839 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-07 01:57:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-11-07 01:57:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 196 states have internal predecessors, (246), 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-11-07 01:57:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2021-11-07 01:57:07,853 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 45 [2021-11-07 01:57:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:07,855 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2021-11-07 01:57:07,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-07 01:57:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2021-11-07 01:57:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 01:57:07,857 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:07,857 INFO L513 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] [2021-11-07 01:57:07,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:57:07,857 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1988788844, now seen corresponding path program 1 times [2021-11-07 01:57:07,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:07,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907660067] [2021-11-07 01:57:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:07,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:07,958 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:07,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907660067] [2021-11-07 01:57:07,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907660067] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:57:07,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203413074] [2021-11-07 01:57:07,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:07,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:57:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:57:07,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:57:07,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:57:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:08,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-07 01:57:08,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:57:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:57:08,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:57:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:57:08,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203413074] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:08,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:57:08,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [4] total 7 [2021-11-07 01:57:08,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153630630] [2021-11-07 01:57:08,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:57:08,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:57:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:57:08,619 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-11-07 01:57:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:08,671 INFO L93 Difference]: Finished difference Result 332 states and 419 transitions. [2021-11-07 01:57:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:57:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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 46 [2021-11-07 01:57:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:08,674 INFO L225 Difference]: With dead ends: 332 [2021-11-07 01:57:08,674 INFO L226 Difference]: Without dead ends: 209 [2021-11-07 01:57:08,675 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:57:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-07 01:57:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2021-11-07 01:57:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.2244897959183674) internal successors, (240), 196 states have internal predecessors, (240), 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-11-07 01:57:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 240 transitions. [2021-11-07 01:57:08,693 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 240 transitions. Word has length 46 [2021-11-07 01:57:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:08,693 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 240 transitions. [2021-11-07 01:57:08,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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-11-07 01:57:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 240 transitions. [2021-11-07 01:57:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 01:57:08,695 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:08,695 INFO L513 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] [2021-11-07 01:57:08,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:57:08,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:57:08,910 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:08,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1315013779, now seen corresponding path program 1 times [2021-11-07 01:57:08,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:08,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299837809] [2021-11-07 01:57:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:08,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:08,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:08,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299837809] [2021-11-07 01:57:08,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299837809] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:08,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:08,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:57:08,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498793946] [2021-11-07 01:57:08,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:57:08,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:08,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:57:08,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:08,955 INFO L87 Difference]: Start difference. First operand 197 states and 240 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-11-07 01:57:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:08,998 INFO L93 Difference]: Finished difference Result 332 states and 409 transitions. [2021-11-07 01:57:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:57:08,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2021-11-07 01:57:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:09,000 INFO L225 Difference]: With dead ends: 332 [2021-11-07 01:57:09,001 INFO L226 Difference]: Without dead ends: 209 [2021-11-07 01:57:09,001 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:57:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-07 01:57:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2021-11-07 01:57:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.163265306122449) internal successors, (228), 196 states have internal predecessors, (228), 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-11-07 01:57:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-11-07 01:57:09,020 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 46 [2021-11-07 01:57:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:09,021 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-11-07 01:57:09,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-11-07 01:57:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-11-07 01:57:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 01:57:09,022 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:09,023 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:09,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:57:09,023 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1282233957, now seen corresponding path program 1 times [2021-11-07 01:57:09,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:09,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308071761] [2021-11-07 01:57:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:09,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:09,087 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:09,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308071761] [2021-11-07 01:57:09,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308071761] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:57:09,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440352272] [2021-11-07 01:57:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:09,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:57:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:57:09,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:57:09,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:57:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:09,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:57:09,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:57:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:09,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:57:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:57:09,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440352272] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:09,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:57:09,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 01:57:09,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737966511] [2021-11-07 01:57:09,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:57:09,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:57:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:57:09,451 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-11-07 01:57:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:09,490 INFO L93 Difference]: Finished difference Result 424 states and 493 transitions. [2021-11-07 01:57:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:57:09,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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 47 [2021-11-07 01:57:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:09,493 INFO L225 Difference]: With dead ends: 424 [2021-11-07 01:57:09,493 INFO L226 Difference]: Without dead ends: 259 [2021-11-07 01:57:09,494 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:57:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-07 01:57:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 215. [2021-11-07 01:57:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.1822429906542056) internal successors, (253), 214 states have internal predecessors, (253), 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-11-07 01:57:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2021-11-07 01:57:09,513 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 47 [2021-11-07 01:57:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:09,513 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2021-11-07 01:57:09,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-11-07 01:57:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2021-11-07 01:57:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 01:57:09,515 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:09,515 INFO L513 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] [2021-11-07 01:57:09,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:57:09,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:57:09,742 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:09,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:09,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1545126949, now seen corresponding path program 1 times [2021-11-07 01:57:09,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:09,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660554457] [2021-11-07 01:57:09,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:09,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:57:09,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:09,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660554457] [2021-11-07 01:57:09,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660554457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:09,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:09,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:57:09,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468560753] [2021-11-07 01:57:09,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:57:09,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:57:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:09,831 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11-07 01:57:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:09,921 INFO L93 Difference]: Finished difference Result 392 states and 463 transitions. [2021-11-07 01:57:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:57:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 47 [2021-11-07 01:57:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:09,924 INFO L225 Difference]: With dead ends: 392 [2021-11-07 01:57:09,924 INFO L226 Difference]: Without dead ends: 264 [2021-11-07 01:57:09,924 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-07 01:57:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 246. [2021-11-07 01:57:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.1673469387755102) internal successors, (286), 245 states have internal predecessors, (286), 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-11-07 01:57:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 286 transitions. [2021-11-07 01:57:09,944 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 286 transitions. Word has length 47 [2021-11-07 01:57:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:09,945 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 286 transitions. [2021-11-07 01:57:09,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11-07 01:57:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 286 transitions. [2021-11-07 01:57:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 01:57:09,946 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:09,946 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 01:57:09,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:57:09,947 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1327257981, now seen corresponding path program 1 times [2021-11-07 01:57:09,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:09,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418881070] [2021-11-07 01:57:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:09,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:57:10,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:10,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418881070] [2021-11-07 01:57:10,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418881070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:10,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:10,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:57:10,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751811981] [2021-11-07 01:57:10,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:57:10,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:57:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:10,013 INFO L87 Difference]: Start difference. First operand 246 states and 286 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-11-07 01:57:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:10,070 INFO L93 Difference]: Finished difference Result 508 states and 592 transitions. [2021-11-07 01:57:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:57:10,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 48 [2021-11-07 01:57:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:10,074 INFO L225 Difference]: With dead ends: 508 [2021-11-07 01:57:10,074 INFO L226 Difference]: Without dead ends: 506 [2021-11-07 01:57:10,076 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:57:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-07 01:57:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 368. [2021-11-07 01:57:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.1716621253405994) internal successors, (430), 367 states have internal predecessors, (430), 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-11-07 01:57:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 430 transitions. [2021-11-07 01:57:10,125 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 430 transitions. Word has length 48 [2021-11-07 01:57:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:10,125 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 430 transitions. [2021-11-07 01:57:10,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-11-07 01:57:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 430 transitions. [2021-11-07 01:57:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-07 01:57:10,127 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:10,127 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:10,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:57:10,127 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash 542289853, now seen corresponding path program 1 times [2021-11-07 01:57:10,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:10,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822873102] [2021-11-07 01:57:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:10,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-07 01:57:10,248 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:10,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822873102] [2021-11-07 01:57:10,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822873102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:10,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:57:10,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:57:10,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712802549] [2021-11-07 01:57:10,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:57:10,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:57:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:57:10,254 INFO L87 Difference]: Start difference. First operand 368 states and 430 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-07 01:57:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:10,432 INFO L93 Difference]: Finished difference Result 666 states and 773 transitions. [2021-11-07 01:57:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:57:10,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 78 [2021-11-07 01:57:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:10,436 INFO L225 Difference]: With dead ends: 666 [2021-11-07 01:57:10,436 INFO L226 Difference]: Without dead ends: 385 [2021-11-07 01:57:10,437 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:57:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-11-07 01:57:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 289. [2021-11-07 01:57:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.1597222222222223) internal successors, (334), 288 states have internal predecessors, (334), 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-11-07 01:57:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 334 transitions. [2021-11-07 01:57:10,479 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 334 transitions. Word has length 78 [2021-11-07 01:57:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:10,480 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 334 transitions. [2021-11-07 01:57:10,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-11-07 01:57:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2021-11-07 01:57:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-07 01:57:10,481 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:57:10,481 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:10,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 01:57:10,482 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:57:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:57:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1814596324, now seen corresponding path program 1 times [2021-11-07 01:57:10,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:57:10,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553434135] [2021-11-07 01:57:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:10,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:57:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:57:10,599 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:57:10,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553434135] [2021-11-07 01:57:10,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553434135] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:57:10,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660174783] [2021-11-07 01:57:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:57:10,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:57:10,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:57:10,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:57:10,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:57:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:57:10,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 01:57:10,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:57:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 01:57:10,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:57:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 01:57:11,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660174783] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:57:11,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:57:11,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 9 [2021-11-07 01:57:11,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186201761] [2021-11-07 01:57:11,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:57:11,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:57:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:57:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:57:11,172 INFO L87 Difference]: Start difference. First operand 289 states and 334 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-11-07 01:57:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:57:11,272 INFO L93 Difference]: Finished difference Result 491 states and 564 transitions. [2021-11-07 01:57:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:57:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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 79 [2021-11-07 01:57:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:57:11,273 INFO L225 Difference]: With dead ends: 491 [2021-11-07 01:57:11,273 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:57:11,276 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:57:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:57:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:57:11,276 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-11-07 01:57:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:57:11,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2021-11-07 01:57:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:57:11,277 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:57:11,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-11-07 01:57:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:57:11,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:57:11,280 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:57:11,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:57:11,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:57:11,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 01:57:11,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:11,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:57:13,592 INFO L853 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse8 (= ~m_st~0 0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~m_pc~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~m_st~0 2)) (.cse9 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= ~E_M~0 2)) (.cse6 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse3 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse11 .cse12 .cse3 .cse6) (and .cse8 (not .cse0) .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse9 .cse2 .cse3 .cse6))) [2021-11-07 01:57:13,593 INFO L853 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~t1_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-07 01:57:13,593 INFO L853 garLoopResultBuilder]: At program point L135-1(lines 123 137) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_M~0 2)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0))) (or (and .cse0 (= 2 ~t1_st~0) .cse1 .cse2 .cse3) (and (not .cse0) (= ~t1_st~0 0) (= ~m_pc~0 0) .cse1 .cse2 .cse3 (= ULTIMATE.start_eval_~tmp~0 1)))) [2021-11-07 01:57:13,593 INFO L853 garLoopResultBuilder]: At program point L69(lines 43 82) the Hoare annotation is: (let ((.cse1 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (= ~m_pc~0 0)) (.cse2 (= ~E_M~0 2)) (.cse3 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= ~m_pc~0 1) (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (and (not .cse0) (= ~t1_st~0 0) .cse4 .cse2 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ULTIMATE.start_eval_~tmp~0 1) .cse3))) [2021-11-07 01:57:13,594 INFO L853 garLoopResultBuilder]: At program point L135-2(lines 123 137) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~m_pc~0 1)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (< 0 ~t1_st~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_1~0 2))) (or (and .cse0 (= ~m_st~0 2) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= (+ ~local~0 1) ~token~0) .cse3 .cse4 (not .cse2) (< ~token~0 (+ 2 ~local~0)) .cse5))) [2021-11-07 01:57:13,594 INFO L853 garLoopResultBuilder]: At program point L135-3(lines 123 137) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= ~m_st~0 0)) (.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse6 .cse7) (and .cse0 .cse8 .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7))) [2021-11-07 01:57:13,594 INFO L853 garLoopResultBuilder]: At program point L135-4(lines 123 137) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ~m_st~0 2)) (.cse8 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6))) [2021-11-07 01:57:13,594 INFO L860 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2021-11-07 01:57:13,594 INFO L857 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2021-11-07 01:57:13,594 INFO L857 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L143-3(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L143-5(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L143-6(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L143-8(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L143-9(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,595 INFO L857 garLoopResultBuilder]: For program point L143-11(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,596 INFO L857 garLoopResultBuilder]: For program point L143-12(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,596 INFO L857 garLoopResultBuilder]: For program point L143-14(lines 143 152) no Hoare annotation was computed. [2021-11-07 01:57:13,596 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-11-07 01:57:13,596 INFO L857 garLoopResultBuilder]: For program point L144-1(lines 144 149) no Hoare annotation was computed. [2021-11-07 01:57:13,596 INFO L857 garLoopResultBuilder]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2021-11-07 01:57:13,596 INFO L857 garLoopResultBuilder]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2021-11-07 01:57:13,596 INFO L857 garLoopResultBuilder]: For program point L144-4(lines 144 149) no Hoare annotation was computed. [2021-11-07 01:57:13,597 INFO L857 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2021-11-07 01:57:13,597 INFO L853 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= 2 ~t1_st~0) (= ~m_pc~0 1) (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) (= ~E_M~0 2) (= ~E_1~0 2)) [2021-11-07 01:57:13,597 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2021-11-07 01:57:13,597 INFO L857 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2021-11-07 01:57:13,597 INFO L853 garLoopResultBuilder]: At program point L447(lines 447 456) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ~m_st~0 2)) (.cse8 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6))) [2021-11-07 01:57:13,598 INFO L853 garLoopResultBuilder]: At program point L447-1(lines 447 456) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ~m_st~0 2)) (.cse8 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6))) [2021-11-07 01:57:13,598 INFO L853 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~m_st~0 2)) (.cse7 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= ~E_M~0 2)) (.cse4 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse2 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse3 .cse4) (and .cse0 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 0) .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse7 .cse2 .cse3 .cse4))) [2021-11-07 01:57:13,598 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-07 01:57:13,598 INFO L857 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-11-07 01:57:13,598 INFO L853 garLoopResultBuilder]: At program point L220(lines 210 248) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0)) (.cse1 (= ~t1_st~0 0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse13 (= ~m_pc~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse6 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse8 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~m_st~0 2)) (.cse11 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse2 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse3 .cse7) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse3 .cse7) (and .cse10 (not .cse8) .cse1 .cse12 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse11 .cse2 .cse3 .cse7))) [2021-11-07 01:57:13,599 INFO L853 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~t1_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-11-07 01:57:13,599 INFO L853 garLoopResultBuilder]: At program point L154-1(lines 142 156) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_M~0 2)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0))) (or (and .cse0 (= 2 ~t1_st~0) .cse1 .cse2 .cse3) (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (not .cse0) (= ~t1_st~0 0) (= ~m_pc~0 0) .cse1 .cse2 .cse3 (= ULTIMATE.start_eval_~tmp~0 1)))) [2021-11-07 01:57:13,599 INFO L857 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2021-11-07 01:57:13,599 INFO L853 garLoopResultBuilder]: At program point L154-2(lines 142 156) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~m_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (< 0 ~t1_st~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_1~0 2))) (or (and .cse0 .cse1 (= ~m_st~0 2) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 (<= (+ ~local~0 1) ~token~0) .cse4 .cse5 (not .cse3) (< ~token~0 (+ 2 ~local~0)) .cse6))) [2021-11-07 01:57:13,599 INFO L853 garLoopResultBuilder]: At program point L154-3(lines 142 156) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ~m_st~0 2)) (.cse8 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6))) [2021-11-07 01:57:13,600 INFO L853 garLoopResultBuilder]: At program point L154-4(lines 142 156) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ~m_st~0 2)) (.cse8 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse6))) [2021-11-07 01:57:13,600 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 01:57:13,600 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2021-11-07 01:57:13,600 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,600 INFO L853 garLoopResultBuilder]: At program point L91(lines 91 95) the Hoare annotation is: (let ((.cse0 (< 0 ~t1_st~0)) (.cse1 (= ~E_M~0 2)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0)) (.cse4 (= ~E_1~0 2))) (or (and (= ~m_st~0 0) (not (= ~t1_pc~0 1)) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4) (and (= ~m_st~0 2) (= ~m_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-11-07 01:57:13,600 INFO L857 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,600 INFO L857 garLoopResultBuilder]: For program point L124-3(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,600 INFO L857 garLoopResultBuilder]: For program point L124-5(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,601 INFO L857 garLoopResultBuilder]: For program point L124-6(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,601 INFO L857 garLoopResultBuilder]: For program point L124-8(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,601 INFO L857 garLoopResultBuilder]: For program point L124-9(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,601 INFO L857 garLoopResultBuilder]: For program point L124-11(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,601 INFO L857 garLoopResultBuilder]: For program point L124-12(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,601 INFO L857 garLoopResultBuilder]: For program point L124-14(lines 124 133) no Hoare annotation was computed. [2021-11-07 01:57:13,601 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2021-11-07 01:57:13,602 INFO L857 garLoopResultBuilder]: For program point L125-1(lines 125 130) no Hoare annotation was computed. [2021-11-07 01:57:13,602 INFO L857 garLoopResultBuilder]: For program point L125-2(lines 125 130) no Hoare annotation was computed. [2021-11-07 01:57:13,602 INFO L857 garLoopResultBuilder]: For program point L125-3(lines 125 130) no Hoare annotation was computed. [2021-11-07 01:57:13,602 INFO L857 garLoopResultBuilder]: For program point L125-4(lines 125 130) no Hoare annotation was computed. [2021-11-07 01:57:13,602 INFO L857 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2021-11-07 01:57:13,602 INFO L853 garLoopResultBuilder]: At program point L428-1(lines 283 465) the Hoare annotation is: (let ((.cse5 (= ~m_pc~0 0)) (.cse1 (= ~m_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_M~0 2)) (.cse3 (= ~t1_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse0 .cse1 .cse10 .cse4 .cse5 .cse6 .cse9) (and .cse2 .cse0 .cse11 .cse10 .cse12 .cse4 .cse6 .cse9) (and .cse2 .cse0 .cse1 .cse10 .cse12 .cse4 (<= (+ ~local~0 1) ~token~0) (< ~token~0 (+ 2 ~local~0)) .cse6 .cse9) (and .cse2 .cse0 .cse11 .cse12 .cse4 .cse6 (not .cse3) .cse7 .cse8 .cse9))) [2021-11-07 01:57:13,602 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-11-07 01:57:13,603 INFO L853 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse7 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse2 (= ~E_M~0 2)) (.cse4 (= ~E_1~0 2))) (let ((.cse6 (let ((.cse9 (= ~m_st~0 2))) (or (and .cse7 .cse9 .cse8 .cse1 .cse2 .cse4) (and .cse9 .cse8 (< 0 ~t1_st~0) .cse2 .cse4)))) (.cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~m_st~0 0)) (.cse3 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 (= ~m_pc~0 0) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse3) (and .cse6 .cse3 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) (and .cse7 .cse5 .cse0 .cse8 (<= (+ ~local~0 1) ~token~0) (not .cse1) (< ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4)))) [2021-11-07 01:57:13,606 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:57:13,608 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:57:13,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:57:13 BoogieIcfgContainer [2021-11-07 01:57:13,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:57:13,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:57:13,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:57:13,654 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:57:13,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:05" (3/4) ... [2021-11-07 01:57:13,657 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:57:13,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2021-11-07 01:57:13,677 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-11-07 01:57:13,678 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-07 01:57:13,679 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:57:13,775 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:57:13,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:57:13,777 INFO L168 Benchmark]: Toolchain (without parser) took 10127.49 ms. Allocated memory was 100.7 MB in the beginning and 188.7 MB in the end (delta: 88.1 MB). Free memory was 68.7 MB in the beginning and 112.7 MB in the end (delta: -44.0 MB). Peak memory consumption was 43.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:57:13,778 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 100.7 MB. Free memory is still 52.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:57:13,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.74 ms. Allocated memory is still 100.7 MB. Free memory was 68.4 MB in the beginning and 75.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:57:13,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.08 ms. Allocated memory is still 100.7 MB. Free memory was 75.2 MB in the beginning and 73.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:57:13,779 INFO L168 Benchmark]: Boogie Preprocessor took 45.05 ms. Allocated memory is still 100.7 MB. Free memory was 73.1 MB in the beginning and 71.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:57:13,780 INFO L168 Benchmark]: RCFGBuilder took 1596.14 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 71.0 MB in the beginning and 83.0 MB in the end (delta: -12.0 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-11-07 01:57:13,780 INFO L168 Benchmark]: TraceAbstraction took 7924.74 ms. Allocated memory was 121.6 MB in the beginning and 188.7 MB in the end (delta: 67.1 MB). Free memory was 82.3 MB in the beginning and 122.1 MB in the end (delta: -39.8 MB). Peak memory consumption was 82.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:57:13,781 INFO L168 Benchmark]: Witness Printer took 122.37 ms. Allocated memory is still 188.7 MB. Free memory was 122.1 MB in the beginning and 112.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:57:13,783 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.32 ms. Allocated memory is still 100.7 MB. Free memory is still 52.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 358.74 ms. Allocated memory is still 100.7 MB. Free memory was 68.4 MB in the beginning and 75.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.08 ms. Allocated memory is still 100.7 MB. Free memory was 75.2 MB in the beginning and 73.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.05 ms. Allocated memory is still 100.7 MB. Free memory was 73.1 MB in the beginning and 71.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1596.14 ms. Allocated memory was 100.7 MB in the beginning and 121.6 MB in the end (delta: 21.0 MB). Free memory was 71.0 MB in the beginning and 83.0 MB in the end (delta: -12.0 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7924.74 ms. Allocated memory was 121.6 MB in the beginning and 188.7 MB in the end (delta: 67.1 MB). Free memory was 82.3 MB in the beginning and 122.1 MB in the end (delta: -39.8 MB). Peak memory consumption was 82.7 MB. Max. memory is 16.1 GB. * Witness Printer took 122.37 ms. Allocated memory is still 188.7 MB. Free memory was 122.1 MB in the beginning and 112.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: 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, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1386 SDtfs, 1286 SDslu, 1515 SDs, 0 SdLazy, 508 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=5, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 630 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 123 NumberOfFragments, 1826 HoareAnnotationTreeSize, 22 FomulaSimplifications, 6376 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 698 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 830 NumberOfCodeBlocks, 830 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 981 ConstructedInterpolants, 0 QuantifiedInterpolants, 2031 SizeOfPredicates, 10 NumberOfNonLiveVariables, 837 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 372/377 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: 142]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) || (((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && m_st == 2) && m_pc == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || ((((((m_st == 2 && t1_st == 0) && m_pc == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((t1_pc == 1 && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((m_st == 0 && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) || (((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((m_pc == t1_pc && m_st == 0) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && m_st == 2) && m_pc == 1) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) || ((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || ((((((t1_pc == 1 && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && m_st == 2) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && 0 < t1_st) && E_1 == 2) || (((((((t1_pc == 1 && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && 0 < t1_st) && !(__retres1 == 0)) && token < 2 + local) && E_1 == 2) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((m_st == 0 && !(t1_pc == 1)) && __retres1 == 0) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || ((((((m_st == 2 && m_pc == 1) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((__retres1 == 0 && m_pc == t1_pc) && m_st == 0) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) || (((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) || (((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((t1_pc == 1 && 2 == t1_st) && E_M == 2) && token <= local) && local <= token) || ((((((!(t1_pc == 1) && t1_st == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((m_st == 0 && __retres1 == 0) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && E_1 == 2) || ((__retres1 == 0 && ((((((t1_pc == 1 && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2) || ((((m_st == 2 && m_pc == 1) && 0 < t1_st) && E_M == 2) && E_1 == 2))) && !(t1_st == 0))) || (((((((((t1_pc == 1 && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2) || ((((m_st == 2 && m_pc == 1) && 0 < t1_st) && E_M == 2) && E_1 == 2)) && !(t1_st == 0)) && token <= local) && local <= token)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && m_pc == 1) && local + 1 <= token) && !(__retres1 == 0)) && token < 2 + local) && E_M == 2) && !(t1_st == 0)) && E_1 == 2) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || ((((((t1_pc == 1 && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((t1_pc == 1 && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) || (((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && m_pc == 1) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((m_st == 2 && t1_st == 0) && m_pc == 1) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) || ((((((t1_pc == 1 && m_st == 2) && m_pc == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && m_pc == 1) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2)) || ((((((t1_pc == 1 && m_st == 0) && 2 == t1_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((m_st == 0 && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || ((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && 2 == t1_st) && m_pc == 1) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && m_pc == 1) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2) || ((((t1_pc == 1 && 2 == t1_st) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((!(t1_pc == 1) && t1_st == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((t1_pc == 1 && 2 == t1_st) && E_M == 2) && token <= local) && local <= token) || (((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && m_st == 2) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && 0 < t1_st) && E_1 == 2) || (((((((((t1_pc == 1 && __retres1 == 0) && m_st == 0) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && 0 < t1_st) && !(__retres1 == 0)) && token < 2 + local) && E_1 == 2) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && m_pc == 1) && local + 1 <= token) && token < 2 + local) && E_M == 2) && E_1 == 2 RESULT: Ultimate proved your program to be correct! [2021-11-07 01:57:13,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d520966-37a2-4716-b605-5ee650172c6b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE