./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 e7c74aec 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-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:31:41,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:31:41,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:31:41,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:31:41,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:31:41,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:31:41,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:31:41,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:31:41,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:31:41,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:31:41,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:31:41,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:31:41,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:31:41,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:31:41,471 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:31:41,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:31:41,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:31:41,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:31:41,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:31:41,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:31:41,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:31:41,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:31:41,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:31:41,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:31:41,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:31:41,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:31:41,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:31:41,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:31:41,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:31:41,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:31:41,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:31:41,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:31:41,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:31:41,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:31:41,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:31:41,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:31:41,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:31:41,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:31:41,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:31:41,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:31:41,477 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:31:41,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:31:41,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:31:41,478 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 19:31:41,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:31:41,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:31:41,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:31:41,732 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:31:41,733 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:31:41,733 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 19:31:41,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:31:41,824 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:31:41,825 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 19:31:42,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:31:43,074 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:31:43,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-02-07 19:31:43,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7bcc74b/cdb9bb2064594e839535ebea6fe14c19/FLAGe226fe365 [2024-02-07 19:31:43,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7bcc74b/cdb9bb2064594e839535ebea6fe14c19 [2024-02-07 19:31:43,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:31:43,107 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:31:43,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:31:43,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:31:43,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:31:43,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:31:41" (1/2) ... [2024-02-07 19:31:43,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4827a15c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:43, skipping insertion in model container [2024-02-07 19:31:43,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:31:41" (1/2) ... [2024-02-07 19:31:43,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@495a585 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:31:43, skipping insertion in model container [2024-02-07 19:31:43,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:31:43" (2/2) ... [2024-02-07 19:31:43,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4827a15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43, skipping insertion in model container [2024-02-07 19:31:43,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:31:43" (2/2) ... [2024-02-07 19:31:43,118 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:31:43,154 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1362-L1362] 0 <= myglobal [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1333-L1333] 1 <= j [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1356-L1356] 1 <= myglobal [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1355-L1355] 0 <= myglobal [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1328-L1328] 0 <= myglobal [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1331-L1331] 1 <= j [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1329-L1329] 0 <= j [2024-02-07 19:31:43,155 INFO L76 edCorrectnessWitness]: Location invariant before [L1330-L1330] 0 <= j [2024-02-07 19:31:43,156 INFO L76 edCorrectnessWitness]: Location invariant before [L1334-L1334] 1 <= myglobal [2024-02-07 19:31:43,156 INFO L76 edCorrectnessWitness]: Location invariant before [L1363-L1363] 0 <= myglobal [2024-02-07 19:31:43,193 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:31:43,345 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 19:31:43,657 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:31:43,665 INFO L206 MainTranslator]: Completed pre-run [2024-02-07 19:31:43,676 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 19:31:43,739 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:31:43,796 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:31:43,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43 WrapperNode [2024-02-07 19:31:43,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:31:43,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:31:43,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:31:43,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:31:43,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,850 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-02-07 19:31:43,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:31:43,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:31:43,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:31:43,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:31:43,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,873 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 19:31:43,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:31:43,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:31:43,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:31:43,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:31:43,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (1/1) ... [2024-02-07 19:31:43,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:31:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:43,925 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 19:31:43,939 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 19:31:43,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:31:43,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:31:43,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:31:43,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:31:43,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:31:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:31:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-02-07 19:31:43,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-02-07 19:31:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:31:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:31:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:31:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:31:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:31:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:31:43,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:31:43,971 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 19:31:44,069 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:31:44,070 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:31:44,195 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:31:44,195 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:31:44,275 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:31:44,275 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-07 19:31:44,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:31:44 BoogieIcfgContainer [2024-02-07 19:31:44,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:31:44,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:31:44,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:31:44,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:31:44,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:31:41" (1/4) ... [2024-02-07 19:31:44,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c909ea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:31:44, skipping insertion in model container [2024-02-07 19:31:44,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:31:43" (2/4) ... [2024-02-07 19:31:44,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c909ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:31:44, skipping insertion in model container [2024-02-07 19:31:44,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:31:43" (3/4) ... [2024-02-07 19:31:44,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c909ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:31:44, skipping insertion in model container [2024-02-07 19:31:44,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:31:44" (4/4) ... [2024-02-07 19:31:44,283 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-02-07 19:31:44,296 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:31:44,296 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-02-07 19:31:44,297 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:31:44,327 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-07 19:31:44,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 77 flow [2024-02-07 19:31:44,422 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2024-02-07 19:31:44,423 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 19:31:44,425 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 19:31:44,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 77 flow [2024-02-07 19:31:44,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 72 flow [2024-02-07 19:31:44,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:31:44,441 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;@68194666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:31:44,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-02-07 19:31:44,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:31:44,445 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-02-07 19:31:44,445 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 19:31:44,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:44,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 19:31:44,447 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 19:31:44,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 273530980, now seen corresponding path program 1 times [2024-02-07 19:31:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:44,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973698058] [2024-02-07 19:31:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:44,623 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 19:31:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973698058] [2024-02-07 19:31:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973698058] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:44,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:31:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950830477] [2024-02-07 19:31:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:44,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:44,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-07 19:31:44,692 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 19:31:44,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:44,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-07 19:31:44,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:44,815 INFO L124 PetriNetUnfolderBase]: 66/166 cut-off events. [2024-02-07 19:31:44,816 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 19:31:44,817 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 19:31:44,821 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 32 selfloop transitions, 3 changer transitions 1/43 dead transitions. [2024-02-07 19:31:44,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 167 flow [2024-02-07 19:31:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-02-07 19:31:44,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-02-07 19:31:44,834 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 72 flow. Second operand 3 states and 72 transitions. [2024-02-07 19:31:44,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 167 flow [2024-02-07 19:31:44,837 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 19:31:44,839 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 85 flow [2024-02-07 19:31:44,841 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 19:31:44,844 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2024-02-07 19:31:44,845 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 85 flow [2024-02-07 19:31:44,845 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 19:31:44,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:44,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:31:44,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:31:44,846 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 19:31:44,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash -109486408, now seen corresponding path program 1 times [2024-02-07 19:31:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:44,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760226036] [2024-02-07 19:31:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:44,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:44,924 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 19:31:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760226036] [2024-02-07 19:31:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760226036] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:44,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:44,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:31:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500442919] [2024-02-07 19:31:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:44,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:44,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:44,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 19:31:44,936 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 19:31:44,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:44,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 19:31:44,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:45,029 INFO L124 PetriNetUnfolderBase]: 78/201 cut-off events. [2024-02-07 19:31:45,030 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-07 19:31:45,031 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 19:31:45,033 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 34 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2024-02-07 19:31:45,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 189 flow [2024-02-07 19:31:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-02-07 19:31:45,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-07 19:31:45,037 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 85 flow. Second operand 3 states and 60 transitions. [2024-02-07 19:31:45,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 189 flow [2024-02-07 19:31:45,041 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 19:31:45,044 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 87 flow [2024-02-07 19:31:45,044 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 19:31:45,050 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2024-02-07 19:31:45,050 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 87 flow [2024-02-07 19:31:45,050 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 19:31:45,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:45,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:45,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:31:45,052 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 19:31:45,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:45,055 INFO L85 PathProgramCache]: Analyzing trace with hash 900888949, now seen corresponding path program 1 times [2024-02-07 19:31:45,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:45,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118572865] [2024-02-07 19:31:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:45,125 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 19:31:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118572865] [2024-02-07 19:31:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118572865] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:45,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:31:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033338252] [2024-02-07 19:31:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:45,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:31:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:31:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:31:45,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-07 19:31:45,132 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 19:31:45,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:45,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-07 19:31:45,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:45,218 INFO L124 PetriNetUnfolderBase]: 70/177 cut-off events. [2024-02-07 19:31:45,218 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-07 19:31:45,221 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 19:31:45,224 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 37 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2024-02-07 19:31:45,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 214 flow [2024-02-07 19:31:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:31:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:31:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-02-07 19:31:45,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-07 19:31:45,226 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 87 flow. Second operand 4 states and 70 transitions. [2024-02-07 19:31:45,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 214 flow [2024-02-07 19:31:45,228 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 19:31:45,229 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 89 flow [2024-02-07 19:31:45,229 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 19:31:45,230 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2024-02-07 19:31:45,231 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 89 flow [2024-02-07 19:31:45,231 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 19:31:45,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:45,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:45,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:31:45,232 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 19:31:45,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1208784450, now seen corresponding path program 1 times [2024-02-07 19:31:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082015408] [2024-02-07 19:31:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:45,264 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 19:31:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:45,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082015408] [2024-02-07 19:31:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082015408] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:45,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:31:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736120901] [2024-02-07 19:31:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:45,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:45,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-02-07 19:31:45,270 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 19:31:45,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:45,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-02-07 19:31:45,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:45,313 INFO L124 PetriNetUnfolderBase]: 52/138 cut-off events. [2024-02-07 19:31:45,313 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-02-07 19:31:45,314 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 19:31:45,314 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 27 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2024-02-07 19:31:45,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 165 flow [2024-02-07 19:31:45,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-02-07 19:31:45,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-02-07 19:31:45,316 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 89 flow. Second operand 3 states and 58 transitions. [2024-02-07 19:31:45,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 165 flow [2024-02-07 19:31:45,317 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 19:31:45,317 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 66 flow [2024-02-07 19:31:45,318 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 19:31:45,318 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2024-02-07 19:31:45,318 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 66 flow [2024-02-07 19:31:45,319 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 19:31:45,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:45,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:45,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:31:45,319 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 19:31:45,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -368939793, now seen corresponding path program 1 times [2024-02-07 19:31:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:45,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142309610] [2024-02-07 19:31:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:45,352 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 19:31:45,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:45,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142309610] [2024-02-07 19:31:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142309610] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:45,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:45,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:31:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106393650] [2024-02-07 19:31:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:45,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:45,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:45,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-02-07 19:31:45,356 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 19:31:45,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:45,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-02-07 19:31:45,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:45,391 INFO L124 PetriNetUnfolderBase]: 61/147 cut-off events. [2024-02-07 19:31:45,391 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-02-07 19:31:45,392 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 19:31:45,393 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-02-07 19:31:45,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 160 flow [2024-02-07 19:31:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-07 19:31:45,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-07 19:31:45,394 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 66 flow. Second operand 3 states and 56 transitions. [2024-02-07 19:31:45,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 160 flow [2024-02-07 19:31:45,395 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 19:31:45,396 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 76 flow [2024-02-07 19:31:45,396 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 19:31:45,396 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2024-02-07 19:31:45,397 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 76 flow [2024-02-07 19:31:45,397 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 19:31:45,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:45,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:31:45,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:31:45,397 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 19:31:45,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash 871467418, now seen corresponding path program 1 times [2024-02-07 19:31:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532047495] [2024-02-07 19:31:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:45,425 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 19:31:45,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:45,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532047495] [2024-02-07 19:31:45,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532047495] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:31:45,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:31:45,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:31:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069163814] [2024-02-07 19:31:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:31:45,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:31:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:45,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:31:45,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:31:45,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-02-07 19:31:45,429 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 19:31:45,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:45,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-02-07 19:31:45,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:45,462 INFO L124 PetriNetUnfolderBase]: 73/164 cut-off events. [2024-02-07 19:31:45,463 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-02-07 19:31:45,463 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 19:31:45,464 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-02-07 19:31:45,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 174 flow [2024-02-07 19:31:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:31:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:31:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-07 19:31:45,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-07 19:31:45,465 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 76 flow. Second operand 3 states and 56 transitions. [2024-02-07 19:31:45,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 174 flow [2024-02-07 19:31:45,466 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 19:31:45,466 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 86 flow [2024-02-07 19:31:45,466 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 19:31:45,467 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2024-02-07 19:31:45,467 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 86 flow [2024-02-07 19:31:45,467 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 19:31:45,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:45,467 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 19:31:45,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:31:45,468 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 19:31:45,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1489267869, now seen corresponding path program 1 times [2024-02-07 19:31:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:45,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447485178] [2024-02-07 19:31:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:45,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:45,504 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 19:31:45,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:45,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447485178] [2024-02-07 19:31:45,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447485178] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:31:45,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441747525] [2024-02-07 19:31:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:45,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:31:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:45,520 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 19:31:45,567 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 19:31:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:45,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 19:31:45,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:31:45,687 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 19:31:45,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:31:45,712 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 19:31:45,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441747525] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:31:45,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:31:45,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-02-07 19:31:45,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447852041] [2024-02-07 19:31:45,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:31:45,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-07 19:31:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:45,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-07 19:31:45,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-02-07 19:31:45,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 19:31:45,718 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 19:31:45,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:45,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 19:31:45,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:45,900 INFO L124 PetriNetUnfolderBase]: 217/458 cut-off events. [2024-02-07 19:31:45,901 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2024-02-07 19:31:45,902 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 19:31:45,903 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 97 selfloop transitions, 33 changer transitions 0/133 dead transitions. [2024-02-07 19:31:45,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 133 transitions, 715 flow [2024-02-07 19:31:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-07 19:31:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-07 19:31:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 284 transitions. [2024-02-07 19:31:45,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-02-07 19:31:45,905 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 86 flow. Second operand 16 states and 284 transitions. [2024-02-07 19:31:45,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 133 transitions, 715 flow [2024-02-07 19:31:45,907 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 19:31:45,908 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 358 flow [2024-02-07 19:31:45,908 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 19:31:45,909 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2024-02-07 19:31:45,909 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 358 flow [2024-02-07 19:31:45,909 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 19:31:45,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:45,910 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 19:31:45,927 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 19:31:46,123 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 19:31:46,124 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 19:31:46,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -991470669, now seen corresponding path program 2 times [2024-02-07 19:31:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:46,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982197161] [2024-02-07 19:31:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:46,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:46,220 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 19:31:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982197161] [2024-02-07 19:31:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982197161] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:31:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798898115] [2024-02-07 19:31:46,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 19:31:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:31:46,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:46,237 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 19:31:46,238 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 19:31:46,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 19:31:46,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:31:46,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-07 19:31:46,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:31:46,367 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 19:31:46,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:31:46,430 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 19:31:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798898115] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:31:46,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:31:46,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-02-07 19:31:46,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972864600] [2024-02-07 19:31:46,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:31:46,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-07 19:31:46,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-07 19:31:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-02-07 19:31:46,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 19:31:46,437 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 19:31:46,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:46,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 19:31:46,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:46,602 INFO L124 PetriNetUnfolderBase]: 489/1048 cut-off events. [2024-02-07 19:31:46,602 INFO L125 PetriNetUnfolderBase]: For 4576/4576 co-relation queries the response was YES. [2024-02-07 19:31:46,606 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 19:31:46,610 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 98 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2024-02-07 19:31:46,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 124 transitions, 1053 flow [2024-02-07 19:31:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-07 19:31:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-07 19:31:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-02-07 19:31:46,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2024-02-07 19:31:46,611 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 358 flow. Second operand 8 states and 151 transitions. [2024-02-07 19:31:46,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 124 transitions, 1053 flow [2024-02-07 19:31:46,618 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 19:31:46,619 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 428 flow [2024-02-07 19:31:46,619 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 19:31:46,620 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2024-02-07 19:31:46,620 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 428 flow [2024-02-07 19:31:46,620 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 19:31:46,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:46,620 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 19:31:46,646 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 19:31:46,832 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 19:31:46,832 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 19:31:46,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1476926193, now seen corresponding path program 3 times [2024-02-07 19:31:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417683728] [2024-02-07 19:31:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:46,943 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 19:31:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:46,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417683728] [2024-02-07 19:31:46,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417683728] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:31:46,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904005347] [2024-02-07 19:31:46,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 19:31:46,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:31:46,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:46,945 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 19:31:46,975 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 19:31:47,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-02-07 19:31:47,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:31:47,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-07 19:31:47,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:31:47,071 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 19:31:47,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:31:47,140 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 19:31:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904005347] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:31:47,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:31:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-02-07 19:31:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577539459] [2024-02-07 19:31:47,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:31:47,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-07 19:31:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-07 19:31:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-02-07 19:31:47,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 19:31:47,159 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 19:31:47,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:47,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 19:31:47,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:48,868 INFO L124 PetriNetUnfolderBase]: 1135/2333 cut-off events. [2024-02-07 19:31:48,868 INFO L125 PetriNetUnfolderBase]: For 26378/26378 co-relation queries the response was YES. [2024-02-07 19:31:48,876 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 19:31:48,937 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 527 selfloop transitions, 202 changer transitions 0/733 dead transitions. [2024-02-07 19:31:48,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 733 transitions, 6026 flow [2024-02-07 19:31:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-02-07 19:31:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2024-02-07 19:31:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 1567 transitions. [2024-02-07 19:31:48,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030497592295345 [2024-02-07 19:31:48,943 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 428 flow. Second operand 89 states and 1567 transitions. [2024-02-07 19:31:48,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 733 transitions, 6026 flow [2024-02-07 19:31:48,964 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 19:31:48,973 INFO L231 Difference]: Finished difference. Result has 214 places, 236 transitions, 2886 flow [2024-02-07 19:31:48,974 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 19:31:48,974 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 180 predicate places. [2024-02-07 19:31:48,974 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 236 transitions, 2886 flow [2024-02-07 19:31:48,975 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 19:31:48,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:48,975 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 19:31:48,990 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 19:31:49,188 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 19:31:49,189 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 19:31:49,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1761729010, now seen corresponding path program 4 times [2024-02-07 19:31:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449679899] [2024-02-07 19:31:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:49,403 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 19:31:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449679899] [2024-02-07 19:31:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449679899] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:31:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814611818] [2024-02-07 19:31:49,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-07 19:31:49,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:31:49,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:49,405 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 19:31:49,453 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 19:31:49,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-07 19:31:49,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:31:49,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 19:31:49,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:31:49,621 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 19:31:49,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:31:49,758 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 19:31:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814611818] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:31:49,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:31:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-02-07 19:31:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671121015] [2024-02-07 19:31:49,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:31:49,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-07 19:31:49,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-07 19:31:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2024-02-07 19:31:49,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 19:31:49,767 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 19:31:49,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:49,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 19:31:49,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:51,229 INFO L124 PetriNetUnfolderBase]: 2766/5950 cut-off events. [2024-02-07 19:31:51,229 INFO L125 PetriNetUnfolderBase]: For 216657/216657 co-relation queries the response was YES. [2024-02-07 19:31:51,259 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 19:31:51,291 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 330 selfloop transitions, 206 changer transitions 0/550 dead transitions. [2024-02-07 19:31:51,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 550 transitions, 8573 flow [2024-02-07 19:31:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-07 19:31:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-07 19:31:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 346 transitions. [2024-02-07 19:31:51,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5492063492063493 [2024-02-07 19:31:51,293 INFO L175 Difference]: Start difference. First operand has 214 places, 236 transitions, 2886 flow. Second operand 18 states and 346 transitions. [2024-02-07 19:31:51,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 550 transitions, 8573 flow [2024-02-07 19:31:51,850 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 19:31:51,856 INFO L231 Difference]: Finished difference. Result has 229 places, 325 transitions, 4452 flow [2024-02-07 19:31:51,856 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 19:31:51,857 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 195 predicate places. [2024-02-07 19:31:51,857 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 325 transitions, 4452 flow [2024-02-07 19:31:51,857 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 19:31:51,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:51,857 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 19:31:51,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-07 19:31:52,068 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 19:31:52,068 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 19:31:52,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -67718733, now seen corresponding path program 5 times [2024-02-07 19:31:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925693975] [2024-02-07 19:31:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:52,449 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 19:31:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925693975] [2024-02-07 19:31:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925693975] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:31:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896079644] [2024-02-07 19:31:52,449 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-07 19:31:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:31:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:52,450 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 19:31:52,467 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 19:31:52,541 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-02-07 19:31:52,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:31:52,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 18 conjunts are in the unsatisfiable core [2024-02-07 19:31:52,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:31:52,652 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 19:31:52,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:31:52,930 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 19:31:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896079644] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:31:52,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:31:52,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-02-07 19:31:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817980340] [2024-02-07 19:31:52,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:31:52,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-07 19:31:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-07 19:31:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-02-07 19:31:52,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 19:31:52,947 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 19:31:52,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:52,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 19:31:52,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:54,918 INFO L124 PetriNetUnfolderBase]: 3399/7333 cut-off events. [2024-02-07 19:31:54,918 INFO L125 PetriNetUnfolderBase]: For 263486/263486 co-relation queries the response was YES. [2024-02-07 19:31:54,955 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 19:31:54,980 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 406 selfloop transitions, 250 changer transitions 0/670 dead transitions. [2024-02-07 19:31:54,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 670 transitions, 10785 flow [2024-02-07 19:31:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-02-07 19:31:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-02-07 19:31:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 417 transitions. [2024-02-07 19:31:54,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5415584415584416 [2024-02-07 19:31:54,981 INFO L175 Difference]: Start difference. First operand has 229 places, 325 transitions, 4452 flow. Second operand 22 states and 417 transitions. [2024-02-07 19:31:54,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 670 transitions, 10785 flow [2024-02-07 19:31:55,842 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 19:31:55,848 INFO L231 Difference]: Finished difference. Result has 248 places, 370 transitions, 5786 flow [2024-02-07 19:31:55,849 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 19:31:55,849 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 214 predicate places. [2024-02-07 19:31:55,849 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 370 transitions, 5786 flow [2024-02-07 19:31:55,849 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 19:31:55,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:31:55,849 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 19:31:55,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-07 19:31:56,061 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 19:31:56,061 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 19:31:56,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:31:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash -378293399, now seen corresponding path program 6 times [2024-02-07 19:31:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:31:56,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626991613] [2024-02-07 19:31:56,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:31:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:31:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:31:56,291 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 19:31:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:31:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626991613] [2024-02-07 19:31:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626991613] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:31:56,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469825487] [2024-02-07 19:31:56,292 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-07 19:31:56,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:31:56,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:31:56,293 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 19:31:56,317 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 19:31:56,397 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-02-07 19:31:56,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 19:31:56,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-07 19:31:56,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:31:56,470 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 19:31:56,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:31:56,665 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 19:31:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469825487] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:31:56,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:31:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-02-07 19:31:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557408920] [2024-02-07 19:31:56,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:31:56,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-07 19:31:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:31:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-07 19:31:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-02-07 19:31:56,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-02-07 19:31:56,673 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 19:31:56,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:31:56,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-02-07 19:31:56,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:31:59,956 INFO L124 PetriNetUnfolderBase]: 5169/10539 cut-off events. [2024-02-07 19:31:59,957 INFO L125 PetriNetUnfolderBase]: For 919810/919810 co-relation queries the response was YES. [2024-02-07 19:32:00,018 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 19:32:00,067 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 902 selfloop transitions, 176 changer transitions 0/1084 dead transitions. [2024-02-07 19:32:00,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1084 transitions, 19666 flow [2024-02-07 19:32:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-02-07 19:32:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-02-07 19:32:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 420 transitions. [2024-02-07 19:32:00,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-02-07 19:32:00,069 INFO L175 Difference]: Start difference. First operand has 248 places, 370 transitions, 5786 flow. Second operand 22 states and 420 transitions. [2024-02-07 19:32:00,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1084 transitions, 19666 flow [2024-02-07 19:32:01,319 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 19:32:01,328 INFO L231 Difference]: Finished difference. Result has 265 places, 458 transitions, 6886 flow [2024-02-07 19:32:01,329 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 19:32:01,329 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 231 predicate places. [2024-02-07 19:32:01,329 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 458 transitions, 6886 flow [2024-02-07 19:32:01,329 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 19:32:01,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:32:01,330 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 19:32:01,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-07 19:32:01,536 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 19:32:01,536 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 19:32:01,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:32:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 198789553, now seen corresponding path program 7 times [2024-02-07 19:32:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:32:01,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029823346] [2024-02-07 19:32:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:32:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:32:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:32:01,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:32:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:32:01,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:32:01,662 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:32:01,663 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-02-07 19:32:01,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 18 remaining) [2024-02-07 19:32:01,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 18 remaining) [2024-02-07 19:32:01,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 18 remaining) [2024-02-07 19:32:01,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 18 remaining) [2024-02-07 19:32:01,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 18 remaining) [2024-02-07 19:32:01,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 18 remaining) [2024-02-07 19:32:01,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 18 remaining) [2024-02-07 19:32:01,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 18 remaining) [2024-02-07 19:32:01,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 18 remaining) [2024-02-07 19:32:01,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 18 remaining) [2024-02-07 19:32:01,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 18 remaining) [2024-02-07 19:32:01,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 18 remaining) [2024-02-07 19:32:01,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 18 remaining) [2024-02-07 19:32:01,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 18 remaining) [2024-02-07 19:32:01,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 18 remaining) [2024-02-07 19:32:01,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 18 remaining) [2024-02-07 19:32:01,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_function_dataraceErr5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 18 remaining) [2024-02-07 19:32:01,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:32:01,669 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2024-02-07 19:32:01,674 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:32:01,674 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:32:01,775 INFO L503 ceAbstractionStarter]: Automizer considered 10 witness invariants [2024-02-07 19:32:01,775 INFO L504 ceAbstractionStarter]: WitnessConsidered=10 [2024-02-07 19:32:01,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:32:01 BasicIcfg [2024-02-07 19:32:01,776 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:32:01,776 INFO L158 Benchmark]: Toolchain (without parser) took 18669.09ms. Allocated memory was 144.7MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 67.5MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 580.0MB. Max. memory is 16.1GB. [2024-02-07 19:32:01,776 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:32:01,776 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:32:01,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.26ms. Allocated memory is still 144.7MB. Free memory was 67.3MB in the beginning and 86.9MB in the end (delta: -19.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-07 19:32:01,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.35ms. Allocated memory is still 144.7MB. Free memory was 86.9MB in the beginning and 84.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:32:01,777 INFO L158 Benchmark]: Boogie Preprocessor took 47.89ms. Allocated memory is still 144.7MB. Free memory was 84.4MB in the beginning and 82.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:32:01,777 INFO L158 Benchmark]: RCFGBuilder took 375.72ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 57.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-02-07 19:32:01,777 INFO L158 Benchmark]: TraceAbstraction took 17498.14ms. Allocated memory was 144.7MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 56.5MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 567.6MB. Max. memory is 16.1GB. [2024-02-07 19:32:01,778 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.26ms. Allocated memory is still 144.7MB. Free memory was 67.3MB in the beginning and 86.9MB in the end (delta: -19.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.35ms. Allocated memory is still 144.7MB. Free memory was 86.9MB in the beginning and 84.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.89ms. Allocated memory is still 144.7MB. Free memory was 84.4MB in the beginning and 82.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.72ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 57.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17498.14ms. Allocated memory was 144.7MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 56.5MB in the beginning and 3.0GB in the end (delta: -3.0GB). Peak memory consumption was 567.6MB. 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: 17.3s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1896 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1874 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 1.0s 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.6s 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.3s SatisfiabilityAnalysisTime, 2.4s 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 19:32:01,818 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