./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:45:40,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:45:40,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:45:40,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:45:40,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:45:40,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:45:40,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:45:40,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:45:40,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:45:40,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:45:40,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:45:40,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:45:40,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:45:40,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:45:40,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:45:40,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:45:40,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:45:40,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:45:40,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:45:40,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:45:40,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:45:40,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:45:40,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:45:40,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:45:40,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:45:40,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:45:40,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:45:40,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:45:40,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:45:40,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:45:40,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:45:40,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:45:40,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:45:40,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:45:40,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:45:40,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:45:40,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:45:40,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:45:40,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:45:40,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:45:40,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:45:40,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:45:40,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:45:40,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:45:40,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:45:40,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:45:40,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:45:40,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:45:40,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:45:40,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:45:40,305 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:45:40,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:45:40,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:45:40,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:45:40,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:45:40,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:45:40,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:45:40,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:45:40,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:45:40,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:45:40,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:45:40,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:45:40,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:45:40,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:45:40,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:45:40,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:45:40,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:40,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:45:40,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:45:40,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:45:40,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:45:40,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:45:40,311 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:45:40,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:45:40,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:45:40,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/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_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 [2022-11-02 20:45:40,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:45:40,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:45:40,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:45:40,710 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:45:40,711 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:45:40,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-02 20:45:40,806 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/data/3cc9f1517/d98ebe71512f43f58b3edcbd6926f76c/FLAG24aff509d [2022-11-02 20:45:41,368 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:45:41,368 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-02 20:45:41,377 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/data/3cc9f1517/d98ebe71512f43f58b3edcbd6926f76c/FLAG24aff509d [2022-11-02 20:45:41,712 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/data/3cc9f1517/d98ebe71512f43f58b3edcbd6926f76c [2022-11-02 20:45:41,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:45:41,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:45:41,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:41,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:45:41,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:45:41,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:41" (1/1) ... [2022-11-02 20:45:41,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28960f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:41, skipping insertion in model container [2022-11-02 20:45:41,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:41" (1/1) ... [2022-11-02 20:45:41,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:45:41,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:45:41,966 WARN L230 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_15d26020-bbbd-4abc-a707-9dcbae4950ee/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-02 20:45:42,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:42,024 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:45:42,037 WARN L230 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_15d26020-bbbd-4abc-a707-9dcbae4950ee/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-02 20:45:42,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:42,081 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:45:42,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42 WrapperNode [2022-11-02 20:45:42,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:42,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:42,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:45:42,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:45:42,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,130 INFO L138 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 215 [2022-11-02 20:45:42,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:42,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:45:42,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:45:42,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:45:42,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,161 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:45:42,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:45:42,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:45:42,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:45:42,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:42,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:42,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:45:42,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:45:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:45:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-02 20:45:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-02 20:45:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-02 20:45:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-02 20:45:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 20:45:42,277 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 20:45:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-02 20:45:42,279 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-02 20:45:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-02 20:45:42,280 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-02 20:45:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:45:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-02 20:45:42,280 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-02 20:45:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:45:42,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:45:42,387 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:45:42,390 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:45:42,726 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:45:42,734 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:45:42,747 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:45:42,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:42 BoogieIcfgContainer [2022-11-02 20:45:42,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:45:42,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:45:42,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:45:42,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:45:42,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:45:41" (1/3) ... [2022-11-02 20:45:42,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6255db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:42, skipping insertion in model container [2022-11-02 20:45:42,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42" (2/3) ... [2022-11-02 20:45:42,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6255db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:42, skipping insertion in model container [2022-11-02 20:45:42,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:42" (3/3) ... [2022-11-02 20:45:42,766 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-11-02 20:45:42,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:45:42,787 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:45:42,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:45:42,852 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@446affaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:45:42,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:45:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-02 20:45:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:45:42,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:42,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:42,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:42,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1624964503, now seen corresponding path program 1 times [2022-11-02 20:45:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:42,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693929729] [2022-11-02 20:45:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:42,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:43,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:43,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693929729] [2022-11-02 20:45:43,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693929729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:43,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:43,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:45:43,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085861992] [2022-11-02 20:45:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:43,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:43,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:43,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:43,519 INFO L87 Difference]: Start difference. First operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:44,421 INFO L93 Difference]: Finished difference Result 339 states and 511 transitions. [2022-11-02 20:45:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:45:44,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-02 20:45:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:44,445 INFO L225 Difference]: With dead ends: 339 [2022-11-02 20:45:44,446 INFO L226 Difference]: Without dead ends: 233 [2022-11-02 20:45:44,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:45:44,459 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 293 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:44,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 448 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:45:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-02 20:45:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2022-11-02 20:45:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 155 states have internal predecessors, (219), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-02 20:45:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 272 transitions. [2022-11-02 20:45:44,572 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 272 transitions. Word has length 56 [2022-11-02 20:45:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:44,572 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 272 transitions. [2022-11-02 20:45:44,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 272 transitions. [2022-11-02 20:45:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:45:44,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:44,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:44,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:45:44,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:44,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 713012507, now seen corresponding path program 1 times [2022-11-02 20:45:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:44,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205594451] [2022-11-02 20:45:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:44,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205594451] [2022-11-02 20:45:44,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205594451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:44,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:44,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:45:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772027985] [2022-11-02 20:45:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:44,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:45:44,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:45:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:44,939 INFO L87 Difference]: Start difference. First operand 192 states and 272 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:45,897 INFO L93 Difference]: Finished difference Result 524 states and 746 transitions. [2022-11-02 20:45:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:45:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-02 20:45:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:45,907 INFO L225 Difference]: With dead ends: 524 [2022-11-02 20:45:45,908 INFO L226 Difference]: Without dead ends: 341 [2022-11-02 20:45:45,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:45:45,920 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:45,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 685 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:45:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-02 20:45:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 277. [2022-11-02 20:45:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 221 states have (on average 1.420814479638009) internal successors, (314), 224 states have internal predecessors, (314), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-02 20:45:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 389 transitions. [2022-11-02 20:45:45,994 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 389 transitions. Word has length 56 [2022-11-02 20:45:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:45,995 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 389 transitions. [2022-11-02 20:45:45,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 389 transitions. [2022-11-02 20:45:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:45:46,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:46,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:46,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:45:46,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1336375335, now seen corresponding path program 1 times [2022-11-02 20:45:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:46,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381100829] [2022-11-02 20:45:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:46,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:46,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381100829] [2022-11-02 20:45:46,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381100829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:46,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:46,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:45:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516421667] [2022-11-02 20:45:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:46,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:45:46,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:45:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:46,275 INFO L87 Difference]: Start difference. First operand 277 states and 389 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:47,084 INFO L93 Difference]: Finished difference Result 860 states and 1213 transitions. [2022-11-02 20:45:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:45:47,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-02 20:45:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:47,088 INFO L225 Difference]: With dead ends: 860 [2022-11-02 20:45:47,089 INFO L226 Difference]: Without dead ends: 592 [2022-11-02 20:45:47,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:45:47,091 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 328 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:47,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 667 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:45:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-02 20:45:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 442. [2022-11-02 20:45:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4152542372881356) internal successors, (501), 359 states have internal predecessors, (501), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-02 20:45:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 620 transitions. [2022-11-02 20:45:47,146 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 620 transitions. Word has length 56 [2022-11-02 20:45:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:47,146 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 620 transitions. [2022-11-02 20:45:47,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 620 transitions. [2022-11-02 20:45:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:45:47,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:47,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:47,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:45:47,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2061198683, now seen corresponding path program 1 times [2022-11-02 20:45:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:47,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854117178] [2022-11-02 20:45:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854117178] [2022-11-02 20:45:47,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854117178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:47,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:47,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:45:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738206172] [2022-11-02 20:45:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:47,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:45:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:45:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:47,266 INFO L87 Difference]: Start difference. First operand 442 states and 620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:47,679 INFO L93 Difference]: Finished difference Result 961 states and 1363 transitions. [2022-11-02 20:45:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:45:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-02 20:45:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:47,683 INFO L225 Difference]: With dead ends: 961 [2022-11-02 20:45:47,683 INFO L226 Difference]: Without dead ends: 528 [2022-11-02 20:45:47,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:45:47,686 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 250 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:47,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 295 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:45:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-02 20:45:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 442. [2022-11-02 20:45:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4011299435028248) internal successors, (496), 359 states have internal predecessors, (496), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-02 20:45:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 615 transitions. [2022-11-02 20:45:47,737 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 615 transitions. Word has length 56 [2022-11-02 20:45:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:47,738 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 615 transitions. [2022-11-02 20:45:47,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 615 transitions. [2022-11-02 20:45:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:45:47,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:47,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:47,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:45:47,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1985622119, now seen corresponding path program 1 times [2022-11-02 20:45:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:47,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745764516] [2022-11-02 20:45:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:47,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745764516] [2022-11-02 20:45:47,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745764516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:47,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:47,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:45:47,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431351071] [2022-11-02 20:45:47,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:47,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:47,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:47,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:47,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:47,833 INFO L87 Difference]: Start difference. First operand 442 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:48,591 INFO L93 Difference]: Finished difference Result 1435 states and 2006 transitions. [2022-11-02 20:45:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:45:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-11-02 20:45:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:48,600 INFO L225 Difference]: With dead ends: 1435 [2022-11-02 20:45:48,600 INFO L226 Difference]: Without dead ends: 1003 [2022-11-02 20:45:48,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:45:48,604 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 379 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:48,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 535 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:45:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-11-02 20:45:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 846. [2022-11-02 20:45:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 675 states have (on average 1.3733333333333333) internal successors, (927), 689 states have internal predecessors, (927), 102 states have call successors, (102), 60 states have call predecessors, (102), 68 states have return successors, (125), 100 states have call predecessors, (125), 102 states have call successors, (125) [2022-11-02 20:45:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1154 transitions. [2022-11-02 20:45:48,710 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1154 transitions. Word has length 56 [2022-11-02 20:45:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:48,710 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1154 transitions. [2022-11-02 20:45:48,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:45:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1154 transitions. [2022-11-02 20:45:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:45:48,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:48,715 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:48,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:45:48,716 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -34790867, now seen corresponding path program 1 times [2022-11-02 20:45:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:48,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925880215] [2022-11-02 20:45:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:45:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:45:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:45:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925880215] [2022-11-02 20:45:48,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925880215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:48,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102992858] [2022-11-02 20:45:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:48,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:48,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:48,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:48,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:45:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:49,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:45:49,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:45:49,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:49,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102992858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:49,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:49,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:45:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511215982] [2022-11-02 20:45:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:49,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:49,137 INFO L87 Difference]: Start difference. First operand 846 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:49,414 INFO L93 Difference]: Finished difference Result 2437 states and 3376 transitions. [2022-11-02 20:45:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:49,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2022-11-02 20:45:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:49,424 INFO L225 Difference]: With dead ends: 2437 [2022-11-02 20:45:49,424 INFO L226 Difference]: Without dead ends: 1602 [2022-11-02 20:45:49,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:49,436 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 113 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:49,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-11-02 20:45:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-11-02 20:45:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1280 states have (on average 1.36171875) internal successors, (1743), 1303 states have internal predecessors, (1743), 189 states have call successors, (189), 116 states have call predecessors, (189), 132 states have return successors, (260), 190 states have call predecessors, (260), 189 states have call successors, (260) [2022-11-02 20:45:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2192 transitions. [2022-11-02 20:45:49,600 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2192 transitions. Word has length 91 [2022-11-02 20:45:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:49,603 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2192 transitions. [2022-11-02 20:45:49,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2192 transitions. [2022-11-02 20:45:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:45:49,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:49,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:49,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:49,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:45:49,858 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1902655295, now seen corresponding path program 1 times [2022-11-02 20:45:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:49,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710569754] [2022-11-02 20:45:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:45:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:45:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:45:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:45:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:50,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710569754] [2022-11-02 20:45:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710569754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:50,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941044938] [2022-11-02 20:45:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:50,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:50,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:50,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:45:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:50,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:45:50,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:45:50,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:50,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941044938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:50,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:50,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-02 20:45:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798190625] [2022-11-02 20:45:50,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:50,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:50,474 INFO L87 Difference]: Start difference. First operand 1602 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:50,775 INFO L93 Difference]: Finished difference Result 4682 states and 6441 transitions. [2022-11-02 20:45:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:50,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2022-11-02 20:45:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:50,794 INFO L225 Difference]: With dead ends: 4682 [2022-11-02 20:45:50,795 INFO L226 Difference]: Without dead ends: 3094 [2022-11-02 20:45:50,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:50,801 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 68 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:50,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 277 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-11-02 20:45:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3052. [2022-11-02 20:45:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3052 states, 2440 states have (on average 1.353688524590164) internal successors, (3303), 2484 states have internal predecessors, (3303), 353 states have call successors, (353), 226 states have call predecessors, (353), 258 states have return successors, (476), 349 states have call predecessors, (476), 353 states have call successors, (476) [2022-11-02 20:45:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 4132 transitions. [2022-11-02 20:45:51,142 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 4132 transitions. Word has length 117 [2022-11-02 20:45:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:51,142 INFO L495 AbstractCegarLoop]: Abstraction has 3052 states and 4132 transitions. [2022-11-02 20:45:51,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 4132 transitions. [2022-11-02 20:45:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:45:51,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:51,153 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:51,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:51,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:51,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash -844102889, now seen corresponding path program 1 times [2022-11-02 20:45:51,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550563552] [2022-11-02 20:45:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:45:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:45:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:45:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:45:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-02 20:45:51,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:51,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550563552] [2022-11-02 20:45:51,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550563552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:51,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509190726] [2022-11-02 20:45:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:51,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:51,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:45:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:45:51,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:45:51,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:51,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509190726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:51,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:51,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:45:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347286622] [2022-11-02 20:45:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:51,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:51,808 INFO L87 Difference]: Start difference. First operand 3052 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:45:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:52,218 INFO L93 Difference]: Finished difference Result 5716 states and 7745 transitions. [2022-11-02 20:45:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 133 [2022-11-02 20:45:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:52,241 INFO L225 Difference]: With dead ends: 5716 [2022-11-02 20:45:52,241 INFO L226 Difference]: Without dead ends: 3388 [2022-11-02 20:45:52,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:52,250 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 100 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:52,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2022-11-02 20:45:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3350. [2022-11-02 20:45:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 2706 states have (on average 1.3263118994826313) internal successors, (3589), 2750 states have internal predecessors, (3589), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2022-11-02 20:45:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4456 transitions. [2022-11-02 20:45:52,614 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4456 transitions. Word has length 133 [2022-11-02 20:45:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:52,614 INFO L495 AbstractCegarLoop]: Abstraction has 3350 states and 4456 transitions. [2022-11-02 20:45:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:45:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4456 transitions. [2022-11-02 20:45:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:45:52,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:52,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:52,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:52,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:52,851 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:52,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash -797474129, now seen corresponding path program 1 times [2022-11-02 20:45:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:52,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899419774] [2022-11-02 20:45:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:45:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:45:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:45:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:45:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:53,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899419774] [2022-11-02 20:45:53,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899419774] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:53,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387831333] [2022-11-02 20:45:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:53,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:53,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:45:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:53,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:45:53,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:45:53,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:53,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387831333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:53,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:53,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:45:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543148166] [2022-11-02 20:45:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:53,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:53,250 INFO L87 Difference]: Start difference. First operand 3350 states and 4456 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:45:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:53,555 INFO L93 Difference]: Finished difference Result 5125 states and 6937 transitions. [2022-11-02 20:45:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:53,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 134 [2022-11-02 20:45:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:53,576 INFO L225 Difference]: With dead ends: 5125 [2022-11-02 20:45:53,577 INFO L226 Difference]: Without dead ends: 3376 [2022-11-02 20:45:53,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:53,585 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:53,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2022-11-02 20:45:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3334. [2022-11-02 20:45:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.3022304832713754) internal successors, (3503), 2734 states have internal predecessors, (3503), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2022-11-02 20:45:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4370 transitions. [2022-11-02 20:45:53,932 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4370 transitions. Word has length 134 [2022-11-02 20:45:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:53,933 INFO L495 AbstractCegarLoop]: Abstraction has 3334 states and 4370 transitions. [2022-11-02 20:45:53,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:45:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4370 transitions. [2022-11-02 20:45:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:45:53,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:53,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:53,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:54,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:45:54,159 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash -215256625, now seen corresponding path program 1 times [2022-11-02 20:45:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:54,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753839474] [2022-11-02 20:45:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:45:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:45:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:45:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:45:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:54,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753839474] [2022-11-02 20:45:54,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753839474] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:54,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803905251] [2022-11-02 20:45:54,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:54,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:54,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:54,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:54,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:45:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:54,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:45:54,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:45:54,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:54,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803905251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:54,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:54,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:45:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710173791] [2022-11-02 20:45:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:54,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:54,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:54,584 INFO L87 Difference]: Start difference. First operand 3334 states and 4370 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:45:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:54,928 INFO L93 Difference]: Finished difference Result 6834 states and 9069 transitions. [2022-11-02 20:45:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:54,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2022-11-02 20:45:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:54,948 INFO L225 Difference]: With dead ends: 6834 [2022-11-02 20:45:54,948 INFO L226 Difference]: Without dead ends: 3516 [2022-11-02 20:45:54,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:54,960 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:54,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2022-11-02 20:45:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3334. [2022-11-02 20:45:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.262081784386617) internal successors, (3395), 2734 states have internal predecessors, (3395), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (482), 355 states have call predecessors, (482), 359 states have call successors, (482) [2022-11-02 20:45:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4236 transitions. [2022-11-02 20:45:55,319 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4236 transitions. Word has length 134 [2022-11-02 20:45:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:55,319 INFO L495 AbstractCegarLoop]: Abstraction has 3334 states and 4236 transitions. [2022-11-02 20:45:55,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:45:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4236 transitions. [2022-11-02 20:45:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:45:55,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:55,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:55,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:55,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:45:55,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:55,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash -564777140, now seen corresponding path program 1 times [2022-11-02 20:45:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:55,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060206703] [2022-11-02 20:45:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:45:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:45:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:45:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:45:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:55,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060206703] [2022-11-02 20:45:55,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060206703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:55,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992270980] [2022-11-02 20:45:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:55,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:55,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:55,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:45:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:55,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:45:55,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-02 20:45:55,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:55,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992270980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:55,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:55,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-02 20:45:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464076980] [2022-11-02 20:45:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:55,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:45:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:55,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:45:55,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:45:55,980 INFO L87 Difference]: Start difference. First operand 3334 states and 4236 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:56,397 INFO L93 Difference]: Finished difference Result 4752 states and 6093 transitions. [2022-11-02 20:45:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:45:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-11-02 20:45:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:56,412 INFO L225 Difference]: With dead ends: 4752 [2022-11-02 20:45:56,413 INFO L226 Difference]: Without dead ends: 2682 [2022-11-02 20:45:56,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:45:56,420 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:56,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 257 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:45:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2022-11-02 20:45:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2658. [2022-11-02 20:45:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2142 states have (on average 1.2254901960784315) internal successors, (2625), 2168 states have internal predecessors, (2625), 295 states have call successors, (295), 204 states have call predecessors, (295), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-11-02 20:45:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3274 transitions. [2022-11-02 20:45:56,754 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3274 transitions. Word has length 135 [2022-11-02 20:45:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:56,755 INFO L495 AbstractCegarLoop]: Abstraction has 2658 states and 3274 transitions. [2022-11-02 20:45:56,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3274 transitions. [2022-11-02 20:45:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:45:56,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:56,764 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:56,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:56,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:56,980 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1871919538, now seen corresponding path program 1 times [2022-11-02 20:45:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:56,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687757220] [2022-11-02 20:45:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:45:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:45:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:45:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:45:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:57,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687757220] [2022-11-02 20:45:57,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687757220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:57,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388132443] [2022-11-02 20:45:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:57,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:57,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:57,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:57,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:45:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:57,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:45:57,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-02 20:45:57,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:57,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388132443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:57,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:57,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-02 20:45:57,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851672646] [2022-11-02 20:45:57,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:57,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:45:57,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:57,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:45:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:45:57,459 INFO L87 Difference]: Start difference. First operand 2658 states and 3274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:58,020 INFO L93 Difference]: Finished difference Result 4962 states and 6189 transitions. [2022-11-02 20:45:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:45:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-11-02 20:45:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:58,040 INFO L225 Difference]: With dead ends: 4962 [2022-11-02 20:45:58,040 INFO L226 Difference]: Without dead ends: 2611 [2022-11-02 20:45:58,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:45:58,051 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:58,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 264 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:45:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-11-02 20:45:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1652. [2022-11-02 20:45:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1348 states have (on average 1.1802670623145401) internal successors, (1591), 1362 states have internal predecessors, (1591), 173 states have call successors, (173), 122 states have call predecessors, (173), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-11-02 20:45:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1967 transitions. [2022-11-02 20:45:58,365 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1967 transitions. Word has length 135 [2022-11-02 20:45:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:58,365 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 1967 transitions. [2022-11-02 20:45:58,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1967 transitions. [2022-11-02 20:45:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:45:58,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:58,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:58,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:58,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:58,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash 25577228, now seen corresponding path program 1 times [2022-11-02 20:45:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:58,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250435405] [2022-11-02 20:45:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:45:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:45:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:45:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-02 20:45:58,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:58,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250435405] [2022-11-02 20:45:58,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250435405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:58,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102306897] [2022-11-02 20:45:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:58,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:58,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:58,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:58,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:45:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:45:58,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-02 20:45:58,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:58,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102306897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:58,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:58,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:45:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416539880] [2022-11-02 20:45:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:58,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:45:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:45:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:58,986 INFO L87 Difference]: Start difference. First operand 1652 states and 1967 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:59,245 INFO L93 Difference]: Finished difference Result 2779 states and 3331 transitions. [2022-11-02 20:45:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:45:59,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-11-02 20:45:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:59,251 INFO L225 Difference]: With dead ends: 2779 [2022-11-02 20:45:59,251 INFO L226 Difference]: Without dead ends: 1137 [2022-11-02 20:45:59,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:45:59,258 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 48 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:59,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 537 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-11-02 20:45:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1101. [2022-11-02 20:45:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 904 states have (on average 1.1537610619469028) internal successors, (1043), 914 states have internal predecessors, (1043), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-02 20:45:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1274 transitions. [2022-11-02 20:45:59,469 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1274 transitions. Word has length 135 [2022-11-02 20:45:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:59,469 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1274 transitions. [2022-11-02 20:45:59,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:45:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1274 transitions. [2022-11-02 20:45:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:45:59,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:59,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:59,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:59,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:45:59,699 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 537608328, now seen corresponding path program 1 times [2022-11-02 20:45:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:59,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989867427] [2022-11-02 20:45:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:45:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:45:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:45:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:45:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:45:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:45:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:45:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:45:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 20:45:59,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:59,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989867427] [2022-11-02 20:45:59,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989867427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:59,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879173140] [2022-11-02 20:45:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:59,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:59,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:59,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:59,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:45:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:45:59,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:46:00,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:46:00,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879173140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:00,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:46:00,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:46:00,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805286164] [2022-11-02 20:46:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:00,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:46:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:46:00,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:00,021 INFO L87 Difference]: Start difference. First operand 1101 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:46:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:00,209 INFO L93 Difference]: Finished difference Result 2220 states and 2613 transitions. [2022-11-02 20:46:00,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:00,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2022-11-02 20:46:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:00,216 INFO L225 Difference]: With dead ends: 2220 [2022-11-02 20:46:00,216 INFO L226 Difference]: Without dead ends: 1129 [2022-11-02 20:46:00,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:00,220 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 10 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:00,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 523 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:46:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-11-02 20:46:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1113. [2022-11-02 20:46:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 916 states have (on average 1.1288209606986899) internal successors, (1034), 926 states have internal predecessors, (1034), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-02 20:46:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1265 transitions. [2022-11-02 20:46:00,354 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1265 transitions. Word has length 135 [2022-11-02 20:46:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:00,355 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1265 transitions. [2022-11-02 20:46:00,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:46:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1265 transitions. [2022-11-02 20:46:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:46:00,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:00,358 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:00,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:00,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:00,567 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -219686780, now seen corresponding path program 1 times [2022-11-02 20:46:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:00,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947268752] [2022-11-02 20:46:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:46:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:46:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:46:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:46:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:46:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:46:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:46:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-02 20:46:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:00,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947268752] [2022-11-02 20:46:00,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947268752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:00,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:00,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350023397] [2022-11-02 20:46:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:00,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:00,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:00,763 INFO L87 Difference]: Start difference. First operand 1113 states and 1265 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:01,600 INFO L93 Difference]: Finished difference Result 2070 states and 2337 transitions. [2022-11-02 20:46:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:46:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 135 [2022-11-02 20:46:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:01,610 INFO L225 Difference]: With dead ends: 2070 [2022-11-02 20:46:01,611 INFO L226 Difference]: Without dead ends: 2068 [2022-11-02 20:46:01,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:46:01,613 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 470 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:01,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 474 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:46:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-11-02 20:46:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1489. [2022-11-02 20:46:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1226 states have (on average 1.1305057096247961) internal successors, (1386), 1240 states have internal predecessors, (1386), 144 states have call successors, (144), 103 states have call predecessors, (144), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-02 20:46:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1693 transitions. [2022-11-02 20:46:01,821 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1693 transitions. Word has length 135 [2022-11-02 20:46:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:01,821 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1693 transitions. [2022-11-02 20:46:01,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1693 transitions. [2022-11-02 20:46:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-02 20:46:01,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:01,827 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:01,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:46:01,828 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1479334343, now seen corresponding path program 2 times [2022-11-02 20:46:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:01,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021469001] [2022-11-02 20:46:01,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:46:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:46:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:46:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:46:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:46:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:46:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:46:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:46:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:46:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-11-02 20:46:01,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:01,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021469001] [2022-11-02 20:46:01,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021469001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:01,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:01,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62572867] [2022-11-02 20:46:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:01,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:01,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:01,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:01,998 INFO L87 Difference]: Start difference. First operand 1489 states and 1693 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-02 20:46:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:03,009 INFO L93 Difference]: Finished difference Result 3212 states and 3666 transitions. [2022-11-02 20:46:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:46:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 174 [2022-11-02 20:46:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:03,012 INFO L225 Difference]: With dead ends: 3212 [2022-11-02 20:46:03,012 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:46:03,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:46:03,018 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 582 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:03,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 418 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:46:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:46:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:46:03,020 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) [2022-11-02 20:46:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:46:03,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2022-11-02 20:46:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:03,021 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:46:03,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-02 20:46:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:46:03,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:46:03,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:46:03,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:46:03,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:46:25,237 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2022-11-02 20:46:25,238 INFO L895 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse20 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse22 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse23 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse24 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse26 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse27 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse21 (<= |activate_threads_~tmp~1#1| 0)) (.cse28 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse9 (and .cse25 .cse26 .cse18 (<= 2 ~m_st~0) .cse27 .cse21 .cse28)) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse14 (not (< ~local~0 ~token~0))) (.cse16 (not (<= ~token~0 (+ ~local~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse15 (not (<= 1 ~m_pc~0))) (.cse6 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse21 .cse28)) (.cse0 (not (<= 2 ~T1_E~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse13 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21 .cse22 .cse28 .cse23 .cse24)) (.cse5 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse2 .cse9 .cse10) (or .cse8 .cse0 .cse11 .cse2 .cse4 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse14 .cse15 .cse12 .cse13 .cse10 .cse16) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and (= ~m_st~0 0) .cse20 .cse22 (not (= ~t1_st~0 0)) .cse23 .cse24) .cse8 .cse0 .cse1 .cse3 .cse14 .cse15 .cse10 .cse16) (or .cse8 .cse0 .cse11 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (or .cse0 .cse11 .cse2 .cse4 .cse13 .cse5 .cse7)))) [2022-11-02 20:46:25,238 INFO L899 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2022-11-02 20:46:25,238 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2022-11-02 20:46:25,238 INFO L899 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2022-11-02 20:46:25,239 INFO L895 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse14 (= ~E_1~0 0)) (.cse11 (not (= ~token~0 ~local~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse5 (and .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse10 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse13 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse7 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse1 .cse7 .cse8 .cse4 .cse12 .cse5 .cse10 .cse9 .cse6 .cse13) (or .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse14 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse11) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse14 .cse11) (or .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse6) (or .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (or .cse0 .cse1 (and .cse15 .cse16) .cse7 .cse8 .cse12 .cse10 .cse6 .cse13)))) [2022-11-02 20:46:25,239 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2022-11-02 20:46:25,239 INFO L899 garLoopResultBuilder]: For program point L327-2(lines 311 335) no Hoare annotation was computed. [2022-11-02 20:46:25,240 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2022-11-02 20:46:25,240 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2022-11-02 20:46:25,240 INFO L899 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2022-11-02 20:46:25,240 INFO L895 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse22 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse23 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse24 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse25 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse20 (<= |activate_threads_~tmp~1#1| 0)) (.cse26 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse16 (and .cse23 .cse24 .cse18 (<= 2 ~m_st~0) .cse25 .cse20 .cse26)) (.cse5 (not (< ~local~0 ~token~0))) (.cse9 (not (<= ~token~0 (+ ~local~0 1)))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse21 .cse26 .cse22)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 1 ~m_pc~0))) (.cse11 (= ~E_1~0 0)) (.cse12 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26)) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse1 .cse15 .cse4 .cse6 .cse8 .cse13) (or .cse14 .cse1 .cse2 .cse10 .cse16 .cse8) (or .cse14 .cse1 .cse15 .cse10 .cse4 .cse16 .cse8) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse14 .cse1 .cse2 .cse3 .cse5 .cse6 (and (= ~m_st~0 0) .cse21 (not (= ~t1_st~0 0)) .cse22) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse15 .cse10 .cse4 .cse11 .cse13) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8) (or .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse8 .cse13) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12 .cse13)))) [2022-11-02 20:46:25,241 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2022-11-02 20:46:25,241 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 311 335) the Hoare annotation is: (let ((.cse13 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse11 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse8 (not (= ~t1_pc~0 1))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse5 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse8 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse10 .cse6) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse13 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse6) (or .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse12 .cse5 .cse6 .cse14))) [2022-11-02 20:46:25,241 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 311 335) no Hoare annotation was computed. [2022-11-02 20:46:25,242 INFO L895 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse4 (= ~E_1~0 0)) (.cse5 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse13 (not (< ~local~0 ~token~0))) (.cse12 (not (<= 1 ~m_pc~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1)))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse6 (and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0) .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse9 .cse10 .cse6) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse13 .cse12 .cse9 .cse10 .cse14 .cse6) (or .cse11 .cse0 .cse7 .cse8 .cse3 .cse12 .cse10 .cse6) (or .cse11 .cse0 .cse7 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse12 .cse4 .cse5 .cse6) (or .cse11 .cse0 .cse7 .cse2 .cse10 .cse6) (or .cse11 .cse0 (and .cse15 .cse16) .cse7 .cse8 .cse13 .cse12 .cse10 .cse14) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6)))) [2022-11-02 20:46:25,242 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 336 346) no Hoare annotation was computed. [2022-11-02 20:46:25,242 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 336 346) the Hoare annotation is: (let ((.cse4 (not (= ~m_pc~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse9 (= ~E_1~0 0)) (.cse10 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse8 (not (<= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10) (or .cse1 .cse2 (not (<= ~t1_pc~0 0)) .cse4 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (< ~local~0 ~token~0)) .cse8 .cse5 (not (<= ~token~0 (+ ~local~0 1)))))) [2022-11-02 20:46:25,242 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 336 346) no Hoare annotation was computed. [2022-11-02 20:46:25,243 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2022-11-02 20:46:25,243 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 184 203) no Hoare annotation was computed. [2022-11-02 20:46:25,243 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2022-11-02 20:46:25,243 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 184 203) the Hoare annotation is: true [2022-11-02 20:46:25,243 INFO L902 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: true [2022-11-02 20:46:25,243 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 184 203) no Hoare annotation was computed. [2022-11-02 20:46:25,244 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 255 282) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-02 20:46:25,244 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 255 282) no Hoare annotation was computed. [2022-11-02 20:46:25,244 INFO L899 garLoopResultBuilder]: For program point L274-1(lines 255 282) no Hoare annotation was computed. [2022-11-02 20:46:25,244 INFO L899 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2022-11-02 20:46:25,244 INFO L899 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2022-11-02 20:46:25,244 INFO L899 garLoopResultBuilder]: For program point L259-1(lines 258 281) no Hoare annotation was computed. [2022-11-02 20:46:25,245 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 158 165) no Hoare annotation was computed. [2022-11-02 20:46:25,245 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 158 165) the Hoare annotation is: true [2022-11-02 20:46:25,245 INFO L899 garLoopResultBuilder]: For program point L287-1(lines 286 309) no Hoare annotation was computed. [2022-11-02 20:46:25,245 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 283 310) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-02 20:46:25,245 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 283 310) no Hoare annotation was computed. [2022-11-02 20:46:25,246 INFO L899 garLoopResultBuilder]: For program point L302-1(lines 283 310) no Hoare annotation was computed. [2022-11-02 20:46:25,246 INFO L899 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2022-11-02 20:46:25,246 INFO L899 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2022-11-02 20:46:25,246 INFO L902 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: true [2022-11-02 20:46:25,246 INFO L895 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,247 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 (= ~token~0 ~local~0)) (and .cse4 .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse5) (and .cse4 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-11-02 20:46:25,247 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:46:25,247 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-11-02 20:46:25,247 INFO L902 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2022-11-02 20:46:25,247 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,247 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-11-02 20:46:25,248 INFO L895 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2022-11-02 20:46:25,248 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2022-11-02 20:46:25,248 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2022-11-02 20:46:25,248 INFO L895 garLoopResultBuilder]: At program point L451(line 451) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,248 INFO L899 garLoopResultBuilder]: For program point L451-1(line 451) no Hoare annotation was computed. [2022-11-02 20:46:25,248 INFO L899 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2022-11-02 20:46:25,249 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2022-11-02 20:46:25,249 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-11-02 20:46:25,249 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-11-02 20:46:25,249 INFO L895 garLoopResultBuilder]: At program point L353(lines 347 355) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,249 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-02 20:46:25,250 INFO L895 garLoopResultBuilder]: At program point L436(line 436) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,250 INFO L899 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2022-11-02 20:46:25,250 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2022-11-02 20:46:25,250 INFO L895 garLoopResultBuilder]: At program point L421(line 421) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-02 20:46:25,250 INFO L899 garLoopResultBuilder]: For program point L421-1(line 421) no Hoare annotation was computed. [2022-11-02 20:46:25,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:46:25,251 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2022-11-02 20:46:25,251 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-11-02 20:46:25,251 INFO L895 garLoopResultBuilder]: At program point L92(lines 87 118) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~m_pc~0) .cse4 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2022-11-02 20:46:25,251 INFO L895 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-11-02 20:46:25,251 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (<= 1 ~m_pc~0) .cse3 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0)))) [2022-11-02 20:46:25,252 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2022-11-02 20:46:25,252 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-11-02 20:46:25,252 INFO L895 garLoopResultBuilder]: At program point L423-1(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-11-02 20:46:25,252 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,252 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,253 INFO L895 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~token~0 ~local~0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 .cse5))) [2022-11-02 20:46:25,253 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2022-11-02 20:46:25,253 INFO L895 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2022-11-02 20:46:25,253 INFO L895 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-02 20:46:25,253 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse5 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ~m_pc~0 0)) (.cse6 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse3 .cse5 .cse6) (and .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 .cse4 .cse6))) [2022-11-02 20:46:25,254 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:46:25,254 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2022-11-02 20:46:25,254 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,254 INFO L895 garLoopResultBuilder]: At program point L375-1(lines 356 383) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,255 INFO L895 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,255 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,255 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,255 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-11-02 20:46:25,255 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2022-11-02 20:46:25,256 INFO L895 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,256 INFO L895 garLoopResultBuilder]: At program point L113(lines 84 119) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~m_st~0)) (.cse7 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse6 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse4 .cse6 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse7 .cse4 .cse6))) [2022-11-02 20:46:25,256 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-11-02 20:46:25,256 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2022-11-02 20:46:25,256 INFO L899 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2022-11-02 20:46:25,257 INFO L895 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (<= 1 ~m_pc~0) (<= 2 ~T1_E~0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2022-11-02 20:46:25,257 INFO L895 garLoopResultBuilder]: At program point L428-1(lines 425 465) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,257 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:46:25,257 INFO L899 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2022-11-02 20:46:25,257 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-11-02 20:46:25,258 INFO L899 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-11-02 20:46:25,258 INFO L895 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse2 (<= 2 ~m_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse7 (= ~m_st~0 0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 (< ~local~0 ~token~0)))) [2022-11-02 20:46:25,258 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-11-02 20:46:25,258 INFO L899 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2022-11-02 20:46:25,258 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-11-02 20:46:25,258 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2022-11-02 20:46:25,258 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2022-11-02 20:46:25,259 INFO L895 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2022-11-02 20:46:25,259 INFO L899 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2022-11-02 20:46:25,262 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:25,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:46:25,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:46:25 BoogieIcfgContainer [2022-11-02 20:46:25,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:46:25,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:46:25,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:46:25,324 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:46:25,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:42" (3/4) ... [2022-11-02 20:46:25,327 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:46:25,334 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-02 20:46:25,334 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-02 20:46:25,334 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-02 20:46:25,334 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-02 20:46:25,334 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-02 20:46:25,335 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-02 20:46:25,342 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-02 20:46:25,342 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:46:25,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:46:25,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:46:25,369 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) [2022-11-02 20:46:25,369 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) [2022-11-02 20:46:25,371 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) [2022-11-02 20:46:25,371 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) [2022-11-02 20:46:25,400 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:46:25,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:46:25,401 INFO L158 Benchmark]: Toolchain (without parser) took 43684.99ms. Allocated memory was 138.4MB in the beginning and 784.3MB in the end (delta: 645.9MB). Free memory was 103.9MB in the beginning and 512.4MB in the end (delta: -408.5MB). Peak memory consumption was 236.4MB. Max. memory is 16.1GB. [2022-11-02 20:46:25,401 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:46:25,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.32ms. Allocated memory is still 138.4MB. Free memory was 103.6MB in the beginning and 111.8MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:46:25,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.14ms. Allocated memory is still 138.4MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:46:25,402 INFO L158 Benchmark]: Boogie Preprocessor took 33.59ms. Allocated memory is still 138.4MB. Free memory was 109.7MB in the beginning and 108.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:46:25,402 INFO L158 Benchmark]: RCFGBuilder took 583.79ms. Allocated memory is still 138.4MB. Free memory was 108.3MB in the beginning and 91.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:46:25,403 INFO L158 Benchmark]: TraceAbstraction took 42571.09ms. Allocated memory was 138.4MB in the beginning and 784.3MB in the end (delta: 645.9MB). Free memory was 90.4MB in the beginning and 517.7MB in the end (delta: -427.3MB). Peak memory consumption was 450.1MB. Max. memory is 16.1GB. [2022-11-02 20:46:25,403 INFO L158 Benchmark]: Witness Printer took 76.91ms. Allocated memory is still 784.3MB. Free memory was 517.7MB in the beginning and 512.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:46:25,405 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.31ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.32ms. Allocated memory is still 138.4MB. Free memory was 103.6MB in the beginning and 111.8MB in the end (delta: -8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.14ms. Allocated memory is still 138.4MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.59ms. Allocated memory is still 138.4MB. Free memory was 109.7MB in the beginning and 108.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 583.79ms. Allocated memory is still 138.4MB. Free memory was 108.3MB in the beginning and 91.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 42571.09ms. Allocated memory was 138.4MB in the beginning and 784.3MB in the end (delta: 645.9MB). Free memory was 90.4MB in the beginning and 517.7MB in the end (delta: -427.3MB). Peak memory consumption was 450.1MB. Max. memory is 16.1GB. * Witness Printer took 76.91ms. Allocated memory is still 784.3MB. Free memory was 517.7MB in the beginning and 512.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 7 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.4s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3539 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3427 mSDsluCounter, 6603 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3794 mSDsCounter, 653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3424 IncrementalHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 653 mSolverCounterUnsat, 2809 mSDtfsCounter, 3424 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1451 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3350occurred in iteration=8, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 2416 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 5313 PreInvPairs, 6028 NumberOfFragments, 6978 HoareAnnotationTreeSize, 5313 FomulaSimplifications, 11194 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 43 FomulaSimplificationsInter, 158705 FormulaSimplificationTreeSizeReductionInter, 15.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2887 NumberOfCodeBlocks, 2887 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 4628 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3527 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1398/1568 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: 120]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && 2 <= m_st) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((2 <= E_1 && 2 <= E_M) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0))) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) || ((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || (((((2 <= E_1 && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:46:25,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15d26020-bbbd-4abc-a707-9dcbae4950ee/bin/uautomizer-Dbtcem3rbc/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