./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.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/28-race_reach_71-funloop_racing.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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/28-race_reach_71-funloop_racing.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/28-race_reach_71-funloop_racing.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-59af5db-m [2024-02-02 09:36:37,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:36:37,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:36:37,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:36:37,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:36:37,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:36:37,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:36:37,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:36:37,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:36:37,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:36:37,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:36:37,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:36:37,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:36:37,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:36:37,691 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:36:37,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:36:37,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:36:37,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:36:37,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:36:37,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:36:37,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:36:37,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:36:37,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:36:37,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:36:37,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:36:37,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:36:37,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:36:37,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:36:37,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:36:37,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:36:37,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:36:37,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:36:37,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:37,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:36:37,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:36:37,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:36:37,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:36:37,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:36:37,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:36:37,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:36:37,698 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:36:37,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:36:37,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:36:37,699 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-02-02 09:36:37,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:36:37,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:36:37,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:36:37,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:36:37,902 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:36:37,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-02-02 09:36:39,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:36:39,246 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:36:39,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-02-02 09:36:39,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c492500/6c6f4c14b680426499f7ac0a1956c24e/FLAG07b46c251 [2024-02-02 09:36:39,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c492500/6c6f4c14b680426499f7ac0a1956c24e [2024-02-02 09:36:39,306 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:36:39,306 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:36:39,307 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/28-race_reach_71-funloop_racing.yml/witness.yml [2024-02-02 09:36:39,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:36:39,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:36:39,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:39,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:36:39,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:36:39,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:39" (1/2) ... [2024-02-02 09:36:39,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fdce73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:39, skipping insertion in model container [2024-02-02 09:36:39,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:36:39" (1/2) ... [2024-02-02 09:36:39,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b6e50c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:36:39, skipping insertion in model container [2024-02-02 09:36:39,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:39" (2/2) ... [2024-02-02 09:36:39,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fdce73 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:39, skipping insertion in model container [2024-02-02 09:36:39,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:39" (2/2) ... [2024-02-02 09:36:39,532 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:36:39,705 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Loop invariant at [L954-L954] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 10000) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Location invariant before [L954-L954] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 9999) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Loop invariant at [L958-L958] (((i == 10) && (i == 10)) && (i == 10000)) && ((((((((((((((((((((((((((25 <= i && i <= 10000) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Location invariant before [L958-L958] (((i == 10) && (i == 10)) && (i == 10000)) && ((((((((((((((((((((((((((25 <= i && i <= 9999) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Location invariant after [L946-L947] ((unsigned long )arg == 0UL) && (((((((((i == 9 || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Loop invariant at [L946-L947] (unsigned long )arg == 0UL [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Location invariant before [L948-L948] (i == 10) && ((unsigned long )arg == 0UL) [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Location invariant before [L957-L957] (((((((((((((((((((((((((((((i == 10) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000) [2024-02-02 09:36:39,706 INFO L101 nessWitnessExtractor]: Loop invariant at [L957-L957] (((((((((((i == 10) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000)) && (i == 10)) && (i == 10)) && (i == 10000) [2024-02-02 09:36:39,707 INFO L101 nessWitnessExtractor]: Location invariant before [L959-L959] (((i == 10) && (i == 10)) && (i == 10000)) && (i == 10000) [2024-02-02 09:36:39,707 INFO L101 nessWitnessExtractor]: Loop invariant at [L941-L941] (((((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) [2024-02-02 09:36:39,707 INFO L101 nessWitnessExtractor]: Location invariant before [L941-L941] (((((((((((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9])) && (((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) [2024-02-02 09:36:39,708 INFO L101 nessWitnessExtractor]: Location invariant before [L954-L954] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 9999) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,708 INFO L101 nessWitnessExtractor]: Loop invariant at [L954-L954] (i == 10) && ((((((((((((((((((((((((((25 <= i && i <= 10000) || i == 24) || i == 23) || i == 22) || i == 21) || i == 20) || i == 19) || i == 18) || i == 17) || i == 16) || i == 15) || i == 14) || i == 13) || i == 12) || i == 11) || i == 10) || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,708 INFO L101 nessWitnessExtractor]: Location invariant before [L942-L942] ((((((((((((((((((entry == & cache[0] || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9]) || entry == & cache[0]) || entry == & cache[1]) || entry == & cache[2]) || entry == & cache[3]) || entry == & cache[4]) || entry == & cache[5]) || entry == & cache[6]) || entry == & cache[7]) || entry == & cache[8]) || entry == & cache[9] [2024-02-02 09:36:39,708 INFO L101 nessWitnessExtractor]: Location invariant after [L951-L952] ((((((((i == 9 || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-02-02 09:36:39,708 INFO L101 nessWitnessExtractor]: Loop invariant at [L951-L952] (((((((((i == 10 || i == 9) || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-02-02 09:36:39,708 INFO L101 nessWitnessExtractor]: Location invariant after [L955-L956] ((i == 10) && (i == 10000)) && (((((((((i == 9 || i == 8) || i == 7) || i == 6) || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) [2024-02-02 09:36:39,709 INFO L101 nessWitnessExtractor]: Loop invariant at [L955-L956] (i == 10) && (i == 10000) [2024-02-02 09:36:39,765 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:36:40,165 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/28-race_reach_71-funloop_racing.i[41323,41336] [2024-02-02 09:36:40,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:40,195 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:36:40,220 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/28-race_reach_71-funloop_racing.i[41323,41336] 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-02-02 09:36:40,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:36:40,703 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:36:40,704 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40 WrapperNode [2024-02-02 09:36:40,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:36:40,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:40,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:36:40,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:36:40,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,789 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 306 [2024-02-02 09:36:40,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:36:40,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:36:40,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:36:40,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:36:40,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,850 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 16, 5, 2]. 64 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 8 writes are split as follows [0, 7, 0, 1]. [2024-02-02 09:36:40,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:36:40,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:36:40,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:36:40,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:36:40,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (1/1) ... [2024-02-02 09:36:40,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:36:40,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:40,955 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-02-02 09:36:40,964 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-02-02 09:36:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:36:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:36:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:36:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-02-02 09:36:41,010 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-02-02 09:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:36:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:36:41,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:36:41,011 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:36:41,159 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:36:41,161 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:36:41,587 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:36:41,587 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:36:41,697 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:36:41,697 INFO L320 CfgBuilder]: Removed 35 assume(true) statements. [2024-02-02 09:36:41,697 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:41 BoogieIcfgContainer [2024-02-02 09:36:41,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:36:41,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:36:41,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:36:41,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:36:41,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:36:39" (1/4) ... [2024-02-02 09:36:41,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa8885b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:36:41, skipping insertion in model container [2024-02-02 09:36:41,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:36:39" (2/4) ... [2024-02-02 09:36:41,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa8885b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:36:41, skipping insertion in model container [2024-02-02 09:36:41,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:36:40" (3/4) ... [2024-02-02 09:36:41,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa8885b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:36:41, skipping insertion in model container [2024-02-02 09:36:41,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:36:41" (4/4) ... [2024-02-02 09:36:41,704 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-02-02 09:36:41,716 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:36:41,717 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-02-02 09:36:41,717 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:36:41,759 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-02 09:36:41,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 187 transitions, 381 flow [2024-02-02 09:36:41,853 INFO L124 PetriNetUnfolderBase]: 65/295 cut-off events. [2024-02-02 09:36:41,853 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-02 09:36:41,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 295 events. 65/295 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1568 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2024-02-02 09:36:41,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 187 transitions, 381 flow [2024-02-02 09:36:41,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 187 transitions, 381 flow [2024-02-02 09:36:41,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:36:41,873 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;@6f20d987, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:36:41,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2024-02-02 09:36:41,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:36:41,874 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:36:41,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:41,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:41,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:36:41,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 37 more)] === [2024-02-02 09:36:41,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash 24600, now seen corresponding path program 1 times [2024-02-02 09:36:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732087877] [2024-02-02 09:36:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:42,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732087877] [2024-02-02 09:36:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732087877] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:36:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513340454] [2024-02-02 09:36:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:42,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:36:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:42,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:36:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:36:42,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2024-02-02 09:36:42,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 187 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-02-02 09:36:42,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:42,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2024-02-02 09:36:42,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:42,199 INFO L124 PetriNetUnfolderBase]: 72/265 cut-off events. [2024-02-02 09:36:42,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:36:42,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 265 events. 72/265 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1024 event pairs, 60 based on Foata normal form. 51/256 useless extension candidates. Maximal degree in co-relation 392. Up to 160 conditions per place. [2024-02-02 09:36:42,202 INFO L140 encePairwiseOnDemand]: 171/187 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-02 09:36:42,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 198 flow [2024-02-02 09:36:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:36:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:36:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2024-02-02 09:36:42,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49376114081996436 [2024-02-02 09:36:42,218 INFO L175 Difference]: Start difference. First operand has 150 places, 187 transitions, 381 flow. Second operand 3 states and 277 transitions. [2024-02-02 09:36:42,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 198 flow [2024-02-02 09:36:42,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-02 09:36:42,222 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 144 flow [2024-02-02 09:36:42,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-02-02 09:36:42,226 INFO L281 CegarLoopForPetriNet]: 150 programPoint places, -83 predicate places. [2024-02-02 09:36:42,226 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 144 flow [2024-02-02 09:36:42,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-02-02 09:36:42,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:42,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:36:42,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:36:42,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 37 more)] === [2024-02-02 09:36:42,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash 23665619, now seen corresponding path program 1 times [2024-02-02 09:36:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:42,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954826602] [2024-02-02 09:36:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:42,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954826602] [2024-02-02 09:36:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954826602] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:36:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:36:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102288279] [2024-02-02 09:36:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:42,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:36:42,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2024-02-02 09:36:42,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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-02-02 09:36:42,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:42,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2024-02-02 09:36:42,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:42,400 INFO L124 PetriNetUnfolderBase]: 72/267 cut-off events. [2024-02-02 09:36:42,400 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-02 09:36:42,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 267 events. 72/267 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1025 event pairs, 60 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 428. Up to 160 conditions per place. [2024-02-02 09:36:42,404 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 30 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-02-02 09:36:42,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 214 flow [2024-02-02 09:36:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-02-02 09:36:42,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585561497326203 [2024-02-02 09:36:42,410 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 144 flow. Second operand 4 states and 343 transitions. [2024-02-02 09:36:42,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 214 flow [2024-02-02 09:36:42,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:36:42,412 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 160 flow [2024-02-02 09:36:42,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-02-02 09:36:42,412 INFO L281 CegarLoopForPetriNet]: 150 programPoint places, -80 predicate places. [2024-02-02 09:36:42,413 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 160 flow [2024-02-02 09:36:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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-02-02 09:36:42,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:42,413 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-02-02 09:36:42,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:36:42,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 37 more)] === [2024-02-02 09:36:42,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1267848398, now seen corresponding path program 1 times [2024-02-02 09:36:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412650667] [2024-02-02 09:36:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:42,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:42,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412650667] [2024-02-02 09:36:42,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412650667] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:36:42,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696068733] [2024-02-02 09:36:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:42,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:36:42,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:42,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-02 09:36:42,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-02 09:36:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:42,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-02 09:36:42,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:36:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:42,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-02 09:36:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696068733] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-02 09:36:42,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-02 09:36:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-02-02 09:36:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728764858] [2024-02-02 09:36:42,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-02 09:36:42,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:36:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:42,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:36:42,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:36:42,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2024-02-02 09:36:42,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:42,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:42,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2024-02-02 09:36:42,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:42,952 INFO L124 PetriNetUnfolderBase]: 72/269 cut-off events. [2024-02-02 09:36:42,959 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-02-02 09:36:42,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 269 events. 72/269 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1030 event pairs, 60 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 432. Up to 160 conditions per place. [2024-02-02 09:36:42,961 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 30 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-02-02 09:36:42,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 234 flow [2024-02-02 09:36:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:36:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:36:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2024-02-02 09:36:42,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502673796791444 [2024-02-02 09:36:42,964 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 160 flow. Second operand 5 states and 421 transitions. [2024-02-02 09:36:42,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 234 flow [2024-02-02 09:36:42,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:42,967 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 176 flow [2024-02-02 09:36:42,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-02-02 09:36:42,969 INFO L281 CegarLoopForPetriNet]: 150 programPoint places, -77 predicate places. [2024-02-02 09:36:42,969 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 176 flow [2024-02-02 09:36:42,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:42,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:42,975 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1] [2024-02-02 09:36:42,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-02 09:36:43,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:36:43,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 37 more)] === [2024-02-02 09:36:43,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1368376567, now seen corresponding path program 2 times [2024-02-02 09:36:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061937535] [2024-02-02 09:36:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061937535] [2024-02-02 09:36:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061937535] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:36:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607526500] [2024-02-02 09:36:43,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-02 09:36:43,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:36:43,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:43,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-02 09:36:43,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-02 09:36:43,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-02 09:36:43,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-02 09:36:43,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-02 09:36:43,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:36:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:43,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-02 09:36:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:43,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607526500] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-02 09:36:43,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-02 09:36:43,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-02-02 09:36:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849035954] [2024-02-02 09:36:43,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-02 09:36:43,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:36:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:36:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:36:43,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2024-02-02 09:36:43,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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-02-02 09:36:43,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:43,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2024-02-02 09:36:43,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:43,604 INFO L124 PetriNetUnfolderBase]: 72/271 cut-off events. [2024-02-02 09:36:43,605 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-02 09:36:43,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 271 events. 72/271 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1018 event pairs, 60 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 436. Up to 160 conditions per place. [2024-02-02 09:36:43,606 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 30 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2024-02-02 09:36:43,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 254 flow [2024-02-02 09:36:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-02 09:36:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-02 09:36:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2024-02-02 09:36:43,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447415329768271 [2024-02-02 09:36:43,610 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 176 flow. Second operand 6 states and 499 transitions. [2024-02-02 09:36:43,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 254 flow [2024-02-02 09:36:43,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 244 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-02 09:36:43,612 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 192 flow [2024-02-02 09:36:43,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2024-02-02 09:36:43,613 INFO L281 CegarLoopForPetriNet]: 150 programPoint places, -74 predicate places. [2024-02-02 09:36:43,613 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 192 flow [2024-02-02 09:36:43,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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-02-02 09:36:43,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:43,614 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1] [2024-02-02 09:36:43,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-02 09:36:43,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-02-02 09:36:43,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 37 more)] === [2024-02-02 09:36:43,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash -749863292, now seen corresponding path program 3 times [2024-02-02 09:36:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934701100] [2024-02-02 09:36:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:43,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934701100] [2024-02-02 09:36:43,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934701100] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:36:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676239334] [2024-02-02 09:36:43,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-02 09:36:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:36:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:43,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-02 09:36:43,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-02 09:36:43,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-02 09:36:43,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-02 09:36:43,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-02 09:36:43,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:36:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-02 09:36:44,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-02 09:36:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676239334] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:36:44,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-02 09:36:44,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2024-02-02 09:36:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752698487] [2024-02-02 09:36:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:36:44,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:36:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:36:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-02 09:36:44,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2024-02-02 09:36:44,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 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-02-02 09:36:44,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:44,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2024-02-02 09:36:44,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:44,147 INFO L124 PetriNetUnfolderBase]: 72/270 cut-off events. [2024-02-02 09:36:44,147 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-02-02 09:36:44,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 270 events. 72/270 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1021 event pairs, 60 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 429. Up to 156 conditions per place. [2024-02-02 09:36:44,148 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 32 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-02-02 09:36:44,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 256 flow [2024-02-02 09:36:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:36:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:36:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2024-02-02 09:36:44,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446524064171123 [2024-02-02 09:36:44,150 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 192 flow. Second operand 4 states and 334 transitions. [2024-02-02 09:36:44,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 256 flow [2024-02-02 09:36:44,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 242 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-02-02 09:36:44,152 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 178 flow [2024-02-02 09:36:44,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-02-02 09:36:44,152 INFO L281 CegarLoopForPetriNet]: 150 programPoint places, -76 predicate places. [2024-02-02 09:36:44,153 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 178 flow [2024-02-02 09:36:44,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 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-02-02 09:36:44,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:44,153 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1] [2024-02-02 09:36:44,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-02 09:36:44,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:36:44,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 37 more)] === [2024-02-02 09:36:44,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash 935907125, now seen corresponding path program 1 times [2024-02-02 09:36:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:44,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495282674] [2024-02-02 09:36:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:36:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495282674] [2024-02-02 09:36:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495282674] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-02 09:36:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964969397] [2024-02-02 09:36:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:44,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:36:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:36:44,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-02 09:36:44,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-02 09:36:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:36:44,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-02 09:36:44,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-02 09:36:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:44,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-02 09:36:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:36:44,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964969397] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-02 09:36:44,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-02 09:36:44,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-02-02 09:36:44,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9949366] [2024-02-02 09:36:44,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-02 09:36:44,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-02 09:36:44,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:36:44,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-02 09:36:44,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-02-02 09:36:44,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2024-02-02 09:36:44,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 178 flow. Second operand has 13 states, 13 states have (on average 77.0) internal successors, (1001), 13 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:44,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:36:44,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2024-02-02 09:36:44,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:36:44,788 INFO L124 PetriNetUnfolderBase]: 72/282 cut-off events. [2024-02-02 09:36:44,789 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-02-02 09:36:44,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 282 events. 72/282 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1030 event pairs, 60 based on Foata normal form. 6/230 useless extension candidates. Maximal degree in co-relation 416. Up to 156 conditions per place. [2024-02-02 09:36:44,790 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 39 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2024-02-02 09:36:44,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 358 flow [2024-02-02 09:36:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-02 09:36:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-02 09:36:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 957 transitions. [2024-02-02 09:36:44,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2024-02-02 09:36:44,792 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 178 flow. Second operand 12 states and 957 transitions. [2024-02-02 09:36:44,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 358 flow [2024-02-02 09:36:44,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:36:44,794 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 283 flow [2024-02-02 09:36:44,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=283, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2024-02-02 09:36:44,795 INFO L281 CegarLoopForPetriNet]: 150 programPoint places, -61 predicate places. [2024-02-02 09:36:44,795 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 283 flow [2024-02-02 09:36:44,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 77.0) internal successors, (1001), 13 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:36:44,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:36:44,796 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 1, 1, 1, 1] [2024-02-02 09:36:44,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-02 09:36:45,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-02 09:36:45,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 37 more)] === [2024-02-02 09:36:45,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:36:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1516390871, now seen corresponding path program 2 times [2024-02-02 09:36:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:36:45,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094324976] [2024-02-02 09:36:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:36:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:36:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:45,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:36:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:36:45,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:36:45,046 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:36:45,046 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 40 remaining) [2024-02-02 09:36:45,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 40 remaining) [2024-02-02 09:36:45,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 40 remaining) [2024-02-02 09:36:45,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 40 remaining) [2024-02-02 09:36:45,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 40 remaining) [2024-02-02 09:36:45,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 40 remaining) [2024-02-02 09:36:45,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 40 remaining) [2024-02-02 09:36:45,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (21 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (20 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 40 remaining) [2024-02-02 09:36:45,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 40 remaining) [2024-02-02 09:36:45,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 40 remaining) [2024-02-02 09:36:45,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 40 remaining) [2024-02-02 09:36:45,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 40 remaining) [2024-02-02 09:36:45,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 40 remaining) [2024-02-02 09:36:45,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 40 remaining) [2024-02-02 09:36:45,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 40 remaining) [2024-02-02 09:36:45,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 40 remaining) [2024-02-02 09:36:45,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 40 remaining) [2024-02-02 09:36:45,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 40 remaining) [2024-02-02 09:36:45,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 40 remaining) [2024-02-02 09:36:45,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:36:45,053 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-02-02 09:36:45,057 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:36:45,057 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:36:45,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-02 09:36:45,074 INFO L503 ceAbstractionStarter]: Automizer considered 27 witness invariants [2024-02-02 09:36:45,074 INFO L504 ceAbstractionStarter]: WitnessConsidered=27 [2024-02-02 09:36:45,075 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:36:45 BasicIcfg [2024-02-02 09:36:45,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:36:45,075 INFO L158 Benchmark]: Toolchain (without parser) took 5552.86ms. Allocated memory was 211.8MB in the beginning and 297.8MB in the end (delta: 86.0MB). Free memory was 135.7MB in the beginning and 175.1MB in the end (delta: -39.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-02-02 09:36:45,076 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:45,076 INFO L158 Benchmark]: Witness Parser took 0.72ms. Allocated memory is still 211.8MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:36:45,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1180.87ms. Allocated memory is still 211.8MB. Free memory was 135.4MB in the beginning and 165.8MB in the end (delta: -30.4MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-02-02 09:36:45,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.09ms. Allocated memory is still 211.8MB. Free memory was 165.8MB in the beginning and 156.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-02-02 09:36:45,076 INFO L158 Benchmark]: Boogie Preprocessor took 135.42ms. Allocated memory is still 211.8MB. Free memory was 156.4MB in the beginning and 147.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-02-02 09:36:45,077 INFO L158 Benchmark]: RCFGBuilder took 769.38ms. Allocated memory is still 211.8MB. Free memory was 147.0MB in the beginning and 163.2MB in the end (delta: -16.2MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-02-02 09:36:45,077 INFO L158 Benchmark]: TraceAbstraction took 3376.12ms. Allocated memory was 211.8MB in the beginning and 297.8MB in the end (delta: 86.0MB). Free memory was 162.1MB in the beginning and 175.1MB in the end (delta: -12.9MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2024-02-02 09:36:45,078 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.72ms. Allocated memory is still 211.8MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1180.87ms. Allocated memory is still 211.8MB. Free memory was 135.4MB in the beginning and 165.8MB in the end (delta: -30.4MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.09ms. Allocated memory is still 211.8MB. Free memory was 165.8MB in the beginning and 156.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.42ms. Allocated memory is still 211.8MB. Free memory was 156.4MB in the beginning and 147.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 769.38ms. Allocated memory is still 211.8MB. Free memory was 147.0MB in the beginning and 163.2MB in the end (delta: -16.2MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3376.12ms. Allocated memory was 211.8MB in the beginning and 297.8MB in the end (delta: 86.0MB). Free memory was 162.1MB in the beginning and 175.1MB in the end (delta: -12.9MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 951]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L934] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L935-L938] struct cache_entry { int refs; pthread_mutex_t refs_mutex; } cache[10]; [L935-L938] struct cache_entry { int refs; pthread_mutex_t refs_mutex; } cache[10]; [L951] int i = 0; VAL [__global_lock={3:0}, cache={4:0}, i=0] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=0] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=1] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=1] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=2] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=2] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=3] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=3] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=4] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=4] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=5] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=5] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=6] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=6] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=7] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=7] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=8] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=8] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=9] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=9] [L951] COND TRUE i < 10 [L951] i++ VAL [__global_lock={3:0}, cache={4:0}, i=10] [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[10]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=10] [L951] COND FALSE !(i < 10) [L951] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[9]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[8]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [__global_lock={3:0}, cache={4:0}, i=281] - UnprovableResult [Line: 951]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 951]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 954]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 954]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 955]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 955]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 957]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 957]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 958]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 958]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 959]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 957]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 955]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 958]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 954]: 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: 946]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 946]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 948]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 946]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 195 locations, 40 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: 3.3s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 8 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 321 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12/96 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-02-02 09:36:45,101 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