./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/pthread-demo-datarace-3.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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/pthread-C-DAC/pthread-demo-datarace-3.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/pthread-demo-datarace-3.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-958ec4d-m [2024-02-07 14:53:37,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:53:37,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:53:37,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:53:37,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:53:37,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:53:37,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:53:37,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:53:37,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:53:37,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:53:37,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:53:37,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:53:37,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:53:37,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:53:37,915 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:53:37,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:53:37,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:53:37,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:53:37,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:53:37,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:53:37,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:53:37,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:53:37,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:53:37,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:53:37,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:53:37,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:53:37,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:53:37,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:53:37,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:53:37,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:53:37,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:53:37,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:53:37,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:53:37,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:53:37,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:53:37,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:53:37,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:53:37,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:53:37,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:53:37,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:53:37,922 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:53:37,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:53:37,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:53:37,922 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 14:53:38,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:53:38,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:53:38,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:53:38,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:53:38,112 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:53:38,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-02-07 14:53:39,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:53:39,405 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:53:39,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-02-07 14:53:39,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f066e3792/b8a13511d7064915ad4b0fe4b10fb885/FLAGd40c54675 [2024-02-07 14:53:39,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f066e3792/b8a13511d7064915ad4b0fe4b10fb885 [2024-02-07 14:53:39,439 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:53:39,439 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:53:39,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/pthread-demo-datarace-3.yml/witness.yml [2024-02-07 14:53:39,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:53:39,489 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:53:39,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:53:39,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:53:39,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:53:39,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:53:39" (1/2) ... [2024-02-07 14:53:39,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697f9a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:53:39, skipping insertion in model container [2024-02-07 14:53:39,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:53:39" (1/2) ... [2024-02-07 14:53:39,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@fdcdc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:53:39, skipping insertion in model container [2024-02-07 14:53:39,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:53:39" (2/2) ... [2024-02-07 14:53:39,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697f9a93 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:39, skipping insertion in model container [2024-02-07 14:53:39,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:53:39" (2/2) ... [2024-02-07 14:53:39,496 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:53:39,529 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:53:39,530 INFO L76 edCorrectnessWitness]: Location invariant before [L1334-L1334] 1 <= myglobal [2024-02-07 14:53:39,530 INFO L76 edCorrectnessWitness]: Location invariant before [L1333-L1333] 1 <= j [2024-02-07 14:53:39,530 INFO L76 edCorrectnessWitness]: Location invariant before [L1362-L1362] 0 <= myglobal [2024-02-07 14:53:39,531 INFO L76 edCorrectnessWitness]: Location invariant before [L1329-L1329] 0 <= j [2024-02-07 14:53:39,531 INFO L76 edCorrectnessWitness]: Location invariant before [L1363-L1363] 0 <= myglobal [2024-02-07 14:53:39,531 INFO L76 edCorrectnessWitness]: Location invariant before [L1356-L1356] 1 <= myglobal [2024-02-07 14:53:39,531 INFO L76 edCorrectnessWitness]: Location invariant before [L1330-L1330] 0 <= j [2024-02-07 14:53:39,531 INFO L76 edCorrectnessWitness]: Location invariant before [L1355-L1355] 0 <= myglobal [2024-02-07 14:53:39,531 INFO L76 edCorrectnessWitness]: Location invariant before [L1331-L1331] 1 <= j [2024-02-07 14:53:39,531 INFO L76 edCorrectnessWitness]: Location invariant before [L1328-L1328] 0 <= myglobal [2024-02-07 14:53:39,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:53:39,677 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-02-07 14:53:39,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:53:39,909 INFO L203 MainTranslator]: Completed pre-run [2024-02-07 14:53:39,918 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:53:39,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:53:40,083 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:53:40,087 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40 WrapperNode [2024-02-07 14:53:40,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:53:40,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:53:40,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:53:40,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:53:40,095 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 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,120 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 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,135 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-02-07 14:53:40,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:53:40,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:53:40,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:53:40,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:53:40,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,156 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-02-07 14:53:40,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:53:40,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:53:40,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:53:40,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:53:40,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (1/1) ... [2024-02-07 14:53:40,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:53:40,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:53:40,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 14:53:40,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 14:53:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:53:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:53:40,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:53:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:53:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:53:40,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:53:40,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-02-07 14:53:40,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-02-07 14:53:40,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:53:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:53:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:53:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:53:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:53:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:53:40,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:53:40,282 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:53:40,383 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:53:40,385 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:53:40,500 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:53:40,501 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:53:40,574 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:53:40,574 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-07 14:53:40,575 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:53:40 BoogieIcfgContainer [2024-02-07 14:53:40,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:53:40,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:53:40,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:53:40,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:53:40,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:53:39" (1/4) ... [2024-02-07 14:53:40,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88192d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:53:40, skipping insertion in model container [2024-02-07 14:53:40,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:53:39" (2/4) ... [2024-02-07 14:53:40,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88192d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:53:40, skipping insertion in model container [2024-02-07 14:53:40,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:53:40" (3/4) ... [2024-02-07 14:53:40,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a88192d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:53:40, skipping insertion in model container [2024-02-07 14:53:40,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:53:40" (4/4) ... [2024-02-07 14:53:40,581 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-02-07 14:53:40,595 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:53:40,596 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-02-07 14:53:40,596 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:53:40,637 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-07 14:53:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 77 flow [2024-02-07 14:53:40,705 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2024-02-07 14:53:40,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 14:53:40,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 34 events. 3/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-02-07 14:53:40,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 77 flow [2024-02-07 14:53:40,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 72 flow [2024-02-07 14:53:40,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:53:40,731 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;@25f60787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:53:40,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-02-07 14:53:40,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:53:40,738 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-02-07 14:53:40,738 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 14:53:40,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:40,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 14:53:40,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:40,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash 273530980, now seen corresponding path program 1 times [2024-02-07 14:53:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:40,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380179671] [2024-02-07 14:53:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380179671] [2024-02-07 14:53:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380179671] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:53:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:53:41,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:53:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52440644] [2024-02-07 14:53:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:53:41,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:53:41,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:41,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:53:41,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:53:41,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-07 14:53:41,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:41,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-07 14:53:41,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:41,179 INFO L124 PetriNetUnfolderBase]: 66/166 cut-off events. [2024-02-07 14:53:41,180 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 14:53:41,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 166 events. 66/166 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 654 event pairs, 15 based on Foata normal form. 3/142 useless extension candidates. Maximal degree in co-relation 278. Up to 105 conditions per place. [2024-02-07 14:53:41,182 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 32 selfloop transitions, 3 changer transitions 1/43 dead transitions. [2024-02-07 14:53:41,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 167 flow [2024-02-07 14:53:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:53:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:53:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-02-07 14:53:41,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-02-07 14:53:41,193 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 72 flow. Second operand 3 states and 72 transitions. [2024-02-07 14:53:41,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 167 flow [2024-02-07 14:53:41,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:53:41,196 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 85 flow [2024-02-07 14:53:41,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-02-07 14:53:41,200 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2024-02-07 14:53:41,201 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 85 flow [2024-02-07 14:53:41,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:41,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:53:41,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:53:41,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread_function_dataraceErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:41,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash -109486408, now seen corresponding path program 1 times [2024-02-07 14:53:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:41,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633169430] [2024-02-07 14:53:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:41,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633169430] [2024-02-07 14:53:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633169430] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:53:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:53:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:53:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445313117] [2024-02-07 14:53:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:53:41,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:53:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:53:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:53:41,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 14:53:41,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:41,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 14:53:41,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:41,306 INFO L124 PetriNetUnfolderBase]: 78/201 cut-off events. [2024-02-07 14:53:41,306 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-07 14:53:41,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 201 events. 78/201 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 840 event pairs, 18 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 194. Up to 115 conditions per place. [2024-02-07 14:53:41,308 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 34 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2024-02-07 14:53:41,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 189 flow [2024-02-07 14:53:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:53:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:53:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-02-07 14:53:41,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-07 14:53:41,310 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 85 flow. Second operand 3 states and 60 transitions. [2024-02-07 14:53:41,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 189 flow [2024-02-07 14:53:41,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:53:41,311 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 87 flow [2024-02-07 14:53:41,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2024-02-07 14:53:41,312 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2024-02-07 14:53:41,313 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 87 flow [2024-02-07 14:53:41,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:41,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:41,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:53:41,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread_function_dataraceErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:41,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash 900888949, now seen corresponding path program 1 times [2024-02-07 14:53:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875651135] [2024-02-07 14:53:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875651135] [2024-02-07 14:53:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875651135] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:53:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:53:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:53:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6025328] [2024-02-07 14:53:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:53:41,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:53:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:53:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:53:41,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-07 14:53:41,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:41,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-07 14:53:41,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:41,424 INFO L124 PetriNetUnfolderBase]: 70/177 cut-off events. [2024-02-07 14:53:41,425 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-07 14:53:41,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 177 events. 70/177 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 680 event pairs, 18 based on Foata normal form. 8/169 useless extension candidates. Maximal degree in co-relation 141. Up to 79 conditions per place. [2024-02-07 14:53:41,426 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 37 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2024-02-07 14:53:41,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 214 flow [2024-02-07 14:53:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:53:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:53:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-02-07 14:53:41,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-07 14:53:41,429 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 87 flow. Second operand 4 states and 70 transitions. [2024-02-07 14:53:41,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 214 flow [2024-02-07 14:53:41,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 214 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:53:41,431 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 89 flow [2024-02-07 14:53:41,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2024-02-07 14:53:41,432 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2024-02-07 14:53:41,432 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 89 flow [2024-02-07 14:53:41,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:41,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:41,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:53:41,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:41,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1208784450, now seen corresponding path program 1 times [2024-02-07 14:53:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:41,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577942944] [2024-02-07 14:53:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:41,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577942944] [2024-02-07 14:53:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577942944] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:53:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:53:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:53:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948895714] [2024-02-07 14:53:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:53:41,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:53:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:53:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:53:41,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-07 14:53:41,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:41,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-07 14:53:41,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:41,513 INFO L124 PetriNetUnfolderBase]: 52/138 cut-off events. [2024-02-07 14:53:41,513 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-02-07 14:53:41,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 138 events. 52/138 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 475 event pairs, 10 based on Foata normal form. 11/144 useless extension candidates. Maximal degree in co-relation 139. Up to 83 conditions per place. [2024-02-07 14:53:41,515 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 27 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2024-02-07 14:53:41,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 165 flow [2024-02-07 14:53:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:53:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:53:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-02-07 14:53:41,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-02-07 14:53:41,516 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 89 flow. Second operand 3 states and 58 transitions. [2024-02-07 14:53:41,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 165 flow [2024-02-07 14:53:41,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 154 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-07 14:53:41,517 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 66 flow [2024-02-07 14:53:41,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-02-07 14:53:41,518 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2024-02-07 14:53:41,518 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 66 flow [2024-02-07 14:53:41,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:41,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:53:41,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:41,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash -368939793, now seen corresponding path program 1 times [2024-02-07 14:53:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:41,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032551344] [2024-02-07 14:53:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:41,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032551344] [2024-02-07 14:53:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032551344] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:53:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:53:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:53:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264132270] [2024-02-07 14:53:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:53:41,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:53:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:41,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:53:41,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:53:41,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-02-07 14:53:41,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:41,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-02-07 14:53:41,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:41,586 INFO L124 PetriNetUnfolderBase]: 61/147 cut-off events. [2024-02-07 14:53:41,587 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-02-07 14:53:41,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 147 events. 61/147 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 484 event pairs, 19 based on Foata normal form. 12/158 useless extension candidates. Maximal degree in co-relation 129. Up to 84 conditions per place. [2024-02-07 14:53:41,588 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-02-07 14:53:41,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 160 flow [2024-02-07 14:53:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:53:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:53:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-07 14:53:41,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-07 14:53:41,589 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 66 flow. Second operand 3 states and 56 transitions. [2024-02-07 14:53:41,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 160 flow [2024-02-07 14:53:41,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:53:41,590 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 76 flow [2024-02-07 14:53:41,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2024-02-07 14:53:41,591 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2024-02-07 14:53:41,591 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 76 flow [2024-02-07 14:53:41,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:41,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:41,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:53:41,592 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:41,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:41,592 INFO L85 PathProgramCache]: Analyzing trace with hash 871467418, now seen corresponding path program 1 times [2024-02-07 14:53:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565483272] [2024-02-07 14:53:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565483272] [2024-02-07 14:53:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565483272] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:53:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:53:41,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:53:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552163920] [2024-02-07 14:53:41,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:53:41,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:53:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:53:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:53:41,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-02-07 14:53:41,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:41,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-02-07 14:53:41,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:41,657 INFO L124 PetriNetUnfolderBase]: 73/164 cut-off events. [2024-02-07 14:53:41,657 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-02-07 14:53:41,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 164 events. 73/164 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 522 event pairs, 36 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 266. Up to 90 conditions per place. [2024-02-07 14:53:41,658 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-02-07 14:53:41,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 174 flow [2024-02-07 14:53:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:53:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:53:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-07 14:53:41,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-07 14:53:41,659 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 76 flow. Second operand 3 states and 56 transitions. [2024-02-07 14:53:41,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 174 flow [2024-02-07 14:53:41,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:53:41,661 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 86 flow [2024-02-07 14:53:41,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-02-07 14:53:41,661 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2024-02-07 14:53:41,662 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 86 flow [2024-02-07 14:53:41,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:41,662 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] [2024-02-07 14:53:41,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:53:41,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:41,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1489267869, now seen corresponding path program 1 times [2024-02-07 14:53:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:41,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76302923] [2024-02-07 14:53:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76302923] [2024-02-07 14:53:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76302923] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:53:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315474027] [2024-02-07 14:53:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:41,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:41,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:53:41,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:53:41,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 14:53:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:41,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:53:41,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:53:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:53:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:53:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315474027] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:53:41,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:53:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-02-07 14:53:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448547319] [2024-02-07 14:53:41,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:53:41,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-07 14:53:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-07 14:53:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-02-07 14:53:41,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 14:53:41,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 86 flow. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:41,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:41,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 14:53:41,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:42,129 INFO L124 PetriNetUnfolderBase]: 217/458 cut-off events. [2024-02-07 14:53:42,130 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2024-02-07 14:53:42,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 458 events. 217/458 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1663 event pairs, 7 based on Foata normal form. 51/509 useless extension candidates. Maximal degree in co-relation 687. Up to 114 conditions per place. [2024-02-07 14:53:42,132 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 97 selfloop transitions, 33 changer transitions 0/133 dead transitions. [2024-02-07 14:53:42,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 133 transitions, 715 flow [2024-02-07 14:53:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-07 14:53:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-07 14:53:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 284 transitions. [2024-02-07 14:53:42,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-02-07 14:53:42,134 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 86 flow. Second operand 16 states and 284 transitions. [2024-02-07 14:53:42,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 133 transitions, 715 flow [2024-02-07 14:53:42,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 133 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:53:42,137 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 358 flow [2024-02-07 14:53:42,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=358, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-02-07 14:53:42,153 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2024-02-07 14:53:42,153 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 358 flow [2024-02-07 14:53:42,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:42,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:42,153 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:42,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 14:53:42,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:42,366 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:42,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash -991470669, now seen corresponding path program 2 times [2024-02-07 14:53:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:42,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798488689] [2024-02-07 14:53:42,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:42,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-02-07 14:53:42,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:42,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798488689] [2024-02-07 14:53:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798488689] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:53:42,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585292113] [2024-02-07 14:53:42,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:53:42,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:42,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:53:42,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:53:42,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-07 14:53:42,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:53:42,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:53:42,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-07 14:53:42,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:53:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-02-07 14:53:42,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:53:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-02-07 14:53:42,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585292113] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:53:42,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:53:42,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-02-07 14:53:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859443775] [2024-02-07 14:53:42,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:53:42,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-07 14:53:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-07 14:53:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-02-07 14:53:42,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 14:53:42,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 358 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:42,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:42,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 14:53:42,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:42,835 INFO L124 PetriNetUnfolderBase]: 489/1048 cut-off events. [2024-02-07 14:53:42,835 INFO L125 PetriNetUnfolderBase]: For 4576/4576 co-relation queries the response was YES. [2024-02-07 14:53:42,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1048 events. 489/1048 cut-off events. For 4576/4576 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4517 event pairs, 100 based on Foata normal form. 107/1150 useless extension candidates. Maximal degree in co-relation 3567. Up to 232 conditions per place. [2024-02-07 14:53:42,842 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 98 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2024-02-07 14:53:42,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 124 transitions, 1053 flow [2024-02-07 14:53:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-07 14:53:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-07 14:53:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-02-07 14:53:42,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2024-02-07 14:53:42,844 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 358 flow. Second operand 8 states and 151 transitions. [2024-02-07 14:53:42,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 124 transitions, 1053 flow [2024-02-07 14:53:42,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 124 transitions, 977 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-02-07 14:53:42,851 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 428 flow [2024-02-07 14:53:42,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=428, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-02-07 14:53:42,852 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2024-02-07 14:53:42,852 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 428 flow [2024-02-07 14:53:42,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:42,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:42,853 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:42,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-07 14:53:43,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-02-07 14:53:43,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:43,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1476926193, now seen corresponding path program 3 times [2024-02-07 14:53:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:43,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848567155] [2024-02-07 14:53:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-02-07 14:53:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848567155] [2024-02-07 14:53:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848567155] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:53:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295993770] [2024-02-07 14:53:43,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:53:43,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:43,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:53:43,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:53:43,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-07 14:53:43,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-02-07 14:53:43,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:53:43,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-07 14:53:43,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:53:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-07 14:53:43,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:53:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-07 14:53:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295993770] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:53:43,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:53:43,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-02-07 14:53:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321435143] [2024-02-07 14:53:43,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:53:43,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-07 14:53:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-07 14:53:43,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-02-07 14:53:43,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 14:53:43,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 428 flow. Second operand has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:43,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:43,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 14:53:43,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:44,990 INFO L124 PetriNetUnfolderBase]: 1135/2333 cut-off events. [2024-02-07 14:53:44,990 INFO L125 PetriNetUnfolderBase]: For 26378/26378 co-relation queries the response was YES. [2024-02-07 14:53:44,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10971 conditions, 2333 events. 1135/2333 cut-off events. For 26378/26378 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11543 event pairs, 7 based on Foata normal form. 171/2504 useless extension candidates. Maximal degree in co-relation 9827. Up to 685 conditions per place. [2024-02-07 14:53:45,007 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 527 selfloop transitions, 202 changer transitions 0/733 dead transitions. [2024-02-07 14:53:45,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 733 transitions, 6026 flow [2024-02-07 14:53:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-02-07 14:53:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2024-02-07 14:53:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 1567 transitions. [2024-02-07 14:53:45,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030497592295345 [2024-02-07 14:53:45,012 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 428 flow. Second operand 89 states and 1567 transitions. [2024-02-07 14:53:45,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 733 transitions, 6026 flow [2024-02-07 14:53:45,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 733 transitions, 5694 flow, removed 132 selfloop flow, removed 2 redundant places. [2024-02-07 14:53:45,036 INFO L231 Difference]: Finished difference. Result has 214 places, 236 transitions, 2886 flow [2024-02-07 14:53:45,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=2886, PETRI_PLACES=214, PETRI_TRANSITIONS=236} [2024-02-07 14:53:45,037 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 180 predicate places. [2024-02-07 14:53:45,037 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 236 transitions, 2886 flow [2024-02-07 14:53:45,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:45,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:45,038 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:45,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-07 14:53:45,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:45,250 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:45,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1761729010, now seen corresponding path program 4 times [2024-02-07 14:53:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:45,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559277350] [2024-02-07 14:53:45,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:45,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-02-07 14:53:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559277350] [2024-02-07 14:53:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559277350] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:53:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543733287] [2024-02-07 14:53:45,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-07 14:53:45,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:45,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:53:45,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:53:45,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-07 14:53:45,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-07 14:53:45,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:53:45,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:53:45,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:53:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-02-07 14:53:45,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:53:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 10 proven. 70 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-02-07 14:53:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543733287] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:53:45,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:53:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-02-07 14:53:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306081178] [2024-02-07 14:53:45,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:53:45,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-07 14:53:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:45,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-07 14:53:45,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2024-02-07 14:53:45,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 14:53:45,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 236 transitions, 2886 flow. Second operand has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:45,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:45,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 14:53:45,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:47,155 INFO L124 PetriNetUnfolderBase]: 2766/5950 cut-off events. [2024-02-07 14:53:47,155 INFO L125 PetriNetUnfolderBase]: For 216657/216657 co-relation queries the response was YES. [2024-02-07 14:53:47,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30688 conditions, 5950 events. 2766/5950 cut-off events. For 216657/216657 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 33051 event pairs, 420 based on Foata normal form. 567/6503 useless extension candidates. Maximal degree in co-relation 27488. Up to 1364 conditions per place. [2024-02-07 14:53:47,226 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 330 selfloop transitions, 206 changer transitions 0/550 dead transitions. [2024-02-07 14:53:47,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 550 transitions, 8573 flow [2024-02-07 14:53:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-07 14:53:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-07 14:53:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 346 transitions. [2024-02-07 14:53:47,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5492063492063493 [2024-02-07 14:53:47,228 INFO L175 Difference]: Start difference. First operand has 214 places, 236 transitions, 2886 flow. Second operand 18 states and 346 transitions. [2024-02-07 14:53:47,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 550 transitions, 8573 flow [2024-02-07 14:53:47,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 550 transitions, 8011 flow, removed 185 selfloop flow, removed 12 redundant places. [2024-02-07 14:53:47,796 INFO L231 Difference]: Finished difference. Result has 229 places, 325 transitions, 4452 flow [2024-02-07 14:53:47,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4452, PETRI_PLACES=229, PETRI_TRANSITIONS=325} [2024-02-07 14:53:47,797 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 195 predicate places. [2024-02-07 14:53:47,797 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 325 transitions, 4452 flow [2024-02-07 14:53:47,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:47,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:47,798 INFO L208 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:47,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-07 14:53:48,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:48,010 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:48,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:48,011 INFO L85 PathProgramCache]: Analyzing trace with hash -67718733, now seen corresponding path program 5 times [2024-02-07 14:53:48,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:48,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574682113] [2024-02-07 14:53:48,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 70 proven. 376 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-02-07 14:53:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574682113] [2024-02-07 14:53:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574682113] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:53:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626717197] [2024-02-07 14:53:48,316 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-07 14:53:48,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:48,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:53:48,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:53:48,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-07 14:53:48,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-02-07 14:53:48,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:53:48,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 18 conjunts are in the unsatisfiable core [2024-02-07 14:53:48,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:53:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 70 proven. 376 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-02-07 14:53:48,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:53:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 70 proven. 376 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-02-07 14:53:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626717197] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:53:48,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:53:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-02-07 14:53:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607754602] [2024-02-07 14:53:48,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:53:48,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-07 14:53:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-07 14:53:48,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-02-07 14:53:48,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 14:53:48,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 325 transitions, 4452 flow. Second operand has 23 states, 23 states have (on average 12.826086956521738) internal successors, (295), 23 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:48,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:48,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 14:53:48,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:50,779 INFO L124 PetriNetUnfolderBase]: 3399/7333 cut-off events. [2024-02-07 14:53:50,780 INFO L125 PetriNetUnfolderBase]: For 263486/263486 co-relation queries the response was YES. [2024-02-07 14:53:50,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39959 conditions, 7333 events. 3399/7333 cut-off events. For 263486/263486 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 41959 event pairs, 583 based on Foata normal form. 252/7567 useless extension candidates. Maximal degree in co-relation 35575. Up to 1691 conditions per place. [2024-02-07 14:53:50,993 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 406 selfloop transitions, 250 changer transitions 0/670 dead transitions. [2024-02-07 14:53:50,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 670 transitions, 10785 flow [2024-02-07 14:53:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-02-07 14:53:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-02-07 14:53:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 417 transitions. [2024-02-07 14:53:50,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5415584415584416 [2024-02-07 14:53:50,998 INFO L175 Difference]: Start difference. First operand has 229 places, 325 transitions, 4452 flow. Second operand 22 states and 417 transitions. [2024-02-07 14:53:50,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 670 transitions, 10785 flow [2024-02-07 14:53:51,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 670 transitions, 10601 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-02-07 14:53:51,918 INFO L231 Difference]: Finished difference. Result has 248 places, 370 transitions, 5786 flow [2024-02-07 14:53:51,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4268, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5786, PETRI_PLACES=248, PETRI_TRANSITIONS=370} [2024-02-07 14:53:51,920 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 214 predicate places. [2024-02-07 14:53:51,920 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 370 transitions, 5786 flow [2024-02-07 14:53:51,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.826086956521738) internal successors, (295), 23 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:51,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:51,921 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:51,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-02-07 14:53:52,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-07 14:53:52,135 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:52,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -378293399, now seen corresponding path program 6 times [2024-02-07 14:53:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756209099] [2024-02-07 14:53:52,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:53:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 20 proven. 280 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-02-07 14:53:52,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:53:52,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756209099] [2024-02-07 14:53:52,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756209099] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:53:52,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852365494] [2024-02-07 14:53:52,415 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-07 14:53:52,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:52,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:53:52,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:53:52,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-07 14:53:52,539 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-02-07 14:53:52,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:53:52,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-07 14:53:52,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:53:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 20 proven. 280 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-02-07 14:53:52,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:53:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 20 proven. 280 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-02-07 14:53:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852365494] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:53:52,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:53:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-02-07 14:53:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533236683] [2024-02-07 14:53:52,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:53:52,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-07 14:53:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:53:52,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-07 14:53:52,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-02-07 14:53:52,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 14:53:52,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 370 transitions, 5786 flow. Second operand has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:52,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:53:52,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 14:53:52,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:53:55,830 INFO L124 PetriNetUnfolderBase]: 5169/10539 cut-off events. [2024-02-07 14:53:55,830 INFO L125 PetriNetUnfolderBase]: For 919810/919810 co-relation queries the response was YES. [2024-02-07 14:53:55,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61701 conditions, 10539 events. 5169/10539 cut-off events. For 919810/919810 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 66999 event pairs, 137 based on Foata normal form. 430/10969 useless extension candidates. Maximal degree in co-relation 57414. Up to 3321 conditions per place. [2024-02-07 14:53:55,944 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 902 selfloop transitions, 176 changer transitions 0/1084 dead transitions. [2024-02-07 14:53:55,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1084 transitions, 19666 flow [2024-02-07 14:53:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-02-07 14:53:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-02-07 14:53:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 420 transitions. [2024-02-07 14:53:55,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-02-07 14:53:55,945 INFO L175 Difference]: Start difference. First operand has 248 places, 370 transitions, 5786 flow. Second operand 22 states and 420 transitions. [2024-02-07 14:53:55,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1084 transitions, 19666 flow [2024-02-07 14:53:57,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1084 transitions, 18706 flow, removed 0 selfloop flow, removed 15 redundant places. [2024-02-07 14:53:57,180 INFO L231 Difference]: Finished difference. Result has 265 places, 458 transitions, 6886 flow [2024-02-07 14:53:57,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5426, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6886, PETRI_PLACES=265, PETRI_TRANSITIONS=458} [2024-02-07 14:53:57,181 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 231 predicate places. [2024-02-07 14:53:57,181 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 458 transitions, 6886 flow [2024-02-07 14:53:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:53:57,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:53:57,182 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:57,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-07 14:53:57,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:53:57,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 15 more)] === [2024-02-07 14:53:57,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:53:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 198789553, now seen corresponding path program 7 times [2024-02-07 14:53:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:53:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749369311] [2024-02-07 14:53:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:53:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:53:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:53:57,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:53:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:53:57,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:53:57,606 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:53:57,607 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-02-07 14:53:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 18 remaining) [2024-02-07 14:53:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 18 remaining) [2024-02-07 14:53:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 18 remaining) [2024-02-07 14:53:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 18 remaining) [2024-02-07 14:53:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 18 remaining) [2024-02-07 14:53:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 18 remaining) [2024-02-07 14:53:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 18 remaining) [2024-02-07 14:53:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 18 remaining) [2024-02-07 14:53:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 18 remaining) [2024-02-07 14:53:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 18 remaining) [2024-02-07 14:53:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 18 remaining) [2024-02-07 14:53:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 18 remaining) [2024-02-07 14:53:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 18 remaining) [2024-02-07 14:53:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 18 remaining) [2024-02-07 14:53:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 18 remaining) [2024-02-07 14:53:57,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 18 remaining) [2024-02-07 14:53:57,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 18 remaining) [2024-02-07 14:53:57,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:53:57,615 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2024-02-07 14:53:57,620 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:53:57,620 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:53:57,753 INFO L503 ceAbstractionStarter]: Automizer considered 10 witness invariants [2024-02-07 14:53:57,753 INFO L504 ceAbstractionStarter]: WitnessConsidered=10 [2024-02-07 14:53:57,754 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:53:57 BasicIcfg [2024-02-07 14:53:57,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:53:57,754 INFO L158 Benchmark]: Toolchain (without parser) took 18265.63ms. Allocated memory was 169.9MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 89.8MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 503.3MB. Max. memory is 16.1GB. [2024-02-07 14:53:57,754 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory was 126.9MB in the beginning and 126.8MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:53:57,754 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:53:57,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.57ms. Allocated memory is still 169.9MB. Free memory was 89.6MB in the beginning and 125.5MB in the end (delta: -35.9MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2024-02-07 14:53:57,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.06ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:53:57,755 INFO L158 Benchmark]: Boogie Preprocessor took 35.68ms. Allocated memory is still 169.9MB. Free memory was 123.4MB in the beginning and 120.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 14:53:57,755 INFO L158 Benchmark]: RCFGBuilder took 402.54ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 96.1MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-07 14:53:57,756 INFO L158 Benchmark]: TraceAbstraction took 17177.28ms. Allocated memory was 169.9MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 95.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 507.1MB. Max. memory is 16.1GB. [2024-02-07 14:53:57,757 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.16ms. Allocated memory is still 169.9MB. Free memory was 126.9MB in the beginning and 126.8MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.57ms. Allocated memory is still 169.9MB. Free memory was 89.6MB in the beginning and 125.5MB in the end (delta: -35.9MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.06ms. Allocated memory is still 169.9MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.68ms. Allocated memory is still 169.9MB. Free memory was 123.4MB in the beginning and 120.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 402.54ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 96.1MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17177.28ms. Allocated memory was 169.9MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 95.0MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 507.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [arg={0:0}, myglobal=0, mythread={3:0}] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=0, myglobal=1, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=1, myglobal=2, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=2, myglobal=3, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=3, myglobal=4, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=4, myglobal=5, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=5, myglobal=6, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=6, myglobal=7, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, i=7, myglobal=8, mythread={3:0}] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=8] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=0, j=8, myglobal=8] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=0, j=9, myglobal=8] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=0, j=9, myglobal=9] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=1, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=1, j=9, myglobal=9] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=1, j=9, myglobal=9] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=1, j=10, myglobal=9] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=1, j=10, myglobal=10] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=2, j=10, myglobal=10] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=2, j=10, myglobal=10] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=2, j=10, myglobal=10] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=2, j=11, myglobal=10] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=2, j=11, myglobal=11] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=3, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=3, j=11, myglobal=11] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=3, j=11, myglobal=11] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=3, j=12, myglobal=11] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=3, j=12, myglobal=12] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=4, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=4, j=12, myglobal=12] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=4, j=12, myglobal=12] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=4, j=13, myglobal=12] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=4, j=13, myglobal=13] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=5, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=5, j=13, myglobal=13] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=5, j=13, myglobal=13] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=5, j=14, myglobal=13] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=5, j=14, myglobal=14] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=6, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=6, j=14, myglobal=14] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=6, j=14, myglobal=14] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=6, j=15, myglobal=14] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=6, j=15, myglobal=15] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=7, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=7, j=15, myglobal=15] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=7, j=15, myglobal=15] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=7, j=16, myglobal=15] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=7, j=16, myglobal=16] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=8, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=8, j=16, myglobal=16] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=8, j=16, myglobal=16] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=8, j=17, myglobal=16] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=8, j=17, myglobal=17] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=9, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=9, j=17, myglobal=17] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=9, j=17, myglobal=17] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=9, j=18, myglobal=17] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=9, j=18, myglobal=18] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=10, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=10, j=18, myglobal=18] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=10, j=18, myglobal=18] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=10, j=19, myglobal=18] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=10, j=19, myglobal=19] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=11, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=11, j=19, myglobal=19] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=11, j=19, myglobal=19] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=11, j=20, myglobal=19] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=11, j=20, myglobal=20] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=12, j=20, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=12, j=20, myglobal=20] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=12, j=20, myglobal=20] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=12, j=21, myglobal=20] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=12, j=21, myglobal=21] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=13, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=13, j=21, myglobal=21] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=13, j=21, myglobal=21] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=13, j=22, myglobal=21] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=13, j=22, myglobal=22] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=14, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=14, j=22, myglobal=22] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=14, j=22, myglobal=22] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=14, j=23, myglobal=22] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=14, j=23, myglobal=23] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=15, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=15, j=23, myglobal=23] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=15, j=23, myglobal=23] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=15, j=24, myglobal=23] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=15, j=24, myglobal=24] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=16, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=16, j=24, myglobal=24] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=16, j=24, myglobal=24] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=16, j=25, myglobal=24] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=16, j=25, myglobal=25] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=17, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=17, j=25, myglobal=25] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=17, j=25, myglobal=25] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=17, j=26, myglobal=25] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=17, j=26, myglobal=26] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=18, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=18, j=26, myglobal=26] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=18, j=26, myglobal=26] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=18, j=27, myglobal=26] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=18, j=27, myglobal=27] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=19, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=19, j=27, myglobal=27] [L1328] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1328] 1 j=myglobal [L1329] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] VAL [arg={0:0}, arg={0:0}, i=19, j=27, myglobal=27] [L1330] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[j]]]] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=19, j=28, myglobal=27] [L1331] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[j]]]] [L1333] 1 myglobal=j [L1334] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=19, j=28, myglobal=28] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=20, j=28, myglobal=28] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=20, i=8, j=28, myglobal=28, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=20, i=8, j=28, myglobal=28, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=20, i=8, j=28, myglobal=29, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=20, i=9, j=28, myglobal=29, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=20, i=9, j=28, myglobal=29, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=20, i=9, j=28, myglobal=30, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=10, i=20, j=28, myglobal=30, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=10, i=20, j=28, myglobal=30, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=10, i=20, j=28, myglobal=31, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=11, i=20, j=28, myglobal=31, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=11, i=20, j=28, myglobal=31, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=11, i=20, j=28, myglobal=32, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=12, i=20, j=28, myglobal=32, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=12, i=20, j=28, myglobal=32, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=12, i=20, j=28, myglobal=33, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=13, i=20, j=28, myglobal=33, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=13, i=20, j=28, myglobal=33, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=13, i=20, j=28, myglobal=34, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=14, i=20, j=28, myglobal=34, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=14, i=20, j=28, myglobal=34, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=14, i=20, j=28, myglobal=35, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=15, i=20, j=28, myglobal=35, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=15, i=20, j=28, myglobal=35, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=15, i=20, j=28, myglobal=36, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=16, i=20, j=28, myglobal=36, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=16, i=20, j=28, myglobal=36, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=16, i=20, j=28, myglobal=37, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=17, i=20, j=28, myglobal=37, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=17, i=20, j=28, myglobal=37, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=17, i=20, j=28, myglobal=38, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=18, i=20, j=28, myglobal=38, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=18, i=20, j=28, myglobal=38, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=18, i=20, j=28, myglobal=39, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=19, i=20, j=28, myglobal=39, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, arg={0:0}, i=19, i=20, j=28, myglobal=39, mythread={3:0}] [L1355] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1355] 0 myglobal=myglobal+1 [L1356] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[myglobal]]]] VAL [arg={0:0}, arg={0:0}, i=19, i=20, j=28, myglobal=40, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, arg={0:0}, i=20, i=20, j=28, myglobal=40, mythread={3:0}] [L1352] COND FALSE 0 !(i<20) [L1358] 0 \read(mythread) VAL [arg={0:0}, arg={0:0}, i=20, j=28, myglobal=40] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, i=20, j=28, myglobal=40, mythread={3:0}] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[myglobal]]]] [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, i=20, j=28, myglobal=40] [L13] 0 reach_error() VAL [\old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, i=20, j=28, myglobal=40] - UnprovableResult [Line: 1355]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1362]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1363]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1342]: 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: 1328]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1329]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1330]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1331]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1333]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1334]: 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, 48 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.9s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1896 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1874 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1626 IncrementalHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 4 mSDtfsCounter, 1626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1126 GetRequests, 936 SyntacticMatches, 16 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2841 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6886occurred in iteration=12, InterpolantAutomatonStates: 194, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1154 NumberOfCodeBlocks, 1148 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1395 ConstructedInterpolants, 0 QuantifiedInterpolants, 3359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 3714/6043 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 14:53:57,782 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