./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-exp-term-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-exp-term-subst.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-cb09d65-m [2024-01-27 23:07:55,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:07:55,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:07:55,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:07:55,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:07:55,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:07:55,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:07:55,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:07:55,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:07:55,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:07:55,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:07:55,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:07:55,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:07:55,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:07:55,519 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:07:55,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:07:55,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:07:55,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:07:55,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:07:55,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:07:55,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:07:55,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:07:55,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:07:55,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:07:55,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:07:55,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:07:55,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:07:55,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:07:55,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:07:55,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:07:55,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:07:55,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:07:55,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:55,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:07:55,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:07:55,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:07:55,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:07:55,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:07:55,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:07:55,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:07:55,526 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:07:55,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:07:55,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:07:55,526 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-27 23:07:55,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:07:55,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:07:55,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:07:55,827 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:07:55,827 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:07:55,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-exp-term-subst.wvr.yml/witness.yml [2024-01-27 23:07:55,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:07:55,969 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:07:55,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2024-01-27 23:07:57,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:07:57,204 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:07:57,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2024-01-27 23:07:57,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c7bc8f0/5eb0009dfb23435cb0f9cb7cd939da67/FLAG4ae00246a [2024-01-27 23:07:57,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c7bc8f0/5eb0009dfb23435cb0f9cb7cd939da67 [2024-01-27 23:07:57,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:07:57,228 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:07:57,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:57,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:07:57,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:07:57,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:55" (1/2) ... [2024-01-27 23:07:57,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791f2c89 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:57, skipping insertion in model container [2024-01-27 23:07:57,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:55" (1/2) ... [2024-01-27 23:07:57,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1184d03b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:57, skipping insertion in model container [2024-01-27 23:07:57,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:57" (2/2) ... [2024-01-27 23:07:57,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791f2c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57, skipping insertion in model container [2024-01-27 23:07:57,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:57" (2/2) ... [2024-01-27 23:07:57,238 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:07:57,265 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:07:57,266 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,266 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_8 == 0 [2024-01-27 23:07:57,267 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_7 == 0 [2024-01-27 23:07:57,267 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_6 == 0 [2024-01-27 23:07:57,267 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] sort_label_is_null_1 == (_Bool)0 [2024-01-27 23:07:57,268 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] sort_label_is_null_3 == (_Bool)0 [2024-01-27 23:07:57,268 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] b <= -1 [2024-01-27 23:07:57,268 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] b != 0 [2024-01-27 23:07:57,268 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-27 23:07:57,268 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,268 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_6 == 0 [2024-01-27 23:07:57,268 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] sort_label_is_null_1 == (_Bool)0 [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_8 == 0 [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] sort_label_4 == 0 [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_7 == 0 [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] sort_label_is_null_3 == (_Bool)0 [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1 [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] sort_label_is_null_5 == (_Bool)0 || sort_label_is_null_5 == (_Bool)1 [2024-01-27 23:07:57,269 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_7 == 0 [2024-01-27 23:07:57,270 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] sort_label_is_null_3 == (_Bool)0 || sort_label_is_null_3 == (_Bool)1 [2024-01-27 23:07:57,270 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_6 == 0 [2024-01-27 23:07:57,270 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_8 == 0 [2024-01-27 23:07:57,270 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_8 == 0 [2024-01-27 23:07:57,270 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] sort_label_is_null_3 == (_Bool)0 [2024-01-27 23:07:57,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_7 == 0 [2024-01-27 23:07:57,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] sort_label_4 == 0 [2024-01-27 23:07:57,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_6 == 0 [2024-01-27 23:07:57,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] sort_label_is_null_1 == (_Bool)0 [2024-01-27 23:07:57,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,271 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] sort_label_2 == 0 [2024-01-27 23:07:57,271 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_6 == 0 [2024-01-27 23:07:57,272 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] sort_label_4 == 0 [2024-01-27 23:07:57,272 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] sort_label_is_null_1 == (_Bool)0 [2024-01-27 23:07:57,272 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,272 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_8 == 0 [2024-01-27 23:07:57,272 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_7 == 0 [2024-01-27 23:07:57,272 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] sort_label_is_null_3 == (_Bool)0 [2024-01-27 23:07:57,273 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 23:07:57,273 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_7 == 0 [2024-01-27 23:07:57,274 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] sort_label_is_null_3 == (_Bool)0 || sort_label_is_null_3 == (_Bool)1 [2024-01-27 23:07:57,274 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1 [2024-01-27 23:07:57,274 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,274 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_6 == 0 [2024-01-27 23:07:57,274 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_8 == 0 [2024-01-27 23:07:57,274 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 23:07:57,275 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_8 == 0 [2024-01-27 23:07:57,275 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] sort_label_4 == 0 [2024-01-27 23:07:57,275 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] sort_label_is_null_3 == (_Bool)0 [2024-01-27 23:07:57,275 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] sort_label_is_null_1 == (_Bool)0 [2024-01-27 23:07:57,275 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] sort_label_0 == 0 [2024-01-27 23:07:57,275 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,276 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_6 == 0 [2024-01-27 23:07:57,276 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] sort_label_2 == 0 [2024-01-27 23:07:57,276 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_7 == 0 [2024-01-27 23:07:57,276 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] 1 <= b [2024-01-27 23:07:57,277 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] b != 0 [2024-01-27 23:07:57,277 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_6 == 0 [2024-01-27 23:07:57,277 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] val == (_Bool)0 || val == (_Bool)1 [2024-01-27 23:07:57,277 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] sort_label_is_null_3 == (_Bool)0 || sort_label_is_null_3 == (_Bool)1 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_8 == 0 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_7 == 0 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_7 == 0 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] sort_label_is_null_5 == (_Bool)0 [2024-01-27 23:07:57,278 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] sort_label_is_null_3 == (_Bool)0 [2024-01-27 23:07:57,279 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_6 == 0 [2024-01-27 23:07:57,279 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_8 == 0 [2024-01-27 23:07:57,279 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-27 23:07:57,279 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-27 23:07:57,299 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:07:57,468 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c[3111,3124] [2024-01-27 23:07:57,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:57,481 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:07:57,491 WARN L424 MainDispatcher]: Unable to annotate __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function) with a witness entry [2024-01-27 23:07:57,492 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:07:57,546 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c[3111,3124] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:07:57,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:57,561 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:07:57,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57 WrapperNode [2024-01-27 23:07:57,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:57,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:57,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:07:57,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:07:57,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,611 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 250 [2024-01-27 23:07:57,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:57,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:07:57,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:07:57,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:07:57,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,637 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 23:07:57,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:07:57,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:07:57,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:07:57,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:07:57,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (1/1) ... [2024-01-27 23:07:57,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:07:57,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 23:07:57,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 23:07:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:07:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:07:57,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:07:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:07:57,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:07:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 23:07:57,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 23:07:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:07:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:07:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:07:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:07:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:07:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:07:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:07:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:07:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:07:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:07:57,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:07:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:07:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:07:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:07:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:07:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:07:57,773 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:07:57,854 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:07:57,856 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:07:58,207 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:07:58,208 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:07:58,371 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:07:58,372 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:07:58,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:58 BoogieIcfgContainer [2024-01-27 23:07:58,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:07:58,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:07:58,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:07:58,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:07:58,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:55" (1/4) ... [2024-01-27 23:07:58,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd4f0d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:07:58, skipping insertion in model container [2024-01-27 23:07:58,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:07:57" (2/4) ... [2024-01-27 23:07:58,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd4f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:58, skipping insertion in model container [2024-01-27 23:07:58,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:57" (3/4) ... [2024-01-27 23:07:58,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd4f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:58, skipping insertion in model container [2024-01-27 23:07:58,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:58" (4/4) ... [2024-01-27 23:07:58,384 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2024-01-27 23:07:58,401 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:07:58,402 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-01-27 23:07:58,402 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:07:58,485 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 23:07:58,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 180 transitions, 381 flow [2024-01-27 23:07:58,588 INFO L124 PetriNetUnfolderBase]: 9/177 cut-off events. [2024-01-27 23:07:58,588 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 23:07:58,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 177 events. 9/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 316 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 149. Up to 2 conditions per place. [2024-01-27 23:07:58,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 180 transitions, 381 flow [2024-01-27 23:07:58,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 176 transitions, 370 flow [2024-01-27 23:07:58,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:07:58,617 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1d4ec3a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:07:58,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-01-27 23:07:58,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:07:58,622 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:07:58,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:58,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:58,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:07:58,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:07:58,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash 22251, now seen corresponding path program 1 times [2024-01-27 23:07:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856152088] [2024-01-27 23:07:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:58,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856152088] [2024-01-27 23:07:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856152088] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:58,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:58,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611304000] [2024-01-27 23:07:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:58,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:58,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:58,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 180 [2024-01-27 23:07:58,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 176 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2024-01-27 23:07:58,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:58,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 180 [2024-01-27 23:07:58,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:59,752 INFO L124 PetriNetUnfolderBase]: 3203/5417 cut-off events. [2024-01-27 23:07:59,753 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2024-01-27 23:07:59,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10073 conditions, 5417 events. 3203/5417 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 41957 event pairs, 1943 based on Foata normal form. 0/4378 useless extension candidates. Maximal degree in co-relation 9035. Up to 3310 conditions per place. [2024-01-27 23:07:59,791 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 68 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2024-01-27 23:07:59,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 190 transitions, 544 flow [2024-01-27 23:07:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2024-01-27 23:07:59,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.825925925925926 [2024-01-27 23:07:59,803 INFO L175 Difference]: Start difference. First operand has 177 places, 176 transitions, 370 flow. Second operand 3 states and 446 transitions. [2024-01-27 23:07:59,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 190 transitions, 544 flow [2024-01-27 23:07:59,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 190 transitions, 528 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 23:07:59,817 INFO L231 Difference]: Finished difference. Result has 166 places, 169 transitions, 348 flow [2024-01-27 23:07:59,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=166, PETRI_TRANSITIONS=169} [2024-01-27 23:07:59,820 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -11 predicate places. [2024-01-27 23:07:59,821 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 169 transitions, 348 flow [2024-01-27 23:07:59,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2024-01-27 23:07:59,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:59,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:07:59,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:07:59,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:07:59,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:59,822 INFO L85 PathProgramCache]: Analyzing trace with hash 690464, now seen corresponding path program 1 times [2024-01-27 23:07:59,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:59,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388574926] [2024-01-27 23:07:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:07:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388574926] [2024-01-27 23:07:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388574926] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334849895] [2024-01-27 23:07:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:59,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:59,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:59,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 180 [2024-01-27 23:07:59,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 169 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2024-01-27 23:07:59,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:59,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 180 [2024-01-27 23:07:59,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:00,383 INFO L124 PetriNetUnfolderBase]: 3203/5399 cut-off events. [2024-01-27 23:08:00,383 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-01-27 23:08:00,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10065 conditions, 5399 events. 3203/5399 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41479 event pairs, 2653 based on Foata normal form. 0/4327 useless extension candidates. Maximal degree in co-relation 7494. Up to 4426 conditions per place. [2024-01-27 23:08:00,422 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 44 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2024-01-27 23:08:00,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 167 transitions, 436 flow [2024-01-27 23:08:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2024-01-27 23:08:00,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-01-27 23:08:00,441 INFO L175 Difference]: Start difference. First operand has 166 places, 169 transitions, 348 flow. Second operand 3 states and 441 transitions. [2024-01-27 23:08:00,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 167 transitions, 436 flow [2024-01-27 23:08:00,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 167 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:00,444 INFO L231 Difference]: Finished difference. Result has 164 places, 167 transitions, 344 flow [2024-01-27 23:08:00,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=164, PETRI_TRANSITIONS=167} [2024-01-27 23:08:00,445 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -13 predicate places. [2024-01-27 23:08:00,445 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 167 transitions, 344 flow [2024-01-27 23:08:00,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2024-01-27 23:08:00,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:00,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:08:00,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:08:00,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:00,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:00,447 INFO L85 PathProgramCache]: Analyzing trace with hash 21405201, now seen corresponding path program 1 times [2024-01-27 23:08:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556907455] [2024-01-27 23:08:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556907455] [2024-01-27 23:08:00,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556907455] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:00,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:00,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081214656] [2024-01-27 23:08:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:00,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:00,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 180 [2024-01-27 23:08:00,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 167 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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) [2024-01-27 23:08:00,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:00,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 180 [2024-01-27 23:08:00,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:01,080 INFO L124 PetriNetUnfolderBase]: 3191/5386 cut-off events. [2024-01-27 23:08:01,080 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:01,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 5386 events. 3191/5386 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 41901 event pairs, 1775 based on Foata normal form. 0/4392 useless extension candidates. Maximal degree in co-relation 9858. Up to 3016 conditions per place. [2024-01-27 23:08:01,107 INFO L140 encePairwiseOnDemand]: 170/180 looper letters, 68 selfloop transitions, 3 changer transitions 0/181 dead transitions. [2024-01-27 23:08:01,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 181 transitions, 516 flow [2024-01-27 23:08:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2024-01-27 23:08:01,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2024-01-27 23:08:01,109 INFO L175 Difference]: Start difference. First operand has 164 places, 167 transitions, 344 flow. Second operand 3 states and 444 transitions. [2024-01-27 23:08:01,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 181 transitions, 516 flow [2024-01-27 23:08:01,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 181 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:01,112 INFO L231 Difference]: Finished difference. Result has 157 places, 160 transitions, 332 flow [2024-01-27 23:08:01,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=157, PETRI_TRANSITIONS=160} [2024-01-27 23:08:01,113 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -20 predicate places. [2024-01-27 23:08:01,113 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 160 transitions, 332 flow [2024-01-27 23:08:01,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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) [2024-01-27 23:08:01,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:01,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:08:01,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:08:01,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:01,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 663562062, now seen corresponding path program 1 times [2024-01-27 23:08:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223234665] [2024-01-27 23:08:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:01,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:01,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223234665] [2024-01-27 23:08:01,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223234665] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:01,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:01,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:01,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384264268] [2024-01-27 23:08:01,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:01,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:01,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:01,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:01,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:01,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 180 [2024-01-27 23:08:01,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 160 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2024-01-27 23:08:01,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:01,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 180 [2024-01-27 23:08:01,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:01,671 INFO L124 PetriNetUnfolderBase]: 3203/5386 cut-off events. [2024-01-27 23:08:01,671 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-01-27 23:08:01,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10038 conditions, 5386 events. 3203/5386 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41591 event pairs, 2653 based on Foata normal form. 5/4331 useless extension candidates. Maximal degree in co-relation 6878. Up to 4423 conditions per place. [2024-01-27 23:08:01,698 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 43 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2024-01-27 23:08:01,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 154 transitions, 410 flow [2024-01-27 23:08:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2024-01-27 23:08:01,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2024-01-27 23:08:01,700 INFO L175 Difference]: Start difference. First operand has 157 places, 160 transitions, 332 flow. Second operand 3 states and 435 transitions. [2024-01-27 23:08:01,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 154 transitions, 410 flow [2024-01-27 23:08:01,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 154 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:01,703 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 318 flow [2024-01-27 23:08:01,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2024-01-27 23:08:01,704 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -26 predicate places. [2024-01-27 23:08:01,704 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 318 flow [2024-01-27 23:08:01,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2024-01-27 23:08:01,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:01,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:08:01,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:08:01,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:01,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash -904411889, now seen corresponding path program 1 times [2024-01-27 23:08:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:01,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514615048] [2024-01-27 23:08:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:01,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:01,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514615048] [2024-01-27 23:08:01,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514615048] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:01,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:01,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163780523] [2024-01-27 23:08:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:01,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:01,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 180 [2024-01-27 23:08:01,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2024-01-27 23:08:01,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:01,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 180 [2024-01-27 23:08:01,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:02,272 INFO L124 PetriNetUnfolderBase]: 3203/5385 cut-off events. [2024-01-27 23:08:02,272 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-27 23:08:02,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9891 conditions, 5385 events. 3203/5385 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41517 event pairs, 2653 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 9814. Up to 4427 conditions per place. [2024-01-27 23:08:02,292 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 43 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2024-01-27 23:08:02,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 153 transitions, 406 flow [2024-01-27 23:08:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2024-01-27 23:08:02,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2024-01-27 23:08:02,294 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 318 flow. Second operand 3 states and 445 transitions. [2024-01-27 23:08:02,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 153 transitions, 406 flow [2024-01-27 23:08:02,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 153 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:02,296 INFO L231 Difference]: Finished difference. Result has 150 places, 153 transitions, 316 flow [2024-01-27 23:08:02,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=150, PETRI_TRANSITIONS=153} [2024-01-27 23:08:02,297 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -27 predicate places. [2024-01-27 23:08:02,297 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 153 transitions, 316 flow [2024-01-27 23:08:02,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2024-01-27 23:08:02,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:02,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:02,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:08:02,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:02,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2028003309, now seen corresponding path program 1 times [2024-01-27 23:08:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952041429] [2024-01-27 23:08:02,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:02,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952041429] [2024-01-27 23:08:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952041429] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:02,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:02,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:02,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96313294] [2024-01-27 23:08:02,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:02,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:02,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 180 [2024-01-27 23:08:02,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 153 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2024-01-27 23:08:02,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:02,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 180 [2024-01-27 23:08:02,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:02,720 INFO L124 PetriNetUnfolderBase]: 3203/5381 cut-off events. [2024-01-27 23:08:02,721 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-27 23:08:02,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9889 conditions, 5381 events. 3203/5381 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41588 event pairs, 2653 based on Foata normal form. 4/4330 useless extension candidates. Maximal degree in co-relation 9869. Up to 4427 conditions per place. [2024-01-27 23:08:02,833 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 45 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2024-01-27 23:08:02,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 149 transitions, 402 flow [2024-01-27 23:08:02,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2024-01-27 23:08:02,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2024-01-27 23:08:02,835 INFO L175 Difference]: Start difference. First operand has 150 places, 153 transitions, 316 flow. Second operand 3 states and 435 transitions. [2024-01-27 23:08:02,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 149 transitions, 402 flow [2024-01-27 23:08:02,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 149 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:02,837 INFO L231 Difference]: Finished difference. Result has 146 places, 149 transitions, 308 flow [2024-01-27 23:08:02,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=146, PETRI_TRANSITIONS=149} [2024-01-27 23:08:02,838 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -31 predicate places. [2024-01-27 23:08:02,839 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 149 transitions, 308 flow [2024-01-27 23:08:02,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2024-01-27 23:08:02,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:02,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:02,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:08:02,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:02,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1556406155, now seen corresponding path program 1 times [2024-01-27 23:08:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:02,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305101217] [2024-01-27 23:08:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:02,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:02,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305101217] [2024-01-27 23:08:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305101217] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204864071] [2024-01-27 23:08:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:02,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:02,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:02,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 180 [2024-01-27 23:08:02,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 149 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2024-01-27 23:08:02,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:02,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 180 [2024-01-27 23:08:02,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:03,230 INFO L124 PetriNetUnfolderBase]: 3203/5376 cut-off events. [2024-01-27 23:08:03,230 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-27 23:08:03,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9883 conditions, 5376 events. 3203/5376 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41458 event pairs, 2653 based on Foata normal form. 5/4332 useless extension candidates. Maximal degree in co-relation 9835. Up to 4425 conditions per place. [2024-01-27 23:08:03,261 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 44 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2024-01-27 23:08:03,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 144 transitions, 390 flow [2024-01-27 23:08:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2024-01-27 23:08:03,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2024-01-27 23:08:03,263 INFO L175 Difference]: Start difference. First operand has 146 places, 149 transitions, 308 flow. Second operand 3 states and 435 transitions. [2024-01-27 23:08:03,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 144 transitions, 390 flow [2024-01-27 23:08:03,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 144 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:03,265 INFO L231 Difference]: Finished difference. Result has 141 places, 144 transitions, 298 flow [2024-01-27 23:08:03,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=141, PETRI_TRANSITIONS=144} [2024-01-27 23:08:03,266 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -36 predicate places. [2024-01-27 23:08:03,266 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 144 transitions, 298 flow [2024-01-27 23:08:03,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2024-01-27 23:08:03,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:03,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:03,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:08:03,267 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:03,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1003949813, now seen corresponding path program 1 times [2024-01-27 23:08:03,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:03,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789210400] [2024-01-27 23:08:03,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:03,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789210400] [2024-01-27 23:08:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789210400] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070229120] [2024-01-27 23:08:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:03,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:03,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:03,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:03,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 180 [2024-01-27 23:08:03,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 144 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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) [2024-01-27 23:08:03,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:03,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 180 [2024-01-27 23:08:03,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:03,740 INFO L124 PetriNetUnfolderBase]: 3203/5373 cut-off events. [2024-01-27 23:08:03,741 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-27 23:08:03,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9881 conditions, 5373 events. 3203/5373 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41401 event pairs, 2653 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 9824. Up to 4425 conditions per place. [2024-01-27 23:08:03,762 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 45 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2024-01-27 23:08:03,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 386 flow [2024-01-27 23:08:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2024-01-27 23:08:03,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8092592592592592 [2024-01-27 23:08:03,764 INFO L175 Difference]: Start difference. First operand has 141 places, 144 transitions, 298 flow. Second operand 3 states and 437 transitions. [2024-01-27 23:08:03,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 386 flow [2024-01-27 23:08:03,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 141 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:03,766 INFO L231 Difference]: Finished difference. Result has 138 places, 141 transitions, 292 flow [2024-01-27 23:08:03,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=138, PETRI_TRANSITIONS=141} [2024-01-27 23:08:03,767 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -39 predicate places. [2024-01-27 23:08:03,767 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 141 transitions, 292 flow [2024-01-27 23:08:03,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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) [2024-01-27 23:08:03,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:03,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:03,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:08:03,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:03,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1057672312, now seen corresponding path program 1 times [2024-01-27 23:08:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:03,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697701746] [2024-01-27 23:08:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:03,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697701746] [2024-01-27 23:08:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697701746] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:03,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731377604] [2024-01-27 23:08:03,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:03,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:03,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:03,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:03,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 180 [2024-01-27 23:08:03,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 141 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2024-01-27 23:08:03,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:03,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 180 [2024-01-27 23:08:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:04,115 INFO L124 PetriNetUnfolderBase]: 3203/5384 cut-off events. [2024-01-27 23:08:04,115 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-01-27 23:08:04,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9894 conditions, 5384 events. 3203/5384 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 41859 event pairs, 2013 based on Foata normal form. 0/4341 useless extension candidates. Maximal degree in co-relation 9859. Up to 3430 conditions per place. [2024-01-27 23:08:04,145 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 68 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-01-27 23:08:04,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 155 transitions, 462 flow [2024-01-27 23:08:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2024-01-27 23:08:04,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.825925925925926 [2024-01-27 23:08:04,147 INFO L175 Difference]: Start difference. First operand has 138 places, 141 transitions, 292 flow. Second operand 3 states and 446 transitions. [2024-01-27 23:08:04,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 155 transitions, 462 flow [2024-01-27 23:08:04,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 155 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:04,149 INFO L231 Difference]: Finished difference. Result has 131 places, 134 transitions, 278 flow [2024-01-27 23:08:04,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=131, PETRI_TRANSITIONS=134} [2024-01-27 23:08:04,150 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -46 predicate places. [2024-01-27 23:08:04,150 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 134 transitions, 278 flow [2024-01-27 23:08:04,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2024-01-27 23:08:04,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:04,150 INFO L208 CegarLoopForPetriNet]: 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] [2024-01-27 23:08:04,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:08:04,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-27 23:08:04,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2136365010, now seen corresponding path program 1 times [2024-01-27 23:08:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758655937] [2024-01-27 23:08:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:04,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:04,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:08:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:04,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:08:04,184 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:08:04,185 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 88 remaining) [2024-01-27 23:08:04,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 88 remaining) [2024-01-27 23:08:04,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 88 remaining) [2024-01-27 23:08:04,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 88 remaining) [2024-01-27 23:08:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 88 remaining) [2024-01-27 23:08:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 88 remaining) [2024-01-27 23:08:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 88 remaining) [2024-01-27 23:08:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 88 remaining) [2024-01-27 23:08:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 88 remaining) [2024-01-27 23:08:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 88 remaining) [2024-01-27 23:08:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 88 remaining) [2024-01-27 23:08:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 88 remaining) [2024-01-27 23:08:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 88 remaining) [2024-01-27 23:08:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 88 remaining) [2024-01-27 23:08:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 88 remaining) [2024-01-27 23:08:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (21 of 88 remaining) [2024-01-27 23:08:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 88 remaining) [2024-01-27 23:08:04,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 88 remaining) [2024-01-27 23:08:04,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 88 remaining) [2024-01-27 23:08:04,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 88 remaining) [2024-01-27 23:08:04,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 88 remaining) [2024-01-27 23:08:04,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 88 remaining) [2024-01-27 23:08:04,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:08:04,197 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:04,203 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:08:04,203 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:08:04,234 INFO L503 ceAbstractionStarter]: Automizer considered 66 witness invariants [2024-01-27 23:08:04,234 INFO L504 ceAbstractionStarter]: WitnessConsidered=66 [2024-01-27 23:08:04,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:08:04 BasicIcfg [2024-01-27 23:08:04,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:08:04,235 INFO L158 Benchmark]: Toolchain (without parser) took 7007.75ms. Allocated memory was 274.7MB in the beginning and 960.5MB in the end (delta: 685.8MB). Free memory was 197.4MB in the beginning and 345.0MB in the end (delta: -147.6MB). Peak memory consumption was 538.5MB. Max. memory is 16.1GB. [2024-01-27 23:08:04,236 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:04,236 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 274.7MB. Free memory is still 245.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:04,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.03ms. Allocated memory is still 274.7MB. Free memory was 197.0MB in the beginning and 177.7MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 23:08:04,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.83ms. Allocated memory is still 274.7MB. Free memory was 177.7MB in the beginning and 175.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:04,236 INFO L158 Benchmark]: Boogie Preprocessor took 43.13ms. Allocated memory is still 274.7MB. Free memory was 175.2MB in the beginning and 172.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:04,237 INFO L158 Benchmark]: RCFGBuilder took 705.49ms. Allocated memory is still 274.7MB. Free memory was 172.2MB in the beginning and 200.1MB in the end (delta: -27.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-01-27 23:08:04,237 INFO L158 Benchmark]: TraceAbstraction took 5857.69ms. Allocated memory was 274.7MB in the beginning and 960.5MB in the end (delta: 685.8MB). Free memory was 200.1MB in the beginning and 345.0MB in the end (delta: -144.9MB). Peak memory consumption was 539.8MB. Max. memory is 16.1GB. [2024-01-27 23:08:04,238 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.09ms. Allocated memory is still 274.7MB. Free memory is still 245.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.03ms. Allocated memory is still 274.7MB. Free memory was 197.0MB in the beginning and 177.7MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.83ms. Allocated memory is still 274.7MB. Free memory was 177.7MB in the beginning and 175.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.13ms. Allocated memory is still 274.7MB. Free memory was 175.2MB in the beginning and 172.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 705.49ms. Allocated memory is still 274.7MB. Free memory was 172.2MB in the beginning and 200.1MB in the end (delta: -27.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5857.69ms. Allocated memory was 274.7MB in the beginning and 960.5MB in the end (delta: 685.8MB). Free memory was 200.1MB in the beginning and 345.0MB in the end (delta: -144.9MB). Peak memory consumption was 539.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 68]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] int sort_label_0, sort_label_2, sort_label_4, result_6, result_7, result_8; [L39] _Bool sort_label_is_null_1, sort_label_is_null_3, sort_label_is_null_5; [L62] pthread_t t1, t2, t3; VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] [L64] sort_label_0 = __VERIFIER_nondet_int() [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] [L65] sort_label_2 = __VERIFIER_nondet_int() [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] [L66] sort_label_4 = __VERIFIER_nondet_int() [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L67] sort_label_is_null_1 = __VERIFIER_nondet_bool() [L68] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=2, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 235 locations, 88 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 843 IncrementalHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 18 mSDtfsCounter, 843 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2024-01-27 23:08:04,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE