./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.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/13-privatized_41-traces-ex-7_unknown_1_pos.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_41-traces-ex-7_unknown_1_pos.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 23:21:29,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:21:29,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:21:29,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:21:29,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:21:29,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:21:29,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:21:29,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:21:29,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:21:29,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:21:29,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:21:29,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:21:29,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:21:29,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:21:29,193 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:21:29,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:21:29,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:21:29,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:21:29,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:21:29,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:21:29,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:21:29,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:21:29,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:21:29,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:21:29,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:21:29,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:21:29,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:21:29,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:21:29,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:21:29,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:21:29,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:21:29,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:21:29,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:29,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:21:29,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:21:29,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:21:29,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:21:29,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:21:29,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:21:29,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:21:29,201 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:21:29,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:21:29,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:21:29,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 23:21:29,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:21:29,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:21:29,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:21:29,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:21:29,444 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:21:29,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-01-29 23:21:30,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:21:30,991 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:21:30,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-01-29 23:21:31,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e3a1f13/07d3142b41c7403eada79e7b7d974ca9/FLAG94d61721f [2024-01-29 23:21:31,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e3a1f13/07d3142b41c7403eada79e7b7d974ca9 [2024-01-29 23:21:31,028 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:21:31,029 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:21:31,032 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/13-privatized_41-traces-ex-7_unknown_1_pos.yml/witness.yml [2024-01-29 23:21:31,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:21:31,151 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:21:31,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:31,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:21:31,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:21:31,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:31" (1/2) ... [2024-01-29 23:21:31,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bdcc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:31, skipping insertion in model container [2024-01-29 23:21:31,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:31" (1/2) ... [2024-01-29 23:21:31,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f3ef417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:31, skipping insertion in model container [2024-01-29 23:21:31,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:31" (2/2) ... [2024-01-29 23:21:31,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bdcc13 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31, skipping insertion in model container [2024-01-29 23:21:31,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:31" (2/2) ... [2024-01-29 23:21:31,164 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:21:31,203 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:21:31,204 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (unsigned long )arg == 0UL [2024-01-29 23:21:31,204 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,204 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= g) && (g <= 17)) && (g <= 127) [2024-01-29 23:21:31,205 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= g) && (g <= 17)) && (g % 17 == 0) [2024-01-29 23:21:31,205 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= g) && (g <= 17)) && (g == 0 || g == 17) [2024-01-29 23:21:31,205 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] 0 <= g [2024-01-29 23:21:31,205 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-29 23:21:31,205 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,205 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g <= 127) [2024-01-29 23:21:31,205 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g == 0 || g == 17) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (0 <= g) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= g) && (g <= 17)) && (g <= 127) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g == 0 || g == 17) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g % 17 == 0) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g <= 127) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g % 17 == 0) [2024-01-29 23:21:31,206 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (0 <= g) [2024-01-29 23:21:31,207 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g == 0 || g == 17) [2024-01-29 23:21:31,207 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,207 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= g) && (g % 17 == 0) [2024-01-29 23:21:31,207 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-29 23:21:31,207 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,207 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] ((0 <= g) && (g <= 17)) && (g <= 127) [2024-01-29 23:21:31,207 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] ((0 <= g) && (g <= 17)) && (g % 17 == 0) [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] ((0 <= g) && (g <= 17)) && (g == 0 || g == 17) [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] 0 <= g [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] 0 <= g [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= g) && (g % 17 == 0) [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= g) && (g <= 127) [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= g) && (g == 0 || g == 17) [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,208 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= g) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:31,209 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (g == 17) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:31,209 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] g == 17 [2024-01-29 23:21:31,209 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,209 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] ((0 <= g) && (g <= 17)) && (g % 17 == 0) [2024-01-29 23:21:31,209 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] ((0 <= g) && (g <= 17)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:31,209 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] ((0 <= g) && (g <= 17)) && (g <= 127) [2024-01-29 23:21:31,209 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] 0 <= g [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] ((0 <= g) && (g <= 17)) && (g == 0 || g == 17) [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g == 17 [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (g == 17) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] 0 <= g [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] ((0 <= g) && (g <= 17)) && (g == 0 || g == 17) [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] ((0 <= g) && (g <= 17)) && (g <= 127) [2024-01-29 23:21:31,210 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] ((0 <= g) && (g <= 17)) && (g % 17 == 0) [2024-01-29 23:21:31,211 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] g == 0 [2024-01-29 23:21:31,211 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] ((0 <= g) && (g <= 127)) && (g == 0 || g == 17) [2024-01-29 23:21:31,211 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (0 <= g) && (g <= 127) [2024-01-29 23:21:31,211 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] ((0 <= g) && (g <= 127)) && (g % 17 == 0) [2024-01-29 23:21:31,211 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 0 <= g [2024-01-29 23:21:31,211 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] (0 <= g) && (g <= 17) [2024-01-29 23:21:31,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:21:31,390 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/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2024-01-29 23:21:31,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:31,528 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:21:31,537 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/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2024-01-29 23:21:31,538 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 23:21:31,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:31,638 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:21:31,639 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31 WrapperNode [2024-01-29 23:21:31,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:31,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:31,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:21:31,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:21:31,645 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 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,654 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 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,669 INFO L138 Inliner]: procedures = 163, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-01-29 23:21:31,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:31,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:21:31,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:21:31,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:21:31,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,701 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 5, 5, 1]. 38 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-01-29 23:21:31,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:21:31,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:21:31,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:21:31,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:21:31,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (1/1) ... [2024-01-29 23:21:31,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:31,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:21:31,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 23:21:31,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 23:21:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:21:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:21:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:21:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 23:21:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:21:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:21:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:21:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-29 23:21:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-29 23:21:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:21:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:21:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:21:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:21:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 23:21:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:21:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:21:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:21:31,816 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 23:21:31,930 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:21:31,931 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:21:32,231 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:21:32,232 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:21:32,295 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:21:32,295 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:21:32,296 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:32 BoogieIcfgContainer [2024-01-29 23:21:32,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:21:32,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:21:32,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:21:32,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:21:32,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:21:31" (1/4) ... [2024-01-29 23:21:32,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a587d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:32, skipping insertion in model container [2024-01-29 23:21:32,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:31" (2/4) ... [2024-01-29 23:21:32,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a587d6e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:32, skipping insertion in model container [2024-01-29 23:21:32,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:31" (3/4) ... [2024-01-29 23:21:32,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a587d6e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:32, skipping insertion in model container [2024-01-29 23:21:32,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:32" (4/4) ... [2024-01-29 23:21:32,302 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-01-29 23:21:32,315 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:21:32,315 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2024-01-29 23:21:32,315 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:21:32,366 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-29 23:21:32,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 208 flow [2024-01-29 23:21:32,416 INFO L124 PetriNetUnfolderBase]: 1/101 cut-off events. [2024-01-29 23:21:32,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:32,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 1/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2024-01-29 23:21:32,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 102 transitions, 208 flow [2024-01-29 23:21:32,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 101 transitions, 205 flow [2024-01-29 23:21:32,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:21:32,434 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;@54499796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:21:32,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-01-29 23:21:32,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:21:32,436 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:21:32,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:32,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:32,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:21:32,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:32,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 8808, now seen corresponding path program 1 times [2024-01-29 23:21:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196519567] [2024-01-29 23:21:32,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:32,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196519567] [2024-01-29 23:21:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196519567] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:32,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:21:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601040505] [2024-01-29 23:21:32,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:32,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:32,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:32,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 102 [2024-01-29 23:21:32,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:32,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:32,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 102 [2024-01-29 23:21:32,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,004 INFO L124 PetriNetUnfolderBase]: 210/697 cut-off events. [2024-01-29 23:21:33,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:33,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 697 events. 210/697 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4730 event pairs, 154 based on Foata normal form. 120/790 useless extension candidates. Maximal degree in co-relation 1151. Up to 421 conditions per place. [2024-01-29 23:21:33,011 INFO L140 encePairwiseOnDemand]: 68/102 looper letters, 45 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-01-29 23:21:33,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 289 flow [2024-01-29 23:21:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-01-29 23:21:33,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7516339869281046 [2024-01-29 23:21:33,028 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 205 flow. Second operand 3 states and 230 transitions. [2024-01-29 23:21:33,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 289 flow [2024-01-29 23:21:33,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:33,040 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 226 flow [2024-01-29 23:21:33,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2024-01-29 23:21:33,046 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-29 23:21:33,046 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 226 flow [2024-01-29 23:21:33,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:33,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 23:21:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:21:33,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:33,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 262789893, now seen corresponding path program 1 times [2024-01-29 23:21:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137756625] [2024-01-29 23:21:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:33,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:33,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137756625] [2024-01-29 23:21:33,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137756625] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:33,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:33,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:33,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511737603] [2024-01-29 23:21:33,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:33,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:33,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:33,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:33,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:33,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 102 [2024-01-29 23:21:33,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:33,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:33,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 102 [2024-01-29 23:21:33,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,337 INFO L124 PetriNetUnfolderBase]: 49/367 cut-off events. [2024-01-29 23:21:33,337 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-29 23:21:33,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 367 events. 49/367 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1903 event pairs, 0 based on Foata normal form. 8/322 useless extension candidates. Maximal degree in co-relation 512. Up to 105 conditions per place. [2024-01-29 23:21:33,341 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 22 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-29 23:21:33,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 284 flow [2024-01-29 23:21:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2024-01-29 23:21:33,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2024-01-29 23:21:33,346 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 226 flow. Second operand 4 states and 354 transitions. [2024-01-29 23:21:33,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 284 flow [2024-01-29 23:21:33,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:33,350 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 222 flow [2024-01-29 23:21:33,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2024-01-29 23:21:33,351 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2024-01-29 23:21:33,351 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 222 flow [2024-01-29 23:21:33,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:33,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:21:33,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:33,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1456983946, now seen corresponding path program 1 times [2024-01-29 23:21:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415623334] [2024-01-29 23:21:33,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:33,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415623334] [2024-01-29 23:21:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415623334] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627411630] [2024-01-29 23:21:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:33,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:33,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 102 [2024-01-29 23:21:33,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:33,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:33,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 102 [2024-01-29 23:21:33,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,631 INFO L124 PetriNetUnfolderBase]: 238/724 cut-off events. [2024-01-29 23:21:33,631 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2024-01-29 23:21:33,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 724 events. 238/724 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4532 event pairs, 147 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 1414. Up to 421 conditions per place. [2024-01-29 23:21:33,634 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 55 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2024-01-29 23:21:33,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 99 transitions, 362 flow [2024-01-29 23:21:33,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2024-01-29 23:21:33,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2024-01-29 23:21:33,636 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 222 flow. Second operand 4 states and 228 transitions. [2024-01-29 23:21:33,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 99 transitions, 362 flow [2024-01-29 23:21:33,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 99 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:33,638 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 221 flow [2024-01-29 23:21:33,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2024-01-29 23:21:33,639 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -11 predicate places. [2024-01-29 23:21:33,639 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 221 flow [2024-01-29 23:21:33,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:33,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:21:33,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:33,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1206681078, now seen corresponding path program 1 times [2024-01-29 23:21:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713495547] [2024-01-29 23:21:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713495547] [2024-01-29 23:21:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713495547] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:33,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:33,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605721766] [2024-01-29 23:21:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:33,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:33,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:33,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:33,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 102 [2024-01-29 23:21:33,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:33,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:33,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 102 [2024-01-29 23:21:33,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,918 INFO L124 PetriNetUnfolderBase]: 98/372 cut-off events. [2024-01-29 23:21:33,919 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-01-29 23:21:33,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 372 events. 98/372 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1908 event pairs, 7 based on Foata normal form. 160/526 useless extension candidates. Maximal degree in co-relation 618. Up to 120 conditions per place. [2024-01-29 23:21:33,920 INFO L140 encePairwiseOnDemand]: 76/102 looper letters, 30 selfloop transitions, 2 changer transitions 10/75 dead transitions. [2024-01-29 23:21:33,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 237 flow [2024-01-29 23:21:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2024-01-29 23:21:33,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343137254901961 [2024-01-29 23:21:33,922 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 221 flow. Second operand 4 states and 218 transitions. [2024-01-29 23:21:33,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 237 flow [2024-01-29 23:21:33,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 229 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:33,924 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 117 flow [2024-01-29 23:21:33,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-01-29 23:21:33,925 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -36 predicate places. [2024-01-29 23:21:33,926 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 117 flow [2024-01-29 23:21:33,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:33,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:21:33,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:33,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2137343101, now seen corresponding path program 1 times [2024-01-29 23:21:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551570953] [2024-01-29 23:21:33,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:34,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551570953] [2024-01-29 23:21:34,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551570953] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:34,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:34,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195415877] [2024-01-29 23:21:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:34,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:34,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:34,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 102 [2024-01-29 23:21:34,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:34,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:34,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 102 [2024-01-29 23:21:34,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:34,192 INFO L124 PetriNetUnfolderBase]: 74/257 cut-off events. [2024-01-29 23:21:34,193 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 23:21:34,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 257 events. 74/257 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1061 event pairs, 22 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 429. Up to 103 conditions per place. [2024-01-29 23:21:34,194 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 21 selfloop transitions, 2 changer transitions 14/72 dead transitions. [2024-01-29 23:21:34,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 227 flow [2024-01-29 23:21:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2024-01-29 23:21:34,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470588235294118 [2024-01-29 23:21:34,195 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 117 flow. Second operand 5 states and 279 transitions. [2024-01-29 23:21:34,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 227 flow [2024-01-29 23:21:34,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:34,197 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 124 flow [2024-01-29 23:21:34,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-01-29 23:21:34,199 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-01-29 23:21:34,199 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 124 flow [2024-01-29 23:21:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:34,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:34,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:34,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:21:34,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:34,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2252973, now seen corresponding path program 1 times [2024-01-29 23:21:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:34,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812995382] [2024-01-29 23:21:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:34,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:34,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812995382] [2024-01-29 23:21:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812995382] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:34,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195622651] [2024-01-29 23:21:34,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:34,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:34,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:34,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 102 [2024-01-29 23:21:34,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:34,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:34,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 102 [2024-01-29 23:21:34,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:34,356 INFO L124 PetriNetUnfolderBase]: 13/159 cut-off events. [2024-01-29 23:21:34,356 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-29 23:21:34,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 159 events. 13/159 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 5 based on Foata normal form. 6/163 useless extension candidates. Maximal degree in co-relation 218. Up to 27 conditions per place. [2024-01-29 23:21:34,357 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 12 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-01-29 23:21:34,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 166 flow [2024-01-29 23:21:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2024-01-29 23:21:34,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8799019607843137 [2024-01-29 23:21:34,359 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 124 flow. Second operand 4 states and 359 transitions. [2024-01-29 23:21:34,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 166 flow [2024-01-29 23:21:34,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 158 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:34,360 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 126 flow [2024-01-29 23:21:34,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-01-29 23:21:34,361 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2024-01-29 23:21:34,361 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 126 flow [2024-01-29 23:21:34,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:34,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:34,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:34,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:21:34,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:34,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:34,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1099164685, now seen corresponding path program 2 times [2024-01-29 23:21:34,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:34,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326177959] [2024-01-29 23:21:34,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:34,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:34,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326177959] [2024-01-29 23:21:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326177959] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:34,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:34,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264883640] [2024-01-29 23:21:34,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:34,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:34,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:34,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 102 [2024-01-29 23:21:34,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:34,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:34,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 102 [2024-01-29 23:21:34,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:34,539 INFO L124 PetriNetUnfolderBase]: 10/129 cut-off events. [2024-01-29 23:21:34,539 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-01-29 23:21:34,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 129 events. 10/129 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 213 event pairs, 5 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 179. Up to 20 conditions per place. [2024-01-29 23:21:34,540 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 12 selfloop transitions, 4 changer transitions 1/57 dead transitions. [2024-01-29 23:21:34,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 168 flow [2024-01-29 23:21:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2024-01-29 23:21:34,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2024-01-29 23:21:34,542 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 126 flow. Second operand 4 states and 358 transitions. [2024-01-29 23:21:34,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 168 flow [2024-01-29 23:21:34,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:34,543 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 129 flow [2024-01-29 23:21:34,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-01-29 23:21:34,544 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2024-01-29 23:21:34,544 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 129 flow [2024-01-29 23:21:34,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:34,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:34,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:21:34,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-29 23:21:34,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2113212024, now seen corresponding path program 1 times [2024-01-29 23:21:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380620325] [2024-01-29 23:21:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:34,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:21:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:34,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:21:34,588 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:21:34,589 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (58 of 59 remaining) [2024-01-29 23:21:34,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 59 remaining) [2024-01-29 23:21:34,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 59 remaining) [2024-01-29 23:21:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 59 remaining) [2024-01-29 23:21:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 59 remaining) [2024-01-29 23:21:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 59 remaining) [2024-01-29 23:21:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 59 remaining) [2024-01-29 23:21:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 59 remaining) [2024-01-29 23:21:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 59 remaining) [2024-01-29 23:21:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 59 remaining) [2024-01-29 23:21:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 59 remaining) [2024-01-29 23:21:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 59 remaining) [2024-01-29 23:21:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 59 remaining) [2024-01-29 23:21:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 59 remaining) [2024-01-29 23:21:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 59 remaining) [2024-01-29 23:21:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 59 remaining) [2024-01-29 23:21:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 59 remaining) [2024-01-29 23:21:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 59 remaining) [2024-01-29 23:21:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 59 remaining) [2024-01-29 23:21:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 59 remaining) [2024-01-29 23:21:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 59 remaining) [2024-01-29 23:21:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 59 remaining) [2024-01-29 23:21:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 59 remaining) [2024-01-29 23:21:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 59 remaining) [2024-01-29 23:21:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 59 remaining) [2024-01-29 23:21:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 59 remaining) [2024-01-29 23:21:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 59 remaining) [2024-01-29 23:21:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 59 remaining) [2024-01-29 23:21:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 59 remaining) [2024-01-29 23:21:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 59 remaining) [2024-01-29 23:21:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 59 remaining) [2024-01-29 23:21:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 59 remaining) [2024-01-29 23:21:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 59 remaining) [2024-01-29 23:21:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 59 remaining) [2024-01-29 23:21:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 59 remaining) [2024-01-29 23:21:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 59 remaining) [2024-01-29 23:21:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 59 remaining) [2024-01-29 23:21:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 59 remaining) [2024-01-29 23:21:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 59 remaining) [2024-01-29 23:21:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 59 remaining) [2024-01-29 23:21:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 59 remaining) [2024-01-29 23:21:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 59 remaining) [2024-01-29 23:21:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 59 remaining) [2024-01-29 23:21:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 59 remaining) [2024-01-29 23:21:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 59 remaining) [2024-01-29 23:21:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 59 remaining) [2024-01-29 23:21:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 59 remaining) [2024-01-29 23:21:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 59 remaining) [2024-01-29 23:21:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 59 remaining) [2024-01-29 23:21:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 59 remaining) [2024-01-29 23:21:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 59 remaining) [2024-01-29 23:21:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 59 remaining) [2024-01-29 23:21:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 59 remaining) [2024-01-29 23:21:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 59 remaining) [2024-01-29 23:21:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 59 remaining) [2024-01-29 23:21:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 59 remaining) [2024-01-29 23:21:34,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 59 remaining) [2024-01-29 23:21:34,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 59 remaining) [2024-01-29 23:21:34,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 59 remaining) [2024-01-29 23:21:34,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:21:34,599 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:34,604 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:21:34,604 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:21:34,631 INFO L503 ceAbstractionStarter]: Automizer considered 39 witness invariants [2024-01-29 23:21:34,632 INFO L504 ceAbstractionStarter]: WitnessConsidered=39 [2024-01-29 23:21:34,632 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:21:34 BasicIcfg [2024-01-29 23:21:34,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:21:34,633 INFO L158 Benchmark]: Toolchain (without parser) took 3481.76ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 96.5MB in the beginning and 126.9MB in the end (delta: -30.4MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,633 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:34,633 INFO L158 Benchmark]: Witness Parser took 0.22ms. Allocated memory is still 176.2MB. Free memory was 100.8MB in the beginning and 100.7MB in the end (delta: 145.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:34,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.89ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 96.4MB in the beginning and 190.1MB in the end (delta: -93.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.66ms. Allocated memory is still 237.0MB. Free memory was 190.1MB in the beginning and 188.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,634 INFO L158 Benchmark]: Boogie Preprocessor took 58.91ms. Allocated memory is still 237.0MB. Free memory was 188.0MB in the beginning and 185.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,634 INFO L158 Benchmark]: RCFGBuilder took 566.62ms. Allocated memory is still 237.0MB. Free memory was 185.9MB in the beginning and 153.4MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,634 INFO L158 Benchmark]: TraceAbstraction took 2335.26ms. Allocated memory is still 237.0MB. Free memory was 152.4MB in the beginning and 126.9MB in the end (delta: 25.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,635 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.15ms. Allocated memory is still 176.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.22ms. Allocated memory is still 176.2MB. Free memory was 100.8MB in the beginning and 100.7MB in the end (delta: 145.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.89ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 96.4MB in the beginning and 190.1MB in the end (delta: -93.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.66ms. Allocated memory is still 237.0MB. Free memory was 190.1MB in the beginning and 188.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.91ms. Allocated memory is still 237.0MB. Free memory was 188.0MB in the beginning and 185.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 566.62ms. Allocated memory is still 237.0MB. Free memory was 185.9MB in the beginning and 153.4MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2335.26ms. Allocated memory is still 237.0MB. Free memory was 152.4MB in the beginning and 126.9MB in the end (delta: 25.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L681] 0 int g = 0; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L693] 0 pthread_t id; VAL [A={3:0}, D={4:0}, g=0, id={5:0}] [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]]]] [L694] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, D={4:0}, arg={0:0}, g=0, id={5:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] [L687] 1 g = 17 VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]],BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] [L698] CALL 0 __VERIFIER_assert(g == 0) [L19] COND TRUE 0 !(cond) VAL [A={3:0}, D={4:0}, \old(cond)=0, arg={0:0}, arg={0:0}, cond=0, g=17] [L19] 0 reach_error() VAL [A={3:0}, D={4:0}, \old(cond)=0, arg={0:0}, arg={0:0}, cond=0, g=17] - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 149 locations, 59 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: 2.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 714 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 119 mSDtfsCounter, 714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=1, InterpolantAutomatonStates: 28, 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, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 23:21:34,671 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