./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix030_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 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-wmm/mix030_tso.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix030_tso.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-?-80b1b13-m [2024-01-31 17:37:16,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:37:16,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:37:16,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:37:16,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:37:16,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:37:16,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:37:16,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:37:16,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:37:16,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:37:16,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:37:16,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:37:16,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:37:16,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:37:16,352 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:37:16,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:37:16,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:37:16,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:37:16,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:37:16,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:37:16,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:37:16,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:37:16,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:37:16,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:37:16,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:37:16,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:37:16,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:37:16,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:37:16,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:37:16,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:37:16,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:37:16,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:37:16,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:37:16,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:37:16,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:37:16,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:37:16,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:37:16,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:37:16,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:37:16,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:37:16,360 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:37:16,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:37:16,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:37:16,360 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:37:16,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:37:16,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:37:16,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:37:16,613 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:37:16,613 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:37:16,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix030_tso.yml/witness.yml [2024-01-31 17:37:17,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:37:17,181 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:37:17,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2024-01-31 17:37:18,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:37:18,547 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:37:18,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2024-01-31 17:37:18,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67a8a519/c206b2a2f10e47c986f31c13bfe8a7ad/FLAGd371db515 [2024-01-31 17:37:18,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67a8a519/c206b2a2f10e47c986f31c13bfe8a7ad [2024-01-31 17:37:18,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:37:18,579 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:37:18,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:37:18,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:37:18,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:37:18,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:17" (1/2) ... [2024-01-31 17:37:18,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc8bf5a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:37:18, skipping insertion in model container [2024-01-31 17:37:18,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:17" (1/2) ... [2024-01-31 17:37:18,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1873d90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:37:18, skipping insertion in model container [2024-01-31 17:37:18,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:37:18" (2/2) ... [2024-01-31 17:37:18,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc8bf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:18, skipping insertion in model container [2024-01-31 17:37:18,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:37:18" (2/2) ... [2024-01-31 17:37:18,591 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:37:20,540 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:37:20,541 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:37:20,541 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:37:20,567 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:37:20,669 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-wmm/mix030_tso.i[944,957] [2024-01-31 17:37:20,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:37:20,781 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:37:20,789 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-wmm/mix030_tso.i[944,957] Start Parsing Local [2024-01-31 17:37:20,805 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:37:20,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:37:20,869 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:37:20,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20 WrapperNode [2024-01-31 17:37:20,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:37:20,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:37:20,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:37:20,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:37:20,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,909 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2024-01-31 17:37:20,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:37:20,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:37:20,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:37:20,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:37:20,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,934 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:37:20,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:37:20,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:37:20,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:37:20,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:37:20,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (1/1) ... [2024-01-31 17:37:20,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:37:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:37:20,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:37:20,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:37:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:37:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:37:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:37:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:37:21,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:37:21,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:37:21,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:37:21,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:37:21,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:37:21,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:37:21,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:37:21,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:37:21,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:37:21,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:37:21,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:37:21,005 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:37:21,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:37:21,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:37:21,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:37:21,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:37:21,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:37:21,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:37:21,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:37:21,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:37:21,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:37:21,008 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:37:21,138 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:37:21,142 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:37:21,374 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:37:21,374 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:37:21,532 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:37:21,532 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:37:21,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:37:21 BoogieIcfgContainer [2024-01-31 17:37:21,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:37:21,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:37:21,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:37:21,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:37:21,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:17" (1/4) ... [2024-01-31 17:37:21,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253178e9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:37:21, skipping insertion in model container [2024-01-31 17:37:21,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:37:18" (2/4) ... [2024-01-31 17:37:21,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253178e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:37:21, skipping insertion in model container [2024-01-31 17:37:21,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:20" (3/4) ... [2024-01-31 17:37:21,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253178e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:37:21, skipping insertion in model container [2024-01-31 17:37:21,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:37:21" (4/4) ... [2024-01-31 17:37:21,541 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2024-01-31 17:37:21,555 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:37:21,555 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:37:21,555 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:37:21,591 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:37:21,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 52 transitions, 120 flow [2024-01-31 17:37:21,653 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2024-01-31 17:37:21,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:21,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 1/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 105 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2024-01-31 17:37:21,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 52 transitions, 120 flow [2024-01-31 17:37:21,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 48 transitions, 108 flow [2024-01-31 17:37:21,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:37:21,672 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;@4e69e09a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:37:21,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:37:21,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:37:21,679 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-01-31 17:37:21,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:21,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:21,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:21,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:21,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1083305125, now seen corresponding path program 1 times [2024-01-31 17:37:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:21,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740736376] [2024-01-31 17:37:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740736376] [2024-01-31 17:37:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740736376] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:22,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:37:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099496239] [2024-01-31 17:37:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:22,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:37:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:37:22,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:37:22,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 52 [2024-01-31 17:37:22,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:22,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:22,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 52 [2024-01-31 17:37:22,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:22,415 INFO L124 PetriNetUnfolderBase]: 1239/2291 cut-off events. [2024-01-31 17:37:22,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:22,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4115 conditions, 2291 events. 1239/2291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17897 event pairs, 1239 based on Foata normal form. 72/2069 useless extension candidates. Maximal degree in co-relation 4103. Up to 1781 conditions per place. [2024-01-31 17:37:22,438 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 23 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2024-01-31 17:37:22,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 150 flow [2024-01-31 17:37:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:37:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:37:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2024-01-31 17:37:22,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7596153846153846 [2024-01-31 17:37:22,453 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 2 states and 79 transitions. [2024-01-31 17:37:22,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 150 flow [2024-01-31 17:37:22,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:37:22,461 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 100 flow [2024-01-31 17:37:22,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-01-31 17:37:22,467 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-01-31 17:37:22,467 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 100 flow [2024-01-31 17:37:22,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:22,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:22,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:22,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:37:22,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:22,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1083305124, now seen corresponding path program 1 times [2024-01-31 17:37:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286477519] [2024-01-31 17:37:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:22,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:22,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286477519] [2024-01-31 17:37:22,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286477519] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:22,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:22,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:37:22,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045683463] [2024-01-31 17:37:22,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:22,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:37:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:37:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:37:22,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 52 [2024-01-31 17:37:22,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:22,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:22,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 52 [2024-01-31 17:37:22,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:23,018 INFO L124 PetriNetUnfolderBase]: 1027/1767 cut-off events. [2024-01-31 17:37:23,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:23,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3292 conditions, 1767 events. 1027/1767 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12308 event pairs, 179 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 3289. Up to 1185 conditions per place. [2024-01-31 17:37:23,032 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 28 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-01-31 17:37:23,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 182 flow [2024-01-31 17:37:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:37:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:37:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-01-31 17:37:23,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2024-01-31 17:37:23,037 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 100 flow. Second operand 3 states and 114 transitions. [2024-01-31 17:37:23,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 182 flow [2024-01-31 17:37:23,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:37:23,044 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 100 flow [2024-01-31 17:37:23,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-01-31 17:37:23,045 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-01-31 17:37:23,045 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 100 flow [2024-01-31 17:37:23,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:23,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:23,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:23,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:37:23,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:23,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1710623873, now seen corresponding path program 1 times [2024-01-31 17:37:23,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:23,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215299454] [2024-01-31 17:37:23,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:23,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215299454] [2024-01-31 17:37:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215299454] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:37:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014087380] [2024-01-31 17:37:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:23,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:37:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:37:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:37:23,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 52 [2024-01-31 17:37:23,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:23,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:23,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 52 [2024-01-31 17:37:23,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:23,445 INFO L124 PetriNetUnfolderBase]: 1323/2099 cut-off events. [2024-01-31 17:37:23,445 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-01-31 17:37:23,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 2099 events. 1323/2099 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14713 event pairs, 1027 based on Foata normal form. 0/1973 useless extension candidates. Maximal degree in co-relation 4146. Up to 1485 conditions per place. [2024-01-31 17:37:23,487 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 30 selfloop transitions, 1 changer transitions 1/51 dead transitions. [2024-01-31 17:37:23,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 180 flow [2024-01-31 17:37:23,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:37:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:37:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-01-31 17:37:23,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2024-01-31 17:37:23,496 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 100 flow. Second operand 3 states and 102 transitions. [2024-01-31 17:37:23,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 180 flow [2024-01-31 17:37:23,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:37:23,499 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 94 flow [2024-01-31 17:37:23,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-01-31 17:37:23,500 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-01-31 17:37:23,500 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 94 flow [2024-01-31 17:37:23,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:23,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:23,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:23,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:37:23,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:23,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1489732939, now seen corresponding path program 1 times [2024-01-31 17:37:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788790033] [2024-01-31 17:37:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:24,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788790033] [2024-01-31 17:37:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788790033] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:24,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:24,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:37:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027408152] [2024-01-31 17:37:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:24,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:37:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:37:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:37:24,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-01-31 17:37:24,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:24,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:24,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-01-31 17:37:24,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:26,248 INFO L124 PetriNetUnfolderBase]: 13412/21358 cut-off events. [2024-01-31 17:37:26,249 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-01-31 17:37:26,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40423 conditions, 21358 events. 13412/21358 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 171306 event pairs, 933 based on Foata normal form. 498/21796 useless extension candidates. Maximal degree in co-relation 40419. Up to 9220 conditions per place. [2024-01-31 17:37:26,350 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 53 selfloop transitions, 13 changer transitions 77/157 dead transitions. [2024-01-31 17:37:26,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 157 transitions, 618 flow [2024-01-31 17:37:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:37:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:37:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 326 transitions. [2024-01-31 17:37:26,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6269230769230769 [2024-01-31 17:37:26,353 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 94 flow. Second operand 10 states and 326 transitions. [2024-01-31 17:37:26,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 157 transitions, 618 flow [2024-01-31 17:37:26,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 157 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:37:26,429 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 233 flow [2024-01-31 17:37:26,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=233, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-01-31 17:37:26,430 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2024-01-31 17:37:26,430 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 233 flow [2024-01-31 17:37:26,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:26,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:26,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:26,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:37:26,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:26,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1207616476, now seen corresponding path program 1 times [2024-01-31 17:37:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295568577] [2024-01-31 17:37:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:26,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:26,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295568577] [2024-01-31 17:37:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295568577] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:26,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:26,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:37:26,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743205519] [2024-01-31 17:37:26,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:26,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:37:26,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:26,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:37:26,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:37:26,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-01-31 17:37:26,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:26,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:26,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-01-31 17:37:26,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:27,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L870-->L886: Formula: (let ((.cse4 (= (mod v_~z$r_buff1_thd0~0_74 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd0~0_72 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~z$w_buff1_used~0_159 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~z$w_buff0_used~0_176 256) 0))) (let ((.cse2 (or .cse11 .cse9 .cse12)) (.cse3 (and (not .cse12) .cse10))) (let ((.cse6 (= (mod v_~z$w_buff1_used~0_158 256) 0)) (.cse7 (= (mod v_~z$w_buff0_used~0_175 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_82 256) 0))) (.cse0 (ite .cse2 v_~z~0_117 (ite .cse3 v_~z$w_buff0~0_130 v_~z$w_buff1~0_111)))) (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_20) (= 2 .cse0) (= 2 v_~__unbuffered_p3_EAX~0_30) (= v_~x~0_29 2) (= v_~y~0_29 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~z$w_buff0~0_129 v_~z$w_buff0~0_130) (= v_~z$w_buff0_used~0_175 (ite .cse1 v_~z$w_buff0_used~0_176 (ite .cse2 v_~z$w_buff0_used~0_176 (ite .cse3 0 v_~z$w_buff0_used~0_176)))) (= v_~z$flush_delayed~0_56 0) (= v_~z$w_buff1~0_111 v_~z$w_buff1~0_110) (= (ite .cse1 v_~z$r_buff1_thd0~0_74 (ite (let ((.cse5 (= (mod v_~z$r_buff0_thd0~0_71 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse5) .cse7)) v_~z$r_buff1_thd0~0_74 0)) v_~z$r_buff1_thd0~0_73) (= v_~z$r_buff0_thd0~0_71 (ite .cse1 v_~z$r_buff0_thd0~0_72 (ite (or (and .cse6 .cse8) .cse9 .cse7) v_~z$r_buff0_thd0~0_72 (ite (and (not .cse7) .cse10) 0 v_~z$r_buff0_thd0~0_72)))) (= v_~z$w_buff1_used~0_158 (ite .cse1 v_~z$w_buff1_used~0_159 (ite (or .cse11 .cse9 .cse7) v_~z$w_buff1_used~0_159 0))) (= v_~z$mem_tmp~0_38 v_~z~0_117) (= v_~z~0_115 (ite .cse1 v_~z$mem_tmp~0_38 .cse0))))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_72, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_176, ~z$w_buff0~0=v_~z$w_buff0~0_130, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_74, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_159, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_111, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~z~0=v_~z~0_117, ~y~0=v_~y~0_29, ~x~0=v_~x~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_129, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, ~z$w_buff1~0=v_~z$w_buff1~0_110, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$flush_delayed~0=v_~z$flush_delayed~0_56, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_42|, ~weak$$choice0~0=v_~weak$$choice0~0_38, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_71, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_46|, ~z~0=v_~z~0_115, ~y~0=v_~y~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, ~z$r_buff0_thd0~0, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet13#1, ~z~0, ~weak$$choice2~0][65], [Black: 79#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 75#true, Black: 86#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork3InUse, Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 8#L779true, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 56#L886true, 100#true, 25#L828true, 67#true, 31#P0EXITtrue, 13#$Ultimate##0true, P2Thread1of1ForFork2InUse, Black: 90#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 78#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), P3Thread1of1ForFork0InUse, Black: 88#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 77#(= ~y~0 0), P1Thread1of1ForFork1InUse]) [2024-01-31 17:37:27,245 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-01-31 17:37:27,245 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:37:27,245 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:37:27,245 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:37:27,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L782-->L789: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_47 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_48 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_41 256) 0)) .cse3))) (and (= v_~z~0_25 (ite .cse0 v_~z$w_buff0~0_15 (ite .cse1 v_~z$w_buff1~0_14 v_~z~0_26))) (= v_~z$r_buff0_thd3~0_19 (ite .cse2 0 v_~z$r_buff0_thd3~0_20)) (= v_~z$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0))) (and (not (= (mod v_~z$r_buff0_thd3~0_19 256) 0)) .cse4)) 0 v_~z$r_buff1_thd3~0_18)) (= v_~z$w_buff0_used~0_47 (ite .cse0 0 v_~z$w_buff0_used~0_48)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_48, ~z$w_buff0~0=v_~z$w_buff0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~z$w_buff1~0=v_~z$w_buff1~0_14, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_47, ~z$w_buff0~0=v_~z$w_buff0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~z$w_buff1~0=v_~z$w_buff1~0_14, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][39], [Black: 79#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 75#true, P0Thread1of1ForFork3InUse, Black: 86#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 100#true, 52#L789true, 25#L828true, 67#true, 12#L870true, 31#P0EXITtrue, 13#$Ultimate##0true, P2Thread1of1ForFork2InUse, Black: 90#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), P3Thread1of1ForFork0InUse, Black: 78#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 88#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), P1Thread1of1ForFork1InUse, Black: 77#(= ~y~0 0)]) [2024-01-31 17:37:27,309 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-01-31 17:37:27,309 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:37:27,309 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:37:27,309 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:37:28,288 INFO L124 PetriNetUnfolderBase]: 10290/16889 cut-off events. [2024-01-31 17:37:28,288 INFO L125 PetriNetUnfolderBase]: For 26854/28040 co-relation queries the response was YES. [2024-01-31 17:37:28,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52827 conditions, 16889 events. 10290/16889 cut-off events. For 26854/28040 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 135646 event pairs, 3049 based on Foata normal form. 497/16907 useless extension candidates. Maximal degree in co-relation 52815. Up to 11052 conditions per place. [2024-01-31 17:37:28,418 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 46 selfloop transitions, 4 changer transitions 51/123 dead transitions. [2024-01-31 17:37:28,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 123 transitions, 825 flow [2024-01-31 17:37:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:37:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:37:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2024-01-31 17:37:28,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6318681318681318 [2024-01-31 17:37:28,421 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 233 flow. Second operand 7 states and 230 transitions. [2024-01-31 17:37:28,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 123 transitions, 825 flow [2024-01-31 17:37:28,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 123 transitions, 817 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-31 17:37:28,436 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 287 flow [2024-01-31 17:37:28,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2024-01-31 17:37:28,437 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2024-01-31 17:37:28,437 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 287 flow [2024-01-31 17:37:28,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:28,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:28,437 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-01-31 17:37:28,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:37:28,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:28,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1023561865, now seen corresponding path program 1 times [2024-01-31 17:37:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:28,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060784996] [2024-01-31 17:37:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060784996] [2024-01-31 17:37:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060784996] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:28,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:28,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:37:28,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149940719] [2024-01-31 17:37:28,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:28,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:37:28,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:28,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:37:28,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:37:28,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-01-31 17:37:28,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:28,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:28,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-01-31 17:37:28,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:31,012 INFO L124 PetriNetUnfolderBase]: 10690/17132 cut-off events. [2024-01-31 17:37:31,012 INFO L125 PetriNetUnfolderBase]: For 37385/37385 co-relation queries the response was YES. [2024-01-31 17:37:31,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57826 conditions, 17132 events. 10690/17132 cut-off events. For 37385/37385 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 134346 event pairs, 1744 based on Foata normal form. 402/17462 useless extension candidates. Maximal degree in co-relation 57810. Up to 6101 conditions per place. [2024-01-31 17:37:31,108 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 61 selfloop transitions, 20 changer transitions 78/173 dead transitions. [2024-01-31 17:37:31,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 173 transitions, 1309 flow [2024-01-31 17:37:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:37:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:37:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2024-01-31 17:37:31,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5865384615384616 [2024-01-31 17:37:31,110 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 287 flow. Second operand 10 states and 305 transitions. [2024-01-31 17:37:31,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 173 transitions, 1309 flow [2024-01-31 17:37:31,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 173 transitions, 1280 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-01-31 17:37:31,127 INFO L231 Difference]: Finished difference. Result has 85 places, 72 transitions, 527 flow [2024-01-31 17:37:31,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=527, PETRI_PLACES=85, PETRI_TRANSITIONS=72} [2024-01-31 17:37:31,130 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 25 predicate places. [2024-01-31 17:37:31,131 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 72 transitions, 527 flow [2024-01-31 17:37:31,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:31,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:31,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:31,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:37:31,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:31,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1793607185, now seen corresponding path program 1 times [2024-01-31 17:37:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515743467] [2024-01-31 17:37:31,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515743467] [2024-01-31 17:37:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515743467] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:37:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628295019] [2024-01-31 17:37:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:31,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:37:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:37:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:37:31,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-01-31 17:37:31,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 72 transitions, 527 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:31,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:31,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-01-31 17:37:31,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:33,248 INFO L124 PetriNetUnfolderBase]: 10600/17739 cut-off events. [2024-01-31 17:37:33,252 INFO L125 PetriNetUnfolderBase]: For 66461/67263 co-relation queries the response was YES. [2024-01-31 17:37:33,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66536 conditions, 17739 events. 10600/17739 cut-off events. For 66461/67263 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 151430 event pairs, 4078 based on Foata normal form. 413/17388 useless extension candidates. Maximal degree in co-relation 66514. Up to 6781 conditions per place. [2024-01-31 17:37:33,409 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 58 selfloop transitions, 7 changer transitions 41/136 dead transitions. [2024-01-31 17:37:33,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 136 transitions, 1154 flow [2024-01-31 17:37:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:37:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:37:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-01-31 17:37:33,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6098901098901099 [2024-01-31 17:37:33,410 INFO L175 Difference]: Start difference. First operand has 85 places, 72 transitions, 527 flow. Second operand 7 states and 222 transitions. [2024-01-31 17:37:33,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 136 transitions, 1154 flow [2024-01-31 17:37:33,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 136 transitions, 1111 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-01-31 17:37:33,525 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 529 flow [2024-01-31 17:37:33,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=529, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2024-01-31 17:37:33,526 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 27 predicate places. [2024-01-31 17:37:33,526 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 529 flow [2024-01-31 17:37:33,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:33,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:33,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:33,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:37:33,527 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:33,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1191867343, now seen corresponding path program 1 times [2024-01-31 17:37:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622137239] [2024-01-31 17:37:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:33,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:33,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622137239] [2024-01-31 17:37:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622137239] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:37:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280738061] [2024-01-31 17:37:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:33,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:37:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:33,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:37:33,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:37:33,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-01-31 17:37:33,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 71 transitions, 529 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:33,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:33,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-01-31 17:37:33,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:37,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([439] L828-->L835: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256)))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_42 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z~0_49 (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_36 v_~z~0_50))) (= v_~z$w_buff0_used~0_91 (ite .cse2 0 v_~z$w_buff0_used~0_92)) (= v_~z$r_buff1_thd4~0_41 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_42)) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_42, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_50} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_41, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][97], [P0Thread1of1ForFork3InUse, Black: 120#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 129#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 157#true, Black: 127#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 118#(= ~__unbuffered_p3_EAX~0 0), Black: 119#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 67#true, Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 1)), 7#L792true, Black: 149#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 151#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 90#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 144#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 78#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 88#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 77#(= ~y~0 0), 75#true, Black: 79#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 86#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L18-2true, 3#L757true, Black: 106#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 38#L767true, 116#true, Black: 102#(= ~x~0 0), Black: 108#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#(= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0), 143#(= ~y~0 1), 11#L835true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse]) [2024-01-31 17:37:37,248 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-31 17:37:37,248 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:37:37,248 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:37:37,248 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 17:37:37,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([439] L828-->L835: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256)))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_42 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z~0_49 (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_36 v_~z~0_50))) (= v_~z$w_buff0_used~0_91 (ite .cse2 0 v_~z$w_buff0_used~0_92)) (= v_~z$r_buff1_thd4~0_41 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_42)) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_42, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_50} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_41, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][97], [P0Thread1of1ForFork3InUse, Black: 120#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 129#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 157#true, Black: 127#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 118#(= ~__unbuffered_p3_EAX~0 0), Black: 119#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 1)), 67#true, 7#L792true, Black: 149#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 151#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 144#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 90#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 78#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 88#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 77#(= ~y~0 0), 75#true, Black: 79#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 86#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L18-2true, Black: 106#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 38#L767true, 116#true, Black: 102#(= ~x~0 0), Black: 108#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#(= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0), 143#(= ~y~0 1), 31#P0EXITtrue, 11#L835true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse]) [2024-01-31 17:37:37,353 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,353 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,354 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,354 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([439] L828-->L835: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256)))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_42 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z~0_49 (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_36 v_~z~0_50))) (= v_~z$w_buff0_used~0_91 (ite .cse2 0 v_~z$w_buff0_used~0_92)) (= v_~z$r_buff1_thd4~0_41 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_42)) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_42, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_50} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_41, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][97], [P0Thread1of1ForFork3InUse, Black: 120#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 33#P2EXITtrue, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 129#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 157#true, Black: 127#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 118#(= ~__unbuffered_p3_EAX~0 0), Black: 119#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 67#true, Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 1)), Black: 149#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 151#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 144#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 90#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 78#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 88#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 77#(= ~y~0 0), 75#true, Black: 79#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 86#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L18-2true, 3#L757true, Black: 106#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 38#L767true, 116#true, Black: 102#(= ~x~0 0), Black: 108#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#(= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0), 143#(= ~y~0 1), 11#L835true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse]) [2024-01-31 17:37:37,374 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,374 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,374 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,375 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 17:37:37,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([439] L828-->L835: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_51 256)))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_42 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5)) (.cse1 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z~0_49 (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_36 v_~z~0_50))) (= v_~z$w_buff0_used~0_91 (ite .cse2 0 v_~z$w_buff0_used~0_92)) (= v_~z$r_buff1_thd4~0_41 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_50 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_42)) (= v_~z$r_buff0_thd4~0_50 (ite .cse1 0 v_~z$r_buff0_thd4~0_51))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_42, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_50} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_41, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][97], [P0Thread1of1ForFork3InUse, Black: 120#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 33#P2EXITtrue, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 129#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 157#true, Black: 127#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 118#(= ~__unbuffered_p3_EAX~0 0), Black: 119#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 67#true, Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 1)), Black: 149#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 151#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 144#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), Black: 90#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 78#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 88#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 77#(= ~y~0 0), 75#true, Black: 79#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 86#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L18-2true, Black: 106#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 38#L767true, 116#true, Black: 102#(= ~x~0 0), Black: 108#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 74#(= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0), 143#(= ~y~0 1), 31#P0EXITtrue, 11#L835true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse]) [2024-01-31 17:37:37,459 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-31 17:37:37,459 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:37:37,459 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:37:37,459 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-31 17:37:37,830 INFO L124 PetriNetUnfolderBase]: 27695/41962 cut-off events. [2024-01-31 17:37:37,830 INFO L125 PetriNetUnfolderBase]: For 113316/124518 co-relation queries the response was YES. [2024-01-31 17:37:38,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137694 conditions, 41962 events. 27695/41962 cut-off events. For 113316/124518 co-relation queries the response was YES. Maximal size of possible extension queue 2026. Compared 331201 event pairs, 5453 based on Foata normal form. 3028/43088 useless extension candidates. Maximal degree in co-relation 137668. Up to 21448 conditions per place. [2024-01-31 17:37:38,187 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 69 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2024-01-31 17:37:38,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 111 transitions, 917 flow [2024-01-31 17:37:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:37:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:37:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-01-31 17:37:38,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-01-31 17:37:38,189 INFO L175 Difference]: Start difference. First operand has 87 places, 71 transitions, 529 flow. Second operand 4 states and 144 transitions. [2024-01-31 17:37:38,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 111 transitions, 917 flow [2024-01-31 17:37:38,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 884 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-01-31 17:37:38,258 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 550 flow [2024-01-31 17:37:38,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=550, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2024-01-31 17:37:38,258 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2024-01-31 17:37:38,259 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 550 flow [2024-01-31 17:37:38,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:38,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:38,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:38,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:37:38,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:38,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1088751685, now seen corresponding path program 1 times [2024-01-31 17:37:38,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:38,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792292668] [2024-01-31 17:37:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:38,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792292668] [2024-01-31 17:37:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792292668] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:38,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:37:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127590326] [2024-01-31 17:37:38,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:38,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:37:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:38,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:37:38,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:37:38,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-01-31 17:37:38,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 550 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:38,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:38,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-01-31 17:37:38,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:42,817 INFO L124 PetriNetUnfolderBase]: 27687/45414 cut-off events. [2024-01-31 17:37:42,817 INFO L125 PetriNetUnfolderBase]: For 111242/114933 co-relation queries the response was YES. [2024-01-31 17:37:43,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153792 conditions, 45414 events. 27687/45414 cut-off events. For 111242/114933 co-relation queries the response was YES. Maximal size of possible extension queue 2377. Compared 413101 event pairs, 11799 based on Foata normal form. 1915/42994 useless extension candidates. Maximal degree in co-relation 153772. Up to 17207 conditions per place. [2024-01-31 17:37:43,525 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 87 selfloop transitions, 17 changer transitions 4/139 dead transitions. [2024-01-31 17:37:43,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 1159 flow [2024-01-31 17:37:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:37:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:37:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-01-31 17:37:43,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-01-31 17:37:43,526 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 550 flow. Second operand 7 states and 224 transitions. [2024-01-31 17:37:43,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 1159 flow [2024-01-31 17:37:43,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 139 transitions, 1149 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-31 17:37:43,558 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 666 flow [2024-01-31 17:37:43,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=666, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-01-31 17:37:43,559 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 29 predicate places. [2024-01-31 17:37:43,559 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 666 flow [2024-01-31 17:37:43,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:43,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:43,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:43,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:37:43,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:43,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash -794366277, now seen corresponding path program 1 times [2024-01-31 17:37:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678476500] [2024-01-31 17:37:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:43,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:43,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678476500] [2024-01-31 17:37:43,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678476500] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:43,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:43,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:37:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855144239] [2024-01-31 17:37:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:43,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:37:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:37:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:37:43,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-01-31 17:37:43,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 666 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:43,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:43,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-01-31 17:37:43,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:48,917 INFO L124 PetriNetUnfolderBase]: 36728/54674 cut-off events. [2024-01-31 17:37:48,918 INFO L125 PetriNetUnfolderBase]: For 143262/160381 co-relation queries the response was YES. [2024-01-31 17:37:49,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188999 conditions, 54674 events. 36728/54674 cut-off events. For 143262/160381 co-relation queries the response was YES. Maximal size of possible extension queue 2760. Compared 430542 event pairs, 4549 based on Foata normal form. 4356/56848 useless extension candidates. Maximal degree in co-relation 188974. Up to 22033 conditions per place. [2024-01-31 17:37:49,371 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 87 selfloop transitions, 10 changer transitions 5/138 dead transitions. [2024-01-31 17:37:49,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 1204 flow [2024-01-31 17:37:49,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:37:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:37:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2024-01-31 17:37:49,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2024-01-31 17:37:49,374 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 666 flow. Second operand 5 states and 184 transitions. [2024-01-31 17:37:49,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 1204 flow [2024-01-31 17:37:49,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 1170 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-01-31 17:37:49,728 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 641 flow [2024-01-31 17:37:49,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2024-01-31 17:37:49,728 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 34 predicate places. [2024-01-31 17:37:49,728 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 641 flow [2024-01-31 17:37:49,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:49,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:49,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:49,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:37:49,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:49,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1108852997, now seen corresponding path program 1 times [2024-01-31 17:37:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:49,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333428378] [2024-01-31 17:37:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333428378] [2024-01-31 17:37:49,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333428378] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:49,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:49,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:37:49,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075405693] [2024-01-31 17:37:49,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:49,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:37:49,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:37:49,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:37:49,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-01-31 17:37:49,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:49,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:49,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-01-31 17:37:49,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:54,280 INFO L124 PetriNetUnfolderBase]: 28588/42210 cut-off events. [2024-01-31 17:37:54,281 INFO L125 PetriNetUnfolderBase]: For 131768/151872 co-relation queries the response was YES. [2024-01-31 17:37:54,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159709 conditions, 42210 events. 28588/42210 cut-off events. For 131768/151872 co-relation queries the response was YES. Maximal size of possible extension queue 2261. Compared 320673 event pairs, 2265 based on Foata normal form. 3389/43722 useless extension candidates. Maximal degree in co-relation 159682. Up to 13984 conditions per place. [2024-01-31 17:37:54,676 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 96 selfloop transitions, 14 changer transitions 5/151 dead transitions. [2024-01-31 17:37:54,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 151 transitions, 1300 flow [2024-01-31 17:37:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:37:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:37:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-01-31 17:37:54,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2024-01-31 17:37:54,678 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 641 flow. Second operand 6 states and 222 transitions. [2024-01-31 17:37:54,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 151 transitions, 1300 flow [2024-01-31 17:37:54,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 151 transitions, 1261 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-01-31 17:37:54,718 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 672 flow [2024-01-31 17:37:54,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2024-01-31 17:37:54,719 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2024-01-31 17:37:54,719 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 672 flow [2024-01-31 17:37:54,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:54,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:54,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:54,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:37:54,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:54,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -171281726, now seen corresponding path program 1 times [2024-01-31 17:37:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:54,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989928244] [2024-01-31 17:37:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989928244] [2024-01-31 17:37:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989928244] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:37:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715081973] [2024-01-31 17:37:54,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:54,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:37:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:37:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:37:54,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-01-31 17:37:54,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 672 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:54,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:54,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-01-31 17:37:54,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:58,643 INFO L124 PetriNetUnfolderBase]: 25784/37942 cut-off events. [2024-01-31 17:37:58,644 INFO L125 PetriNetUnfolderBase]: For 161052/181351 co-relation queries the response was YES. [2024-01-31 17:37:58,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154796 conditions, 37942 events. 25784/37942 cut-off events. For 161052/181351 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 287368 event pairs, 2121 based on Foata normal form. 2489/38586 useless extension candidates. Maximal degree in co-relation 154772. Up to 13984 conditions per place. [2024-01-31 17:37:58,908 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 79 selfloop transitions, 18 changer transitions 11/144 dead transitions. [2024-01-31 17:37:58,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 144 transitions, 1217 flow [2024-01-31 17:37:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:37:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:37:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2024-01-31 17:37:58,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6648351648351648 [2024-01-31 17:37:58,910 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 672 flow. Second operand 7 states and 242 transitions. [2024-01-31 17:37:58,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 144 transitions, 1217 flow [2024-01-31 17:37:59,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 144 transitions, 1130 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-01-31 17:37:59,502 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 631 flow [2024-01-31 17:37:59,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-01-31 17:37:59,503 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2024-01-31 17:37:59,503 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 631 flow [2024-01-31 17:37:59,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:59,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:59,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:59,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:37:59,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:59,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -181959517, now seen corresponding path program 1 times [2024-01-31 17:37:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:59,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496095371] [2024-01-31 17:37:59,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496095371] [2024-01-31 17:37:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496095371] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:37:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542157412] [2024-01-31 17:37:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:59,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:37:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:37:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:38:00,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2024-01-31 17:38:00,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 631 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:00,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:00,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2024-01-31 17:38:00,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:03,498 INFO L124 PetriNetUnfolderBase]: 22329/38851 cut-off events. [2024-01-31 17:38:03,498 INFO L125 PetriNetUnfolderBase]: For 122948/131945 co-relation queries the response was YES. [2024-01-31 17:38:03,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137276 conditions, 38851 events. 22329/38851 cut-off events. For 122948/131945 co-relation queries the response was YES. Maximal size of possible extension queue 2930. Compared 380333 event pairs, 3763 based on Foata normal form. 527/35026 useless extension candidates. Maximal degree in co-relation 137255. Up to 10621 conditions per place. [2024-01-31 17:38:03,784 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 33 selfloop transitions, 10 changer transitions 105/177 dead transitions. [2024-01-31 17:38:03,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 177 transitions, 1545 flow [2024-01-31 17:38:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 240 transitions. [2024-01-31 17:38:03,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2024-01-31 17:38:03,786 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 631 flow. Second operand 8 states and 240 transitions. [2024-01-31 17:38:03,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 177 transitions, 1545 flow [2024-01-31 17:38:05,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 177 transitions, 1406 flow, removed 58 selfloop flow, removed 6 redundant places. [2024-01-31 17:38:05,371 INFO L231 Difference]: Finished difference. Result has 97 places, 64 transitions, 428 flow [2024-01-31 17:38:05,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=428, PETRI_PLACES=97, PETRI_TRANSITIONS=64} [2024-01-31 17:38:05,372 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2024-01-31 17:38:05,372 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 64 transitions, 428 flow [2024-01-31 17:38:05,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:05,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:05,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:05,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:38:05,373 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:05,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1852678607, now seen corresponding path program 2 times [2024-01-31 17:38:05,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:05,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688609336] [2024-01-31 17:38:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688609336] [2024-01-31 17:38:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688609336] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:06,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-31 17:38:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444624874] [2024-01-31 17:38:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:06,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:38:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:38:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:38:06,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 52 [2024-01-31 17:38:06,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 64 transitions, 428 flow. Second operand has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:06,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:06,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 52 [2024-01-31 17:38:06,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:06,890 INFO L124 PetriNetUnfolderBase]: 2720/4931 cut-off events. [2024-01-31 17:38:06,890 INFO L125 PetriNetUnfolderBase]: For 7216/7943 co-relation queries the response was YES. [2024-01-31 17:38:06,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13868 conditions, 4931 events. 2720/4931 cut-off events. For 7216/7943 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 37652 event pairs, 769 based on Foata normal form. 84/4206 useless extension candidates. Maximal degree in co-relation 13843. Up to 1820 conditions per place. [2024-01-31 17:38:06,918 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 28 selfloop transitions, 4 changer transitions 19/89 dead transitions. [2024-01-31 17:38:06,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 620 flow [2024-01-31 17:38:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-01-31 17:38:06,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432692307692307 [2024-01-31 17:38:06,921 INFO L175 Difference]: Start difference. First operand has 97 places, 64 transitions, 428 flow. Second operand 8 states and 226 transitions. [2024-01-31 17:38:06,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 620 flow [2024-01-31 17:38:06,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 555 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-01-31 17:38:06,957 INFO L231 Difference]: Finished difference. Result has 94 places, 64 transitions, 395 flow [2024-01-31 17:38:06,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=395, PETRI_PLACES=94, PETRI_TRANSITIONS=64} [2024-01-31 17:38:06,958 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 34 predicate places. [2024-01-31 17:38:06,958 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 64 transitions, 395 flow [2024-01-31 17:38:06,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:06,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:06,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:06,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 17:38:06,959 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:06,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash -414391511, now seen corresponding path program 3 times [2024-01-31 17:38:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969033490] [2024-01-31 17:38:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:38:07,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:38:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:38:07,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:38:07,141 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:38:07,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-01-31 17:38:07,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-01-31 17:38:07,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-01-31 17:38:07,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-01-31 17:38:07,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-01-31 17:38:07,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-01-31 17:38:07,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-01-31 17:38:07,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-01-31 17:38:07,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-01-31 17:38:07,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-01-31 17:38:07,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 17:38:07,146 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:07,152 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:38:07,152 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:38:07,218 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:38:07,218 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:38:07,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:38:07 BasicIcfg [2024-01-31 17:38:07,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:38:07,220 INFO L158 Benchmark]: Toolchain (without parser) took 48640.38ms. Allocated memory was 335.5MB in the beginning and 14.8GB in the end (delta: 14.4GB). Free memory was 271.4MB in the beginning and 12.0GB in the end (delta: -11.7GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-01-31 17:38:07,220 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 192.9MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:38:07,220 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:38:07,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2288.04ms. Allocated memory is still 335.5MB. Free memory was 270.3MB in the beginning and 210.8MB in the end (delta: 59.5MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. [2024-01-31 17:38:07,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.43ms. Allocated memory is still 335.5MB. Free memory was 210.8MB in the beginning and 207.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:38:07,221 INFO L158 Benchmark]: Boogie Preprocessor took 36.96ms. Allocated memory is still 335.5MB. Free memory was 207.6MB in the beginning and 203.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:38:07,221 INFO L158 Benchmark]: RCFGBuilder took 585.86ms. Allocated memory is still 335.5MB. Free memory was 203.4MB in the beginning and 144.7MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-01-31 17:38:07,222 INFO L158 Benchmark]: TraceAbstraction took 45683.41ms. Allocated memory was 335.5MB in the beginning and 14.8GB in the end (delta: 14.4GB). Free memory was 143.7MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-01-31 17:38:07,223 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.15ms. Allocated memory is still 192.9MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2288.04ms. Allocated memory is still 335.5MB. Free memory was 270.3MB in the beginning and 210.8MB in the end (delta: 59.5MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.43ms. Allocated memory is still 335.5MB. Free memory was 210.8MB in the beginning and 207.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.96ms. Allocated memory is still 335.5MB. Free memory was 207.6MB in the beginning and 203.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 585.86ms. Allocated memory is still 335.5MB. Free memory was 203.4MB in the beginning and 144.7MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 45683.41ms. Allocated memory was 335.5MB in the beginning and 14.8GB in the end (delta: 14.4GB). Free memory was 143.7MB in the beginning and 12.0GB in the end (delta: -11.9GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L852] 0 pthread_t t825; [L853] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t826; [L855] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, t826={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t827; [L857] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t828; [L859] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 z$flush_delayed = weak$$choice2 [L875] 0 z$mem_tmp = z [L876] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L877] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L878] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L879] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L880] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L882] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 0 z = z$flush_delayed ? z$mem_tmp : z [L885] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 859]: 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: 855]: 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: 853]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 87 locations, 10 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: 45.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 40.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 835 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1869 IncrementalHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 65 mSDtfsCounter, 1869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=672occurred in iteration=11, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 17:38:07,265 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