./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i --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/36-apron_17-traces-rpb-litmus_unknown_1_neg.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/36-apron_17-traces-rpb-litmus_unknown_1_neg.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-8857f20-m [2024-01-29 23:21:56,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:21:56,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:21:56,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:21:56,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:21:56,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:21:56,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:21:56,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:21:56,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:21:56,395 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:21:56,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:21:56,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:21:56,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:21:56,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:21:56,398 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:21:56,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:21:56,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:21:56,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:21:56,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:21:56,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:21:56,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:21:56,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:21:56,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:21:56,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:21:56,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:21:56,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:21:56,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:21:56,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:21:56,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:21:56,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:21:56,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:21:56,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:21:56,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:56,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:21:56,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:21:56,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:21:56,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:21:56,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:21:56,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:21:56,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:21:56,404 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:21:56,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:21:56,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:21:56,404 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-29 23:21:56,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:21:56,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:21:56,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:21:56,658 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:21:56,658 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:21:56,660 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/36-apron_17-traces-rpb-litmus_unknown_1_neg.yml/witness.yml [2024-01-29 23:21:56,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:21:56,782 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:21:56,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-29 23:21:57,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:21:58,038 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:21:58,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-29 23:21:58,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f37566a/9a7717ad17694545bdfd56689a7cebad/FLAG0e602937f [2024-01-29 23:21:58,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f37566a/9a7717ad17694545bdfd56689a7cebad [2024-01-29 23:21:58,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:21:58,064 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:21:58,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:58,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:21:58,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:21:58,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:56" (1/2) ... [2024-01-29 23:21:58,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c616a68 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:58, skipping insertion in model container [2024-01-29 23:21:58,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:56" (1/2) ... [2024-01-29 23:21:58,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a1b19c6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:58, skipping insertion in model container [2024-01-29 23:21:58,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:58" (2/2) ... [2024-01-29 23:21:58,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c616a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58, skipping insertion in model container [2024-01-29 23:21:58,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:58" (2/2) ... [2024-01-29 23:21:58,072 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:21:58,158 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:21:58,159 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= g) && (g <= 42) [2024-01-29 23:21:58,160 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((0 <= g) && (g <= 42)) && (g != 0) [2024-01-29 23:21:58,160 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((0 <= g) && (g <= 42)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:58,160 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] 0 <= g [2024-01-29 23:21:58,160 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((0 <= g) && (g <= 42)) && (g <= 127) [2024-01-29 23:21:58,160 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((0 <= g) && (g <= 42)) && (g == 17 || g == 42) [2024-01-29 23:21:58,160 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((0 <= g) && (g <= 42)) && (g % 25 == 17) [2024-01-29 23:21:58,160 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,161 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (unsigned long )arg == 0UL [2024-01-29 23:21:58,161 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] ((0 <= t) && (t != 0)) && (t == 17 || t == 42) [2024-01-29 23:21:58,161 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (0 <= t) && (t != 0) [2024-01-29 23:21:58,161 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] 0 <= t [2024-01-29 23:21:58,161 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (0 <= t) && (t % 25 == 17) [2024-01-29 23:21:58,161 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (0 <= t) && (t <= 42) [2024-01-29 23:21:58,161 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (0 <= t) && (t <= 127) [2024-01-29 23:21:58,162 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (0 <= t) && (17 <= t) [2024-01-29 23:21:58,162 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (g == 42) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:58,162 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] g == 42 [2024-01-29 23:21:58,162 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] ((0 <= g) && (g <= 42)) && (g <= 127) [2024-01-29 23:21:58,162 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] (0 <= g) && (g <= 42) [2024-01-29 23:21:58,162 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] (((0 <= g) && (g <= 42)) && (g <= 127)) && (g == 17 || g == 42) [2024-01-29 23:21:58,163 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] (((0 <= g) && (g <= 42)) && (g <= 127)) && (g != 0) [2024-01-29 23:21:58,163 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] 0 <= g [2024-01-29 23:21:58,163 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] (((0 <= g) && (g <= 42)) && (g <= 127)) && (g % 25 == 17) [2024-01-29 23:21:58,163 INFO L98 nessWitnessExtractor]: Location invariant before [L705-L705] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,163 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] g == 42 [2024-01-29 23:21:58,163 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 127) [2024-01-29 23:21:58,163 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 127)) && (t == 17 || t == 42) [2024-01-29 23:21:58,164 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 127)) && (t % 25 == 17) [2024-01-29 23:21:58,164 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42) [2024-01-29 23:21:58,164 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] 0 <= g [2024-01-29 23:21:58,164 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 127)) && (g != 0) [2024-01-29 23:21:58,164 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 42) [2024-01-29 23:21:58,164 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t) [2024-01-29 23:21:58,164 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((0 <= g) && (0 <= t)) && (17 <= g) [2024-01-29 23:21:58,165 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 127)) && (g % 25 == 17) [2024-01-29 23:21:58,165 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 127)) && (t != 0) [2024-01-29 23:21:58,165 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (g <= 127) [2024-01-29 23:21:58,166 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] (0 <= g) && (0 <= t) [2024-01-29 23:21:58,167 INFO L98 nessWitnessExtractor]: Location invariant before [L708-L708] ((((((0 <= g) && (0 <= t)) && (17 <= g)) && (17 <= t)) && (g <= 42)) && (t <= 127)) && (g == 17 || g == 42) [2024-01-29 23:21:58,167 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-29 23:21:58,167 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] ((0 <= g) && (17 <= t)) && (t % 25 == 17) [2024-01-29 23:21:58,167 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (0 <= g) && (17 <= t) [2024-01-29 23:21:58,167 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] ((0 <= g) && (17 <= t)) && (g % 25 == 17) [2024-01-29 23:21:58,167 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (((0 <= g) && (17 <= t)) && (t % 25 == 17)) && (t != 0) [2024-01-29 23:21:58,168 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] ((0 <= g) && (17 <= t)) && (t <= 42) [2024-01-29 23:21:58,168 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (((0 <= g) && (17 <= t)) && (t % 25 == 17)) && (t == 17 || t == 42) [2024-01-29 23:21:58,168 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] 0 <= g [2024-01-29 23:21:58,168 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (((0 <= g) && (17 <= t)) && (t % 25 == 17)) && (g != 0) [2024-01-29 23:21:58,168 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (0 <= g) && (0 <= t) [2024-01-29 23:21:58,168 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] ((0 <= g) && (17 <= t)) && (g <= 42) [2024-01-29 23:21:58,169 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (((0 <= g) && (17 <= t)) && (t % 25 == 17)) && (g == 17 || g == 42) [2024-01-29 23:21:58,169 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] ((0 <= g) && (17 <= t)) && (t <= 127) [2024-01-29 23:21:58,169 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] ((0 <= g) && (17 <= t)) && (g <= 127) [2024-01-29 23:21:58,169 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L707] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,170 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] 0 <= g [2024-01-29 23:21:58,170 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] (0 <= g) && (g <= 42) [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] (0 <= g) && (g % 25 == 17) [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] (0 <= g) && (g <= 127) [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] (0 <= g) && (g != 0) [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L704] (0 <= g) && (g == 17 || g == 42) [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] g == 17 [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] (g == 17) && (r != 0) [2024-01-29 23:21:58,171 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (g == 17 || g == 42) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (0 <= g) && (0 <= t) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (g != 0) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] (((0 <= g) && (0 <= t)) && (g == 17 || g == 42)) && (t == 17 || t == 42) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (17 <= g) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (g % 25 == 17) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (17 <= t) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (t <= 42) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (t <= 127) [2024-01-29 23:21:58,172 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] 0 <= g [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (g <= 127) [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (g <= 42) [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (t % 25 == 17) [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L706-L706] ((0 <= g) && (0 <= t)) && (t != 0) [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((0 <= g) && (g <= 42)) && (g != 0) [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (0 <= g) && (g <= 42) [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((0 <= g) && (g <= 42)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:58,173 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (((0 <= g) && (g <= 42)) && (g != 0)) && (g == 17 || g == 42) [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] 0 <= g [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((0 <= g) && (g <= 42)) && (g % 25 == 17) [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((0 <= g) && (g <= 42)) && (g <= 127) [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] g == 42 [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (g == 42) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (0 <= g) && (g <= 42) [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= g) && (g <= 42)) && (g % 25 == 17) [2024-01-29 23:21:58,174 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= g) && (g <= 42)) && (g == 17 || g == 42) [2024-01-29 23:21:58,175 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] 0 <= g [2024-01-29 23:21:58,175 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= g) && (g <= 42)) && (g <= 127) [2024-01-29 23:21:58,175 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= g) && (g <= 42)) && (g != 0) [2024-01-29 23:21:58,175 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,175 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0) [2024-01-29 23:21:58,175 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127) [2024-01-29 23:21:58,176 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (g == 17 || g == 42) [2024-01-29 23:21:58,176 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (g == 17 || g == 42) [2024-01-29 23:21:58,176 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g) [2024-01-29 23:21:58,176 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (17 <= g) [2024-01-29 23:21:58,176 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17) [2024-01-29 23:21:58,176 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (0 <= g) [2024-01-29 23:21:58,176 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (g % 25 == 17) [2024-01-29 23:21:58,177 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g <= 42) [2024-01-29 23:21:58,177 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (g <= 42) [2024-01-29 23:21:58,177 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g <= 127) [2024-01-29 23:21:58,178 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (0 <= g) [2024-01-29 23:21:58,178 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= g) && (17 <= g)) && (g <= 42) [2024-01-29 23:21:58,179 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (g <= 127) [2024-01-29 23:21:58,179 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g != 0)) && (g != 0) [2024-01-29 23:21:58,179 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g == 17 || g == 42) [2024-01-29 23:21:58,179 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (g != 0) [2024-01-29 23:21:58,179 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((((((0 <= g) && (17 <= g)) && (g <= 42)) && (g <= 127)) && (g % 25 == 17)) && (17 <= g)) && (g % 25 == 17) [2024-01-29 23:21:58,180 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,180 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-29 23:21:58,180 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] ((0 <= g) && (17 <= g)) && (g <= 127) [2024-01-29 23:21:58,180 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (((0 <= g) && (17 <= g)) && (g <= 127)) && (g != 0) [2024-01-29 23:21:58,180 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (0 <= g) && (17 <= g) [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (((0 <= g) && (17 <= g)) && (g <= 127)) && (r != 0) [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] 0 <= g [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] ((0 <= g) && (17 <= g)) && (g <= 42) [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (((0 <= g) && (17 <= g)) && (g <= 127)) && (g % 25 == 17) [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L701-L701] (((0 <= g) && (17 <= g)) && (g <= 127)) && (g == 17 || g == 42) [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g == 42 [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L22] g == 42 [2024-01-29 23:21:58,181 INFO L98 nessWitnessExtractor]: Location invariant before [L703-L703] g == 17 [2024-01-29 23:21:58,182 INFO L98 nessWitnessExtractor]: Location invariant before [L703-L703] (g == 17) && (r != 0) [2024-01-29 23:21:58,219 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:21:58,378 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2024-01-29 23:21:58,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:58,548 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:21:58,558 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2024-01-29 23:21:58,558 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry [2024-01-29 23:21:58,559 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned short int __u_short; 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 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-29 23:21:58,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:58,696 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:21:58,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58 WrapperNode [2024-01-29 23:21:58,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:58,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:58,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:21:58,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:21:58,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,763 INFO L138 Inliner]: procedures = 164, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 152 [2024-01-29 23:21:58,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:58,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:21:58,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:21:58,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:21:58,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,805 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 5, 5, 1]. 38 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-01-29 23:21:58,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:21:58,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:21:58,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:21:58,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:21:58,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (1/1) ... [2024-01-29 23:21:58,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:21:58,858 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-29 23:21:58,860 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-29 23:21:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:21:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:21:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:21:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 23:21:58,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:21:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:21:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:21:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-29 23:21:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-29 23:21:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:21:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:21:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:21:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:21:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 23:21:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:21:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:21:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:21:58,925 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 23:21:59,016 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:21:59,018 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:21:59,455 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:21:59,456 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:21:59,560 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:21:59,560 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:21:59,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:59 BoogieIcfgContainer [2024-01-29 23:21:59,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:21:59,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:21:59,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:21:59,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:21:59,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:56" (1/4) ... [2024-01-29 23:21:59,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6fdf41 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:59, skipping insertion in model container [2024-01-29 23:21:59,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:21:58" (2/4) ... [2024-01-29 23:21:59,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6fdf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:59, skipping insertion in model container [2024-01-29 23:21:59,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:58" (3/4) ... [2024-01-29 23:21:59,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6fdf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:59, skipping insertion in model container [2024-01-29 23:21:59,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:59" (4/4) ... [2024-01-29 23:21:59,570 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2024-01-29 23:21:59,589 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:21:59,590 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 107 error locations. [2024-01-29 23:21:59,590 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:21:59,662 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-29 23:21:59,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 244 transitions, 492 flow [2024-01-29 23:21:59,785 INFO L124 PetriNetUnfolderBase]: 2/243 cut-off events. [2024-01-29 23:21:59,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:59,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 243 events. 2/243 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 461 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 237. Up to 2 conditions per place. [2024-01-29 23:21:59,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 244 transitions, 492 flow [2024-01-29 23:21:59,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 243 transitions, 489 flow [2024-01-29 23:21:59,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:21:59,822 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;@55e4583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:21:59,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2024-01-29 23:21:59,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:21:59,824 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:21:59,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:59,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:59,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:21:59,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:21:59,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash 18327, now seen corresponding path program 1 times [2024-01-29 23:21:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090286038] [2024-01-29 23:21:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:00,008 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-29 23:22:00,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:00,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090286038] [2024-01-29 23:22:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090286038] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:00,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:00,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:22:00,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094548255] [2024-01-29 23:22:00,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:00,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:22:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:22:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:22:00,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 244 [2024-01-29 23:22:00,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 243 transitions, 489 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-29 23:22:00,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:00,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 244 [2024-01-29 23:22:00,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:00,823 INFO L124 PetriNetUnfolderBase]: 704/4214 cut-off events. [2024-01-29 23:22:00,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:22:00,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5828 conditions, 4214 events. 704/4214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39101 event pairs, 458 based on Foata normal form. 409/3402 useless extension candidates. Maximal degree in co-relation 5815. Up to 1137 conditions per place. [2024-01-29 23:22:00,845 INFO L140 encePairwiseOnDemand]: 182/244 looper letters, 68 selfloop transitions, 7 changer transitions 0/237 dead transitions. [2024-01-29 23:22:00,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 237 transitions, 627 flow [2024-01-29 23:22:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:22:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:22:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-01-29 23:22:00,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8469945355191257 [2024-01-29 23:22:00,859 INFO L175 Difference]: Start difference. First operand has 245 places, 243 transitions, 489 flow. Second operand 3 states and 620 transitions. [2024-01-29 23:22:00,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 237 transitions, 627 flow [2024-01-29 23:22:00,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 237 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:00,866 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 550 flow [2024-01-29 23:22:00,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2024-01-29 23:22:00,871 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -20 predicate places. [2024-01-29 23:22:00,871 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 550 flow [2024-01-29 23:22:00,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-29 23:22:00,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:00,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 23:22:00,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:22:00,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:00,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash -238179078, now seen corresponding path program 1 times [2024-01-29 23:22:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:00,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14793020] [2024-01-29 23:22:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:00,996 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-29 23:22:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14793020] [2024-01-29 23:22:00,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14793020] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:00,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:00,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:00,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629148811] [2024-01-29 23:22:00,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:00,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:00,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:00,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:01,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 244 [2024-01-29 23:22:01,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 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-29 23:22:01,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:01,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 244 [2024-01-29 23:22:01,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:01,426 INFO L124 PetriNetUnfolderBase]: 565/4564 cut-off events. [2024-01-29 23:22:01,426 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-01-29 23:22:01,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6142 conditions, 4564 events. 565/4564 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 44259 event pairs, 447 based on Foata normal form. 19/3232 useless extension candidates. Maximal degree in co-relation 6126. Up to 741 conditions per place. [2024-01-29 23:22:01,442 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 34 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-01-29 23:22:01,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 234 transitions, 646 flow [2024-01-29 23:22:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 909 transitions. [2024-01-29 23:22:01,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9313524590163934 [2024-01-29 23:22:01,445 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 550 flow. Second operand 4 states and 909 transitions. [2024-01-29 23:22:01,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 234 transitions, 646 flow [2024-01-29 23:22:01,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 234 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:22:01,459 INFO L231 Difference]: Finished difference. Result has 224 places, 222 transitions, 536 flow [2024-01-29 23:22:01,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=536, PETRI_PLACES=224, PETRI_TRANSITIONS=222} [2024-01-29 23:22:01,460 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -21 predicate places. [2024-01-29 23:22:01,460 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 222 transitions, 536 flow [2024-01-29 23:22:01,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 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-29 23:22:01,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:01,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:01,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:22:01,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:01,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1235684449, now seen corresponding path program 1 times [2024-01-29 23:22:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:01,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835303034] [2024-01-29 23:22:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:01,543 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-29 23:22:01,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:01,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835303034] [2024-01-29 23:22:01,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835303034] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:01,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:01,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:22:01,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316479777] [2024-01-29 23:22:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:01,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:01,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:01,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:01,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 244 [2024-01-29 23:22:01,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 222 transitions, 536 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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-29 23:22:01,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:01,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 244 [2024-01-29 23:22:01,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:02,547 INFO L124 PetriNetUnfolderBase]: 962/5329 cut-off events. [2024-01-29 23:22:02,547 INFO L125 PetriNetUnfolderBase]: For 595/1002 co-relation queries the response was YES. [2024-01-29 23:22:02,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8732 conditions, 5329 events. 962/5329 cut-off events. For 595/1002 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 51475 event pairs, 481 based on Foata normal form. 70/3887 useless extension candidates. Maximal degree in co-relation 8716. Up to 1517 conditions per place. [2024-01-29 23:22:02,572 INFO L140 encePairwiseOnDemand]: 231/244 looper letters, 92 selfloop transitions, 11 changer transitions 1/256 dead transitions. [2024-01-29 23:22:02,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 256 transitions, 820 flow [2024-01-29 23:22:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 720 transitions. [2024-01-29 23:22:02,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377049180327869 [2024-01-29 23:22:02,574 INFO L175 Difference]: Start difference. First operand has 224 places, 222 transitions, 536 flow. Second operand 4 states and 720 transitions. [2024-01-29 23:22:02,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 256 transitions, 820 flow [2024-01-29 23:22:02,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 256 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:22:02,578 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 595 flow [2024-01-29 23:22:02,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=595, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2024-01-29 23:22:02,579 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -18 predicate places. [2024-01-29 23:22:02,580 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 595 flow [2024-01-29 23:22:02,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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-29 23:22:02,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:02,580 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] [2024-01-29 23:22:02,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:22:02,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:02,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -427206137, now seen corresponding path program 1 times [2024-01-29 23:22:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:02,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177182369] [2024-01-29 23:22:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:02,677 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-29 23:22:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177182369] [2024-01-29 23:22:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177182369] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:22:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144985281] [2024-01-29 23:22:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:02,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:03,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 244 [2024-01-29 23:22:03,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 595 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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-29 23:22:03,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:03,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 244 [2024-01-29 23:22:03,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:03,399 INFO L124 PetriNetUnfolderBase]: 761/4775 cut-off events. [2024-01-29 23:22:03,399 INFO L125 PetriNetUnfolderBase]: For 1143/1490 co-relation queries the response was YES. [2024-01-29 23:22:03,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7986 conditions, 4775 events. 761/4775 cut-off events. For 1143/1490 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 46042 event pairs, 474 based on Foata normal form. 23/3490 useless extension candidates. Maximal degree in co-relation 7968. Up to 1161 conditions per place. [2024-01-29 23:22:03,417 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 82 selfloop transitions, 9 changer transitions 0/248 dead transitions. [2024-01-29 23:22:03,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 248 transitions, 837 flow [2024-01-29 23:22:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions. [2024-01-29 23:22:03,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742827868852459 [2024-01-29 23:22:03,419 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 595 flow. Second operand 4 states and 725 transitions. [2024-01-29 23:22:03,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 248 transitions, 837 flow [2024-01-29 23:22:03,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 248 transitions, 829 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:03,426 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 603 flow [2024-01-29 23:22:03,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=603, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2024-01-29 23:22:03,427 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -17 predicate places. [2024-01-29 23:22:03,428 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 603 flow [2024-01-29 23:22:03,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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-29 23:22:03,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:03,428 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] [2024-01-29 23:22:03,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:22:03,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:03,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1775277238, now seen corresponding path program 1 times [2024-01-29 23:22:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:03,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196095145] [2024-01-29 23:22:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:03,492 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-29 23:22:03,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196095145] [2024-01-29 23:22:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196095145] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:03,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:22:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97798210] [2024-01-29 23:22:03,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:03,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:03,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:03,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:03,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 244 [2024-01-29 23:22:03,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 185.25) internal successors, (741), 4 states have internal predecessors, (741), 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-29 23:22:03,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:03,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 244 [2024-01-29 23:22:03,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:04,391 INFO L124 PetriNetUnfolderBase]: 954/5686 cut-off events. [2024-01-29 23:22:04,391 INFO L125 PetriNetUnfolderBase]: For 1748/2288 co-relation queries the response was YES. [2024-01-29 23:22:04,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9560 conditions, 5686 events. 954/5686 cut-off events. For 1748/2288 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 56827 event pairs, 365 based on Foata normal form. 212/4638 useless extension candidates. Maximal degree in co-relation 9541. Up to 1037 conditions per place. [2024-01-29 23:22:04,408 INFO L140 encePairwiseOnDemand]: 222/244 looper letters, 94 selfloop transitions, 10 changer transitions 0/268 dead transitions. [2024-01-29 23:22:04,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 268 transitions, 923 flow [2024-01-29 23:22:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 844 transitions. [2024-01-29 23:22:04,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8647540983606558 [2024-01-29 23:22:04,410 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 603 flow. Second operand 4 states and 844 transitions. [2024-01-29 23:22:04,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 268 transitions, 923 flow [2024-01-29 23:22:04,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 268 transitions, 905 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:22:04,419 INFO L231 Difference]: Finished difference. Result has 230 places, 227 transitions, 651 flow [2024-01-29 23:22:04,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=651, PETRI_PLACES=230, PETRI_TRANSITIONS=227} [2024-01-29 23:22:04,420 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -15 predicate places. [2024-01-29 23:22:04,420 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 227 transitions, 651 flow [2024-01-29 23:22:04,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 185.25) internal successors, (741), 4 states have internal predecessors, (741), 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-29 23:22:04,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:04,421 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] [2024-01-29 23:22:04,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:22:04,421 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:04,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1877158657, now seen corresponding path program 1 times [2024-01-29 23:22:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740340639] [2024-01-29 23:22:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:04,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:04,458 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-29 23:22:04,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740340639] [2024-01-29 23:22:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740340639] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:04,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421531559] [2024-01-29 23:22:04,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:04,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:04,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 244 [2024-01-29 23:22:04,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 227 transitions, 651 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 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-29 23:22:04,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:04,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 244 [2024-01-29 23:22:04,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:04,941 INFO L124 PetriNetUnfolderBase]: 326/2763 cut-off events. [2024-01-29 23:22:04,941 INFO L125 PetriNetUnfolderBase]: For 1213/1275 co-relation queries the response was YES. [2024-01-29 23:22:04,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4316 conditions, 2763 events. 326/2763 cut-off events. For 1213/1275 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 23443 event pairs, 176 based on Foata normal form. 397/2532 useless extension candidates. Maximal degree in co-relation 4295. Up to 321 conditions per place. [2024-01-29 23:22:04,950 INFO L140 encePairwiseOnDemand]: 207/244 looper letters, 78 selfloop transitions, 7 changer transitions 6/246 dead transitions. [2024-01-29 23:22:04,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 246 transitions, 888 flow [2024-01-29 23:22:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 750 transitions. [2024-01-29 23:22:04,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7684426229508197 [2024-01-29 23:22:04,953 INFO L175 Difference]: Start difference. First operand has 230 places, 227 transitions, 651 flow. Second operand 4 states and 750 transitions. [2024-01-29 23:22:04,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 246 transitions, 888 flow [2024-01-29 23:22:04,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 246 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:04,959 INFO L231 Difference]: Finished difference. Result has 222 places, 214 transitions, 639 flow [2024-01-29 23:22:04,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=639, PETRI_PLACES=222, PETRI_TRANSITIONS=214} [2024-01-29 23:22:04,960 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -23 predicate places. [2024-01-29 23:22:04,961 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 214 transitions, 639 flow [2024-01-29 23:22:04,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 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-29 23:22:04,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:04,961 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] [2024-01-29 23:22:04,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:22:04,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:04,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -800979891, now seen corresponding path program 1 times [2024-01-29 23:22:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165177766] [2024-01-29 23:22:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:05,228 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-29 23:22:05,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165177766] [2024-01-29 23:22:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165177766] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:05,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:22:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253773734] [2024-01-29 23:22:05,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:05,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:05,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:05,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:05,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:05,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 244 [2024-01-29 23:22:05,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 214 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-29 23:22:05,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:05,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 244 [2024-01-29 23:22:05,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:06,379 INFO L124 PetriNetUnfolderBase]: 2310/8708 cut-off events. [2024-01-29 23:22:06,380 INFO L125 PetriNetUnfolderBase]: For 2161/2188 co-relation queries the response was YES. [2024-01-29 23:22:06,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16039 conditions, 8708 events. 2310/8708 cut-off events. For 2161/2188 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 79492 event pairs, 476 based on Foata normal form. 392/8723 useless extension candidates. Maximal degree in co-relation 16017. Up to 2464 conditions per place. [2024-01-29 23:22:06,409 INFO L140 encePairwiseOnDemand]: 225/244 looper letters, 216 selfloop transitions, 8 changer transitions 0/320 dead transitions. [2024-01-29 23:22:06,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 320 transitions, 1347 flow [2024-01-29 23:22:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2024-01-29 23:22:06,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444672131147541 [2024-01-29 23:22:06,412 INFO L175 Difference]: Start difference. First operand has 222 places, 214 transitions, 639 flow. Second operand 4 states and 629 transitions. [2024-01-29 23:22:06,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 320 transitions, 1347 flow [2024-01-29 23:22:06,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 320 transitions, 1337 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:06,426 INFO L231 Difference]: Finished difference. Result has 225 places, 214 transitions, 677 flow [2024-01-29 23:22:06,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=677, PETRI_PLACES=225, PETRI_TRANSITIONS=214} [2024-01-29 23:22:06,427 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -20 predicate places. [2024-01-29 23:22:06,427 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 214 transitions, 677 flow [2024-01-29 23:22:06,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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-29 23:22:06,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:06,427 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] [2024-01-29 23:22:06,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:22:06,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:06,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 939427791, now seen corresponding path program 1 times [2024-01-29 23:22:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636701012] [2024-01-29 23:22:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:06,478 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-29 23:22:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636701012] [2024-01-29 23:22:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636701012] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:06,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:06,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:22:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150277607] [2024-01-29 23:22:06,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:06,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2024-01-29 23:22:06,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 214 transitions, 677 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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-29 23:22:06,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:06,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2024-01-29 23:22:06,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:07,362 INFO L124 PetriNetUnfolderBase]: 2140/6800 cut-off events. [2024-01-29 23:22:07,362 INFO L125 PetriNetUnfolderBase]: For 3153/3280 co-relation queries the response was YES. [2024-01-29 23:22:07,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14530 conditions, 6800 events. 2140/6800 cut-off events. For 3153/3280 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 58230 event pairs, 162 based on Foata normal form. 56/6696 useless extension candidates. Maximal degree in co-relation 14506. Up to 2777 conditions per place. [2024-01-29 23:22:07,383 INFO L140 encePairwiseOnDemand]: 183/244 looper letters, 179 selfloop transitions, 53 changer transitions 0/338 dead transitions. [2024-01-29 23:22:07,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 338 transitions, 1424 flow [2024-01-29 23:22:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2024-01-29 23:22:07,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6905737704918032 [2024-01-29 23:22:07,385 INFO L175 Difference]: Start difference. First operand has 225 places, 214 transitions, 677 flow. Second operand 4 states and 674 transitions. [2024-01-29 23:22:07,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 338 transitions, 1424 flow [2024-01-29 23:22:07,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 338 transitions, 1408 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:22:07,398 INFO L231 Difference]: Finished difference. Result has 227 places, 259 transitions, 1072 flow [2024-01-29 23:22:07,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1072, PETRI_PLACES=227, PETRI_TRANSITIONS=259} [2024-01-29 23:22:07,401 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -18 predicate places. [2024-01-29 23:22:07,401 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 259 transitions, 1072 flow [2024-01-29 23:22:07,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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-29 23:22:07,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:07,401 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, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:07,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:22:07,402 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:07,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1043355193, now seen corresponding path program 1 times [2024-01-29 23:22:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:07,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313474302] [2024-01-29 23:22:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:07,497 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-29 23:22:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:07,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313474302] [2024-01-29 23:22:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313474302] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:07,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:07,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146822588] [2024-01-29 23:22:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:07,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:22:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:07,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:22:07,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:22:07,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 244 [2024-01-29 23:22:07,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 259 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-29 23:22:07,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:07,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 244 [2024-01-29 23:22:07,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:07,815 INFO L124 PetriNetUnfolderBase]: 224/2977 cut-off events. [2024-01-29 23:22:07,816 INFO L125 PetriNetUnfolderBase]: For 2057/2093 co-relation queries the response was YES. [2024-01-29 23:22:07,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6028 conditions, 2977 events. 224/2977 cut-off events. For 2057/2093 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 26536 event pairs, 51 based on Foata normal form. 15/2902 useless extension candidates. Maximal degree in co-relation 6002. Up to 831 conditions per place. [2024-01-29 23:22:07,823 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 44 selfloop transitions, 7 changer transitions 1/277 dead transitions. [2024-01-29 23:22:07,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 277 transitions, 1265 flow [2024-01-29 23:22:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:22:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:22:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-01-29 23:22:07,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9603825136612022 [2024-01-29 23:22:07,825 INFO L175 Difference]: Start difference. First operand has 227 places, 259 transitions, 1072 flow. Second operand 3 states and 703 transitions. [2024-01-29 23:22:07,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 277 transitions, 1265 flow [2024-01-29 23:22:07,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 277 transitions, 1240 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-29 23:22:07,835 INFO L231 Difference]: Finished difference. Result has 225 places, 260 transitions, 1070 flow [2024-01-29 23:22:07,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=225, PETRI_TRANSITIONS=260} [2024-01-29 23:22:07,836 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -20 predicate places. [2024-01-29 23:22:07,836 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 260 transitions, 1070 flow [2024-01-29 23:22:07,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-29 23:22:07,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:07,837 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, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:07,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:22:07,837 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:07,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:07,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1402729063, now seen corresponding path program 1 times [2024-01-29 23:22:07,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:07,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146915825] [2024-01-29 23:22:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:07,935 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-29 23:22:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146915825] [2024-01-29 23:22:07,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146915825] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:07,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:07,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263588255] [2024-01-29 23:22:07,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:07,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:22:07,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:07,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:22:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:22:08,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2024-01-29 23:22:08,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 260 transitions, 1070 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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-29 23:22:08,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:08,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2024-01-29 23:22:08,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:09,051 INFO L124 PetriNetUnfolderBase]: 1594/6545 cut-off events. [2024-01-29 23:22:09,051 INFO L125 PetriNetUnfolderBase]: For 4963/5180 co-relation queries the response was YES. [2024-01-29 23:22:09,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15993 conditions, 6545 events. 1594/6545 cut-off events. For 4963/5180 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 61769 event pairs, 590 based on Foata normal form. 304/6691 useless extension candidates. Maximal degree in co-relation 15967. Up to 2385 conditions per place. [2024-01-29 23:22:09,069 INFO L140 encePairwiseOnDemand]: 224/244 looper letters, 194 selfloop transitions, 7 changer transitions 7/350 dead transitions. [2024-01-29 23:22:09,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 350 transitions, 1825 flow [2024-01-29 23:22:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2024-01-29 23:22:09,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6577868852459017 [2024-01-29 23:22:09,071 INFO L175 Difference]: Start difference. First operand has 225 places, 260 transitions, 1070 flow. Second operand 4 states and 642 transitions. [2024-01-29 23:22:09,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 350 transitions, 1825 flow [2024-01-29 23:22:09,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 350 transitions, 1809 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:09,086 INFO L231 Difference]: Finished difference. Result has 228 places, 260 transitions, 1109 flow [2024-01-29 23:22:09,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1109, PETRI_PLACES=228, PETRI_TRANSITIONS=260} [2024-01-29 23:22:09,088 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -17 predicate places. [2024-01-29 23:22:09,088 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 260 transitions, 1109 flow [2024-01-29 23:22:09,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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-29 23:22:09,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:09,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:09,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:22:09,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:09,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2070093909, now seen corresponding path program 1 times [2024-01-29 23:22:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:09,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807935616] [2024-01-29 23:22:09,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:09,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:09,153 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-29 23:22:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807935616] [2024-01-29 23:22:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807935616] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175047095] [2024-01-29 23:22:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:09,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:09,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 244 [2024-01-29 23:22:09,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 260 transitions, 1109 flow. Second operand has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 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-29 23:22:09,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:09,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 244 [2024-01-29 23:22:09,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:09,877 INFO L124 PetriNetUnfolderBase]: 559/4672 cut-off events. [2024-01-29 23:22:09,877 INFO L125 PetriNetUnfolderBase]: For 4503/4678 co-relation queries the response was YES. [2024-01-29 23:22:09,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10724 conditions, 4672 events. 559/4672 cut-off events. For 4503/4678 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 44641 event pairs, 199 based on Foata normal form. 69/4540 useless extension candidates. Maximal degree in co-relation 10696. Up to 1290 conditions per place. [2024-01-29 23:22:09,894 INFO L140 encePairwiseOnDemand]: 221/244 looper letters, 96 selfloop transitions, 9 changer transitions 1/300 dead transitions. [2024-01-29 23:22:09,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 300 transitions, 1493 flow [2024-01-29 23:22:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 730 transitions. [2024-01-29 23:22:09,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7479508196721312 [2024-01-29 23:22:09,896 INFO L175 Difference]: Start difference. First operand has 228 places, 260 transitions, 1109 flow. Second operand 4 states and 730 transitions. [2024-01-29 23:22:09,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 300 transitions, 1493 flow [2024-01-29 23:22:09,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 300 transitions, 1473 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:22:09,921 INFO L231 Difference]: Finished difference. Result has 230 places, 266 transitions, 1212 flow [2024-01-29 23:22:09,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1212, PETRI_PLACES=230, PETRI_TRANSITIONS=266} [2024-01-29 23:22:09,921 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -15 predicate places. [2024-01-29 23:22:09,921 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 266 transitions, 1212 flow [2024-01-29 23:22:09,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 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-29 23:22:09,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:09,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 23:22:09,922 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:09,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash -347358889, now seen corresponding path program 2 times [2024-01-29 23:22:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:09,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23096663] [2024-01-29 23:22:09,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:09,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:09,969 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-29 23:22:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23096663] [2024-01-29 23:22:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23096663] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:09,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897273315] [2024-01-29 23:22:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:09,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:10,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 244 [2024-01-29 23:22:10,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 266 transitions, 1212 flow. Second operand has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 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-29 23:22:10,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:10,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 244 [2024-01-29 23:22:10,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:10,780 INFO L124 PetriNetUnfolderBase]: 553/4601 cut-off events. [2024-01-29 23:22:10,781 INFO L125 PetriNetUnfolderBase]: For 4533/4704 co-relation queries the response was YES. [2024-01-29 23:22:10,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10574 conditions, 4601 events. 553/4601 cut-off events. For 4533/4704 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 43076 event pairs, 189 based on Foata normal form. 71/4448 useless extension candidates. Maximal degree in co-relation 10545. Up to 1278 conditions per place. [2024-01-29 23:22:10,800 INFO L140 encePairwiseOnDemand]: 223/244 looper letters, 79 selfloop transitions, 9 changer transitions 0/282 dead transitions. [2024-01-29 23:22:10,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 282 transitions, 1383 flow [2024-01-29 23:22:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 709 transitions. [2024-01-29 23:22:10,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7264344262295082 [2024-01-29 23:22:10,803 INFO L175 Difference]: Start difference. First operand has 230 places, 266 transitions, 1212 flow. Second operand 4 states and 709 transitions. [2024-01-29 23:22:10,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 282 transitions, 1383 flow [2024-01-29 23:22:10,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 282 transitions, 1381 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:10,826 INFO L231 Difference]: Finished difference. Result has 217 places, 252 transitions, 1117 flow [2024-01-29 23:22:10,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1117, PETRI_PLACES=217, PETRI_TRANSITIONS=252} [2024-01-29 23:22:10,827 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -28 predicate places. [2024-01-29 23:22:10,827 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 252 transitions, 1117 flow [2024-01-29 23:22:10,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 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-29 23:22:10,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:10,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:10,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 23:22:10,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:10,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash -889958347, now seen corresponding path program 1 times [2024-01-29 23:22:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:10,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202817602] [2024-01-29 23:22:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:10,901 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-29 23:22:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202817602] [2024-01-29 23:22:10,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202817602] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:10,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:22:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567636490] [2024-01-29 23:22:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:10,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:22:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:10,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:22:10,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:22:11,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 244 [2024-01-29 23:22:11,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 252 transitions, 1117 flow. Second operand has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-29 23:22:11,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:11,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 244 [2024-01-29 23:22:11,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:11,913 INFO L124 PetriNetUnfolderBase]: 610/5059 cut-off events. [2024-01-29 23:22:11,914 INFO L125 PetriNetUnfolderBase]: For 6519/6603 co-relation queries the response was YES. [2024-01-29 23:22:11,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12001 conditions, 5059 events. 610/5059 cut-off events. For 6519/6603 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 49157 event pairs, 163 based on Foata normal form. 20/4945 useless extension candidates. Maximal degree in co-relation 11971. Up to 1606 conditions per place. [2024-01-29 23:22:11,933 INFO L140 encePairwiseOnDemand]: 235/244 looper letters, 75 selfloop transitions, 17 changer transitions 21/309 dead transitions. [2024-01-29 23:22:11,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 309 transitions, 1582 flow [2024-01-29 23:22:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-29 23:22:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-29 23:22:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1425 transitions. [2024-01-29 23:22:11,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8343091334894613 [2024-01-29 23:22:11,936 INFO L175 Difference]: Start difference. First operand has 217 places, 252 transitions, 1117 flow. Second operand 7 states and 1425 transitions. [2024-01-29 23:22:11,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 309 transitions, 1582 flow [2024-01-29 23:22:11,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 309 transitions, 1572 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:11,957 INFO L231 Difference]: Finished difference. Result has 224 places, 259 transitions, 1199 flow [2024-01-29 23:22:11,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1199, PETRI_PLACES=224, PETRI_TRANSITIONS=259} [2024-01-29 23:22:11,958 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -21 predicate places. [2024-01-29 23:22:11,958 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 259 transitions, 1199 flow [2024-01-29 23:22:11,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-29 23:22:11,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:11,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:11,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 23:22:11,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:11,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1610052536, now seen corresponding path program 1 times [2024-01-29 23:22:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70533790] [2024-01-29 23:22:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:12,002 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-29 23:22:12,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70533790] [2024-01-29 23:22:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70533790] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:12,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:12,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376261193] [2024-01-29 23:22:12,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:12,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:12,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:12,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:12,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:12,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 244 [2024-01-29 23:22:12,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 259 transitions, 1199 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-29 23:22:12,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:12,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 244 [2024-01-29 23:22:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:13,142 INFO L124 PetriNetUnfolderBase]: 2837/9441 cut-off events. [2024-01-29 23:22:13,143 INFO L125 PetriNetUnfolderBase]: For 10630/10896 co-relation queries the response was YES. [2024-01-29 23:22:13,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24456 conditions, 9441 events. 2837/9441 cut-off events. For 10630/10896 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 86755 event pairs, 1036 based on Foata normal form. 715/10068 useless extension candidates. Maximal degree in co-relation 24423. Up to 5336 conditions per place. [2024-01-29 23:22:13,183 INFO L140 encePairwiseOnDemand]: 228/244 looper letters, 149 selfloop transitions, 7 changer transitions 4/268 dead transitions. [2024-01-29 23:22:13,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 268 transitions, 1556 flow [2024-01-29 23:22:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2024-01-29 23:22:13,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6506147540983607 [2024-01-29 23:22:13,185 INFO L175 Difference]: Start difference. First operand has 224 places, 259 transitions, 1199 flow. Second operand 4 states and 635 transitions. [2024-01-29 23:22:13,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 268 transitions, 1556 flow [2024-01-29 23:22:13,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 268 transitions, 1552 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-29 23:22:13,235 INFO L231 Difference]: Finished difference. Result has 213 places, 246 transitions, 1143 flow [2024-01-29 23:22:13,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1143, PETRI_PLACES=213, PETRI_TRANSITIONS=246} [2024-01-29 23:22:13,236 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -32 predicate places. [2024-01-29 23:22:13,236 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 246 transitions, 1143 flow [2024-01-29 23:22:13,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-29 23:22:13,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:13,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:13,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 23:22:13,237 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:13,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1627978357, now seen corresponding path program 1 times [2024-01-29 23:22:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816370524] [2024-01-29 23:22:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:13,430 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-29 23:22:13,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:13,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816370524] [2024-01-29 23:22:13,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816370524] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:13,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:13,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824749944] [2024-01-29 23:22:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:13,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:13,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:13,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 244 [2024-01-29 23:22:13,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 246 transitions, 1143 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 23:22:13,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:13,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 244 [2024-01-29 23:22:13,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:14,158 INFO L124 PetriNetUnfolderBase]: 467/3771 cut-off events. [2024-01-29 23:22:14,158 INFO L125 PetriNetUnfolderBase]: For 7939/8033 co-relation queries the response was YES. [2024-01-29 23:22:14,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9420 conditions, 3771 events. 467/3771 cut-off events. For 7939/8033 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 33915 event pairs, 150 based on Foata normal form. 424/4084 useless extension candidates. Maximal degree in co-relation 9385. Up to 1237 conditions per place. [2024-01-29 23:22:14,168 INFO L140 encePairwiseOnDemand]: 227/244 looper letters, 68 selfloop transitions, 14 changer transitions 3/261 dead transitions. [2024-01-29 23:22:14,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 261 transitions, 1398 flow [2024-01-29 23:22:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:22:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:22:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 781 transitions. [2024-01-29 23:22:14,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6401639344262295 [2024-01-29 23:22:14,171 INFO L175 Difference]: Start difference. First operand has 213 places, 246 transitions, 1143 flow. Second operand 5 states and 781 transitions. [2024-01-29 23:22:14,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 261 transitions, 1398 flow [2024-01-29 23:22:14,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 261 transitions, 1380 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-29 23:22:14,205 INFO L231 Difference]: Finished difference. Result has 200 places, 235 transitions, 1137 flow [2024-01-29 23:22:14,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1137, PETRI_PLACES=200, PETRI_TRANSITIONS=235} [2024-01-29 23:22:14,207 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -45 predicate places. [2024-01-29 23:22:14,208 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 235 transitions, 1137 flow [2024-01-29 23:22:14,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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-29 23:22:14,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:14,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:14,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 23:22:14,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:14,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1072279121, now seen corresponding path program 1 times [2024-01-29 23:22:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287667085] [2024-01-29 23:22:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:14,249 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-29 23:22:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:14,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287667085] [2024-01-29 23:22:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287667085] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:22:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422007370] [2024-01-29 23:22:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:14,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:22:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:22:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:22:14,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 244 [2024-01-29 23:22:14,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 235 transitions, 1137 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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-29 23:22:14,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:14,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 244 [2024-01-29 23:22:14,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:15,159 INFO L124 PetriNetUnfolderBase]: 2189/6551 cut-off events. [2024-01-29 23:22:15,160 INFO L125 PetriNetUnfolderBase]: For 10962/11277 co-relation queries the response was YES. [2024-01-29 23:22:15,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18735 conditions, 6551 events. 2189/6551 cut-off events. For 10962/11277 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 54273 event pairs, 1216 based on Foata normal form. 56/6496 useless extension candidates. Maximal degree in co-relation 18702. Up to 3580 conditions per place. [2024-01-29 23:22:15,183 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 194 selfloop transitions, 12 changer transitions 0/292 dead transitions. [2024-01-29 23:22:15,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 292 transitions, 1774 flow [2024-01-29 23:22:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2024-01-29 23:22:15,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6004098360655737 [2024-01-29 23:22:15,185 INFO L175 Difference]: Start difference. First operand has 200 places, 235 transitions, 1137 flow. Second operand 4 states and 586 transitions. [2024-01-29 23:22:15,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 292 transitions, 1774 flow [2024-01-29 23:22:15,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 292 transitions, 1747 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-29 23:22:15,210 INFO L231 Difference]: Finished difference. Result has 201 places, 235 transitions, 1148 flow [2024-01-29 23:22:15,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1148, PETRI_PLACES=201, PETRI_TRANSITIONS=235} [2024-01-29 23:22:15,211 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -44 predicate places. [2024-01-29 23:22:15,211 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 235 transitions, 1148 flow [2024-01-29 23:22:15,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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-29 23:22:15,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:15,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:15,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 23:22:15,211 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:15,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 210342427, now seen corresponding path program 1 times [2024-01-29 23:22:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022227358] [2024-01-29 23:22:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:15,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-29 23:22:15,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:15,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022227358] [2024-01-29 23:22:15,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022227358] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:15,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:15,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 23:22:15,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541538488] [2024-01-29 23:22:15,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:15,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 23:22:15,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 23:22:15,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 23:22:15,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 244 [2024-01-29 23:22:15,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 235 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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-29 23:22:15,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:15,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 244 [2024-01-29 23:22:15,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:16,322 INFO L124 PetriNetUnfolderBase]: 2456/6705 cut-off events. [2024-01-29 23:22:16,322 INFO L125 PetriNetUnfolderBase]: For 11477/11841 co-relation queries the response was YES. [2024-01-29 23:22:16,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19899 conditions, 6705 events. 2456/6705 cut-off events. For 11477/11841 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 53180 event pairs, 1453 based on Foata normal form. 258/6852 useless extension candidates. Maximal degree in co-relation 19867. Up to 4144 conditions per place. [2024-01-29 23:22:16,339 INFO L140 encePairwiseOnDemand]: 225/244 looper letters, 209 selfloop transitions, 12 changer transitions 0/292 dead transitions. [2024-01-29 23:22:16,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 292 transitions, 1815 flow [2024-01-29 23:22:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2024-01-29 23:22:16,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48770491803278687 [2024-01-29 23:22:16,341 INFO L175 Difference]: Start difference. First operand has 201 places, 235 transitions, 1148 flow. Second operand 4 states and 476 transitions. [2024-01-29 23:22:16,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 292 transitions, 1815 flow [2024-01-29 23:22:16,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 292 transitions, 1791 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:22:16,360 INFO L231 Difference]: Finished difference. Result has 202 places, 235 transitions, 1184 flow [2024-01-29 23:22:16,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1184, PETRI_PLACES=202, PETRI_TRANSITIONS=235} [2024-01-29 23:22:16,361 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -43 predicate places. [2024-01-29 23:22:16,361 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 235 transitions, 1184 flow [2024-01-29 23:22:16,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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-29 23:22:16,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:16,361 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, 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-29 23:22:16,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 23:22:16,362 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:16,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash 802251596, now seen corresponding path program 1 times [2024-01-29 23:22:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393102167] [2024-01-29 23:22:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:22:16,472 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-29 23:22:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:22:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393102167] [2024-01-29 23:22:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393102167] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:22:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:22:16,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:22:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779221224] [2024-01-29 23:22:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:22:16,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:22:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:22:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:22:16,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:22:16,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 244 [2024-01-29 23:22:16,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 235 transitions, 1184 flow. Second operand has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 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-29 23:22:16,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:22:16,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 244 [2024-01-29 23:22:16,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:22:16,562 INFO L124 PetriNetUnfolderBase]: 52/935 cut-off events. [2024-01-29 23:22:16,563 INFO L125 PetriNetUnfolderBase]: For 896/900 co-relation queries the response was YES. [2024-01-29 23:22:16,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2079 conditions, 935 events. 52/935 cut-off events. For 896/900 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4572 event pairs, 12 based on Foata normal form. 24/935 useless extension candidates. Maximal degree in co-relation 2046. Up to 378 conditions per place. [2024-01-29 23:22:16,565 INFO L140 encePairwiseOnDemand]: 239/244 looper letters, 28 selfloop transitions, 5 changer transitions 8/169 dead transitions. [2024-01-29 23:22:16,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 169 transitions, 820 flow [2024-01-29 23:22:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:22:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:22:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 911 transitions. [2024-01-29 23:22:16,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9334016393442623 [2024-01-29 23:22:16,567 INFO L175 Difference]: Start difference. First operand has 202 places, 235 transitions, 1184 flow. Second operand 4 states and 911 transitions. [2024-01-29 23:22:16,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 169 transitions, 820 flow [2024-01-29 23:22:16,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 169 transitions, 666 flow, removed 51 selfloop flow, removed 9 redundant places. [2024-01-29 23:22:16,572 INFO L231 Difference]: Finished difference. Result has 172 places, 158 transitions, 540 flow [2024-01-29 23:22:16,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=540, PETRI_PLACES=172, PETRI_TRANSITIONS=158} [2024-01-29 23:22:16,572 INFO L281 CegarLoopForPetriNet]: 245 programPoint places, -73 predicate places. [2024-01-29 23:22:16,572 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 540 flow [2024-01-29 23:22:16,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.4) internal successors, (1117), 5 states have internal predecessors, (1117), 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-29 23:22:16,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:22:16,573 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, 1, 1, 1, 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-29 23:22:16,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 23:22:16,573 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 23:22:16,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:22:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash -680047373, now seen corresponding path program 1 times [2024-01-29 23:22:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:22:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080651754] [2024-01-29 23:22:16,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:22:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:22:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:22:16,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:22:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:22:16,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:22:16,606 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:22:16,607 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION (129 of 130 remaining) [2024-01-29 23:22:16,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 130 remaining) [2024-01-29 23:22:16,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 130 remaining) [2024-01-29 23:22:16,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 130 remaining) [2024-01-29 23:22:16,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 130 remaining) [2024-01-29 23:22:16,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 130 remaining) [2024-01-29 23:22:16,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 130 remaining) [2024-01-29 23:22:16,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 130 remaining) [2024-01-29 23:22:16,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 130 remaining) [2024-01-29 23:22:16,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 130 remaining) [2024-01-29 23:22:16,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 130 remaining) [2024-01-29 23:22:16,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 130 remaining) [2024-01-29 23:22:16,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 130 remaining) [2024-01-29 23:22:16,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 130 remaining) [2024-01-29 23:22:16,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 130 remaining) [2024-01-29 23:22:16,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 130 remaining) [2024-01-29 23:22:16,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 130 remaining) [2024-01-29 23:22:16,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 130 remaining) [2024-01-29 23:22:16,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 130 remaining) [2024-01-29 23:22:16,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 130 remaining) [2024-01-29 23:22:16,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 130 remaining) [2024-01-29 23:22:16,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 130 remaining) [2024-01-29 23:22:16,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 130 remaining) [2024-01-29 23:22:16,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 130 remaining) [2024-01-29 23:22:16,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 130 remaining) [2024-01-29 23:22:16,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 130 remaining) [2024-01-29 23:22:16,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 130 remaining) [2024-01-29 23:22:16,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 130 remaining) [2024-01-29 23:22:16,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 130 remaining) [2024-01-29 23:22:16,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 130 remaining) [2024-01-29 23:22:16,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 130 remaining) [2024-01-29 23:22:16,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 130 remaining) [2024-01-29 23:22:16,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 130 remaining) [2024-01-29 23:22:16,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 130 remaining) [2024-01-29 23:22:16,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 130 remaining) [2024-01-29 23:22:16,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 130 remaining) [2024-01-29 23:22:16,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 130 remaining) [2024-01-29 23:22:16,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 130 remaining) [2024-01-29 23:22:16,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 23:22:16,624 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:22:16,630 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:22:16,630 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:22:16,659 INFO L503 ceAbstractionStarter]: Automizer considered 106 witness invariants [2024-01-29 23:22:16,659 INFO L504 ceAbstractionStarter]: WitnessConsidered=106 [2024-01-29 23:22:16,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:22:16 BasicIcfg [2024-01-29 23:22:16,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:22:16,660 INFO L158 Benchmark]: Toolchain (without parser) took 18596.81ms. Allocated memory was 123.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 63.1MB in the beginning and 948.4MB in the end (delta: -885.3MB). Peak memory consumption was 360.9MB. Max. memory is 16.1GB. [2024-01-29 23:22:16,661 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 123.7MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:22:16,661 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 123.7MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:22:16,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.15ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 63.1MB in the beginning and 112.4MB in the end (delta: -49.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-01-29 23:22:16,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.02ms. Allocated memory is still 157.3MB. Free memory was 112.4MB in the beginning and 110.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:22:16,661 INFO L158 Benchmark]: Boogie Preprocessor took 52.76ms. Allocated memory is still 157.3MB. Free memory was 110.0MB in the beginning and 107.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 23:22:16,662 INFO L158 Benchmark]: RCFGBuilder took 743.69ms. Allocated memory is still 157.3MB. Free memory was 107.0MB in the beginning and 116.3MB in the end (delta: -9.3MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-01-29 23:22:16,662 INFO L158 Benchmark]: TraceAbstraction took 17096.44ms. Allocated memory was 157.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 116.3MB in the beginning and 948.4MB in the end (delta: -832.1MB). Peak memory consumption was 378.0MB. Max. memory is 16.1GB. [2024-01-29 23:22:16,663 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.18ms. Allocated memory is still 123.7MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.40ms. Allocated memory is still 123.7MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.15ms. Allocated memory was 123.7MB in the beginning and 157.3MB in the end (delta: 33.6MB). Free memory was 63.1MB in the beginning and 112.4MB in the end (delta: -49.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.02ms. Allocated memory is still 157.3MB. Free memory was 112.4MB in the beginning and 110.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.76ms. Allocated memory is still 157.3MB. Free memory was 110.0MB in the beginning and 107.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 743.69ms. Allocated memory is still 157.3MB. Free memory was 107.0MB in the beginning and 116.3MB in the end (delta: -9.3MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17096.44ms. Allocated memory was 157.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 116.3MB in the beginning and 948.4MB in the end (delta: -832.1MB). Peak memory consumption was 378.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int g = 42; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]] [L694] 0 int r = __VERIFIER_nondet_int(); [L695] 0 int t; [L696] 0 pthread_t id; VAL [A={3:0}, B={4:0}, g=42, id={5:0}, r=1] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]] [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L700] COND TRUE 0 \read(r) VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, r=1] [L701] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] [L701] 0 g = 17 VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L702] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L702] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L703] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPNEQ,IdentifierExpression[r],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L703] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1] [L705] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] [L705] 0 t = g VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPNEQ,IdentifierExpression[t],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[t],IntegerLiteral[25]],IntegerLiteral[17]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[127]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[42]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[t]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[25]],IntegerLiteral[17]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IntegerLiteral[17],IdentifierExpression[g]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPNEQ,IdentifierExpression[g],IntegerLiteral[0]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]]]] VAL [A={3:0}, B={4:0}, arg={0:0}, g=17, id={5:0}, r=1, t=17] [L706] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[42]]]]]] [L706] CALL 0 __VERIFIER_assert(!(t == 17)) [L19] COND TRUE 0 !(cond) VAL [A={3:0}, B={4:0}, \old(cond)=0, arg={0:0}, cond=0, g=17] [L19] 0 reach_error() VAL [A={3:0}, B={4:0}, \old(cond)=0, arg={0:0}, cond=0, g=17] - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: 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: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 298 locations, 130 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: 16.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10469 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5653 mSDsluCounter, 1874 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 680 mSDsCounter, 1294 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9821 IncrementalHoareTripleChecker+Invalid, 11115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1294 mSolverCounterUnsat, 1194 mSDtfsCounter, 9821 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1212occurred in iteration=11, InterpolantAutomatonStates: 74, 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, 1.4s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 2437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-29 23:22:16,696 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