./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/popl20-more-dec-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/weaver/popl20-more-dec-subseq.wvr.c ./goblint.2024-06-19_11-23-25.files/protection/popl20-more-dec-subseq.wvr.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-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:03:16,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:03:16,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:03:16,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:03:16,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:03:16,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:03:16,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:03:16,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:03:16,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:03:16,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:03:16,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:03:16,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:03:16,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:03:16,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:03:16,625 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:03:16,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:03:16,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:03:16,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:03:16,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:03:16,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:03:16,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:03:16,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:03:16,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:03:16,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:03:16,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:03:16,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:03:16,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:03:16,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:03:16,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:03:16,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:03:16,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:03:16,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:03:16,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:03:16,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:03:16,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:03:16,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:03:16,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:03:16,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:03:16,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:03:16,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:03:16,631 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:03:16,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:03:16,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:03:16,632 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-06-27 18:03:16,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:03:16,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:03:16,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:03:16,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:03:16,860 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:03:16,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 18:03:17,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:03:18,054 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:03:18,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 18:03:18,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7115102/b4c187bcc189447b9b20059034b08079/FLAGb8e2beb8b [2024-06-27 18:03:18,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7115102/b4c187bcc189447b9b20059034b08079 [2024-06-27 18:03:18,073 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:03:18,074 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:03:18,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/popl20-more-dec-subseq.wvr.yml/witness.yml [2024-06-27 18:03:18,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:03:18,202 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:03:18,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:03:18,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:03:18,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:03:18,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:03:18" (1/2) ... [2024-06-27 18:03:18,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cdfccff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:18, skipping insertion in model container [2024-06-27 18:03:18,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:03:18" (1/2) ... [2024-06-27 18:03:18,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@32038562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:18, skipping insertion in model container [2024-06-27 18:03:18,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:18" (2/2) ... [2024-06-27 18:03:18,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cdfccff and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18, skipping insertion in model container [2024-06-27 18:03:18,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:18" (2/2) ... [2024-06-27 18:03:18,212 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:03:18,225 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:03:18,226 INFO L97 edCorrectnessWitness]: Location invariant before [L102-L102] ! multithreaded || 0 <= i [2024-06-27 18:03:18,226 INFO L97 edCorrectnessWitness]: Location invariant before [L103-L103] ! multithreaded || 0 <= i [2024-06-27 18:03:18,226 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:03:18,226 INFO L106 edCorrectnessWitness]: ghost_update [L101-L101] multithreaded = 1; [2024-06-27 18:03:18,246 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:03:18,389 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 18:03:18,396 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:03:18,403 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:03:18,449 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 18:03:18,452 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:03:18,468 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:03:18,469 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18 WrapperNode [2024-06-27 18:03:18,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:03:18,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:03:18,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:03:18,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:03:18,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,523 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 192 [2024-06-27 18:03:18,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:03:18,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:03:18,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:03:18,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:03:18,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,571 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-27 18:03:18,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:03:18,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:03:18,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:03:18,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:03:18,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (1/1) ... [2024-06-27 18:03:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:03:18,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:18,634 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-06-27 18:03:18,649 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-06-27 18:03:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:03:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 18:03:18,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 18:03:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 18:03:18,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 18:03:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:03:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 18:03:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 18:03:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 18:03:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:03:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:03:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 18:03:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:03:18,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:03:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 18:03:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 18:03:18,672 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:03:18,772 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:03:18,774 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:03:18,963 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:03:18,963 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:03:19,230 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:03:19,231 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 18:03:19,231 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:03:19 BoogieIcfgContainer [2024-06-27 18:03:19,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:03:19,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:03:19,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:03:19,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:03:19,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:03:18" (1/4) ... [2024-06-27 18:03:19,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6cfae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:03:19, skipping insertion in model container [2024-06-27 18:03:19,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:18" (2/4) ... [2024-06-27 18:03:19,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6cfae3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:03:19, skipping insertion in model container [2024-06-27 18:03:19,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:18" (3/4) ... [2024-06-27 18:03:19,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6cfae3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:03:19, skipping insertion in model container [2024-06-27 18:03:19,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:03:19" (4/4) ... [2024-06-27 18:03:19,242 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-06-27 18:03:19,258 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:03:19,259 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 18:03:19,259 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:03:19,316 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 18:03:19,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-06-27 18:03:19,384 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-06-27 18:03:19,384 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 18:03:19,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-06-27 18:03:19,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-06-27 18:03:19,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 78 flow [2024-06-27 18:03:19,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:03:19,417 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;@7254e39b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:03:19,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 18:03:19,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:03:19,426 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2024-06-27 18:03:19,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:03:19,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:19,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:19,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:19,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1746555899, now seen corresponding path program 1 times [2024-06-27 18:03:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061593277] [2024-06-27 18:03:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:19,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061593277] [2024-06-27 18:03:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061593277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:19,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:19,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:03:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633869394] [2024-06-27 18:03:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:19,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:19,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:19,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 18:03:19,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-27 18:03:19,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:19,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 18:03:19,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:19,973 INFO L124 PetriNetUnfolderBase]: 287/517 cut-off events. [2024-06-27 18:03:19,973 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-27 18:03:19,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 517 events. 287/517 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2366 event pairs, 96 based on Foata normal form. 24/450 useless extension candidates. Maximal degree in co-relation 939. Up to 285 conditions per place. [2024-06-27 18:03:19,981 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-06-27 18:03:19,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 205 flow [2024-06-27 18:03:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-27 18:03:19,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-27 18:03:19,992 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 74 transitions. [2024-06-27 18:03:19,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 205 flow [2024-06-27 18:03:19,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 18:03:20,001 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 84 flow [2024-06-27 18:03:20,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2024-06-27 18:03:20,006 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-27 18:03:20,006 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 84 flow [2024-06-27 18:03:20,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-27 18:03:20,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:20,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:03:20,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:20,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1523712316, now seen corresponding path program 1 times [2024-06-27 18:03:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782277786] [2024-06-27 18:03:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782277786] [2024-06-27 18:03:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782277786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878207876] [2024-06-27 18:03:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:20,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 18:03:20,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-27 18:03:20,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:20,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 18:03:20,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:20,200 INFO L124 PetriNetUnfolderBase]: 222/422 cut-off events. [2024-06-27 18:03:20,201 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-27 18:03:20,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 422 events. 222/422 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1963 event pairs, 71 based on Foata normal form. 30/379 useless extension candidates. Maximal degree in co-relation 412. Up to 189 conditions per place. [2024-06-27 18:03:20,203 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 38 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-06-27 18:03:20,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 191 flow [2024-06-27 18:03:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:03:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:03:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-06-27 18:03:20,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-06-27 18:03:20,207 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 84 flow. Second operand 4 states and 82 transitions. [2024-06-27 18:03:20,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 191 flow [2024-06-27 18:03:20,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:20,211 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 78 flow [2024-06-27 18:03:20,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-06-27 18:03:20,213 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-27 18:03:20,215 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 78 flow [2024-06-27 18:03:20,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-27 18:03:20,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,215 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-06-27 18:03:20,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:03:20,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:20,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1499540965, now seen corresponding path program 1 times [2024-06-27 18:03:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710449276] [2024-06-27 18:03:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:20,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710449276] [2024-06-27 18:03:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710449276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:20,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655050523] [2024-06-27 18:03:20,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:20,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:20,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 18:03:20,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06-27 18:03:20,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:20,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 18:03:20,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:20,389 INFO L124 PetriNetUnfolderBase]: 201/373 cut-off events. [2024-06-27 18:03:20,389 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-06-27 18:03:20,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 373 events. 201/373 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1580 event pairs, 55 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 325. Up to 190 conditions per place. [2024-06-27 18:03:20,391 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2024-06-27 18:03:20,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 175 flow [2024-06-27 18:03:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:03:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:03:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-06-27 18:03:20,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-06-27 18:03:20,393 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 78 flow. Second operand 4 states and 77 transitions. [2024-06-27 18:03:20,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 175 flow [2024-06-27 18:03:20,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:03:20,394 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 85 flow [2024-06-27 18:03:20,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-06-27 18:03:20,395 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-06-27 18:03:20,395 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 85 flow [2024-06-27 18:03:20,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06-27 18:03:20,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:20,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:03:20,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:20,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1780392980, now seen corresponding path program 1 times [2024-06-27 18:03:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476005738] [2024-06-27 18:03:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:03:20,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:20,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476005738] [2024-06-27 18:03:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476005738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:20,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:20,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:20,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807448038] [2024-06-27 18:03:20,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:20,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:20,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 18:03:20,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-06-27 18:03:20,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:20,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 18:03:20,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:20,533 INFO L124 PetriNetUnfolderBase]: 213/425 cut-off events. [2024-06-27 18:03:20,533 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2024-06-27 18:03:20,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 425 events. 213/425 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1925 event pairs, 136 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 328. Up to 340 conditions per place. [2024-06-27 18:03:20,535 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 23 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-06-27 18:03:20,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 137 flow [2024-06-27 18:03:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-27 18:03:20,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2024-06-27 18:03:20,537 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 85 flow. Second operand 3 states and 61 transitions. [2024-06-27 18:03:20,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 137 flow [2024-06-27 18:03:20,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 131 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:03:20,538 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 91 flow [2024-06-27 18:03:20,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2024-06-27 18:03:20,539 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-06-27 18:03:20,539 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 91 flow [2024-06-27 18:03:20,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-06-27 18:03:20,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,539 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-06-27 18:03:20,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:03:20,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:20,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1409768404, now seen corresponding path program 1 times [2024-06-27 18:03:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868323113] [2024-06-27 18:03:20,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:03:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868323113] [2024-06-27 18:03:20,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868323113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:20,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:20,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:20,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372749802] [2024-06-27 18:03:20,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:20,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:20,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:20,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:20,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 18:03:20,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06-27 18:03:20,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:20,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 18:03:20,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:20,681 INFO L124 PetriNetUnfolderBase]: 270/539 cut-off events. [2024-06-27 18:03:20,681 INFO L125 PetriNetUnfolderBase]: For 37/40 co-relation queries the response was YES. [2024-06-27 18:03:20,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 539 events. 270/539 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2510 event pairs, 104 based on Foata normal form. 1/486 useless extension candidates. Maximal degree in co-relation 1069. Up to 240 conditions per place. [2024-06-27 18:03:20,684 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-06-27 18:03:20,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 207 flow [2024-06-27 18:03:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-27 18:03:20,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-27 18:03:20,686 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 91 flow. Second operand 3 states and 73 transitions. [2024-06-27 18:03:20,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 207 flow [2024-06-27 18:03:20,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 203 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:20,687 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 99 flow [2024-06-27 18:03:20,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-27 18:03:20,688 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-06-27 18:03:20,688 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 99 flow [2024-06-27 18:03:20,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06-27 18:03:20,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,688 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-06-27 18:03:20,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:03:20,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:20,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1983940103, now seen corresponding path program 1 times [2024-06-27 18:03:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911733128] [2024-06-27 18:03:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:03:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:20,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911733128] [2024-06-27 18:03:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911733128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:20,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355348161] [2024-06-27 18:03:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:20,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:20,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:20,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 18:03:20,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-06-27 18:03:20,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:20,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 18:03:20,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:20,802 INFO L124 PetriNetUnfolderBase]: 270/534 cut-off events. [2024-06-27 18:03:20,802 INFO L125 PetriNetUnfolderBase]: For 45/47 co-relation queries the response was YES. [2024-06-27 18:03:20,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 534 events. 270/534 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2437 event pairs, 110 based on Foata normal form. 7/498 useless extension candidates. Maximal degree in co-relation 1171. Up to 333 conditions per place. [2024-06-27 18:03:20,805 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 34 selfloop transitions, 2 changer transitions 4/48 dead transitions. [2024-06-27 18:03:20,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 218 flow [2024-06-27 18:03:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-27 18:03:20,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-27 18:03:20,806 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 99 flow. Second operand 3 states and 73 transitions. [2024-06-27 18:03:20,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 218 flow [2024-06-27 18:03:20,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:20,808 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 109 flow [2024-06-27 18:03:20,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2024-06-27 18:03:20,808 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-06-27 18:03:20,808 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 109 flow [2024-06-27 18:03:20,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-06-27 18:03:20,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,809 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] [2024-06-27 18:03:20,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:03:20,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:20,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1499428828, now seen corresponding path program 1 times [2024-06-27 18:03:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257555024] [2024-06-27 18:03:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:03:20,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:20,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257555024] [2024-06-27 18:03:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257555024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:20,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:20,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:20,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678589729] [2024-06-27 18:03:20,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:20,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:20,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:20,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:20,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 18:03:20,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06-27 18:03:20,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:20,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 18:03:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:20,982 INFO L124 PetriNetUnfolderBase]: 336/705 cut-off events. [2024-06-27 18:03:20,982 INFO L125 PetriNetUnfolderBase]: For 104/108 co-relation queries the response was YES. [2024-06-27 18:03:20,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 705 events. 336/705 cut-off events. For 104/108 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3643 event pairs, 272 based on Foata normal form. 14/659 useless extension candidates. Maximal degree in co-relation 1236. Up to 470 conditions per place. [2024-06-27 18:03:20,986 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 26 selfloop transitions, 2 changer transitions 18/54 dead transitions. [2024-06-27 18:03:20,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 259 flow [2024-06-27 18:03:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-27 18:03:20,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2024-06-27 18:03:20,987 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 109 flow. Second operand 5 states and 101 transitions. [2024-06-27 18:03:20,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 259 flow [2024-06-27 18:03:20,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:20,989 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 123 flow [2024-06-27 18:03:20,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-06-27 18:03:20,989 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2024-06-27 18:03:20,989 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 123 flow [2024-06-27 18:03:20,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06-27 18:03:20,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,990 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-06-27 18:03:20,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:03:20,990 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:03:20,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1842536997, now seen corresponding path program 1 times [2024-06-27 18:03:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291929140] [2024-06-27 18:03:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:03:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291929140] [2024-06-27 18:03:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291929140] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791671770] [2024-06-27 18:03:21,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:21,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:03:21,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:21,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:03:21,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 18:03:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:21,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-27 18:03:21,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:03:21,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-06-27 18:03:21,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-06-27 18:03:21,791 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 18:03:21,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-27 18:03:21,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 18:03:22,115 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-06-27 18:03:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-06-27 18:03:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:22,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:03:22,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:22,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2024-06-27 18:03:22,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:22,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 90 [2024-06-27 18:03:23,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:23,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2024-06-27 18:03:23,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:23,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 66 [2024-06-27 18:03:23,110 INFO L349 Elim1Store]: treesize reduction 9, result has 80.9 percent of original size [2024-06-27 18:03:23,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 181 [2024-06-27 18:03:23,124 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 18:03:23,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:23,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 120 [2024-06-27 18:03:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791671770] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:03:23,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:03:23,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2024-06-27 18:03:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974565246] [2024-06-27 18:03:23,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:03:23,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-06-27 18:03:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-06-27 18:03:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=911, Unknown=3, NotChecked=0, Total=1122 [2024-06-27 18:03:23,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-27 18:03:23,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 123 flow. Second operand has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 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-06-27 18:03:23,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:23,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-27 18:03:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:27,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:03:31,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:03:36,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:03:40,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:03:48,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:03:53,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:04:01,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:04:11,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:04:13,830 INFO L124 PetriNetUnfolderBase]: 2759/4534 cut-off events. [2024-06-27 18:04:13,830 INFO L125 PetriNetUnfolderBase]: For 869/869 co-relation queries the response was YES. [2024-06-27 18:04:13,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10978 conditions, 4534 events. 2759/4534 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 25865 event pairs, 312 based on Foata normal form. 8/3987 useless extension candidates. Maximal degree in co-relation 10958. Up to 779 conditions per place. [2024-06-27 18:04:13,846 INFO L140 encePairwiseOnDemand]: 18/36 looper letters, 283 selfloop transitions, 94 changer transitions 126/507 dead transitions. [2024-06-27 18:04:13,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 507 transitions, 2487 flow [2024-06-27 18:04:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-06-27 18:04:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2024-06-27 18:04:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 834 transitions. [2024-06-27 18:04:13,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994252873563218 [2024-06-27 18:04:13,856 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 123 flow. Second operand 58 states and 834 transitions. [2024-06-27 18:04:13,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 507 transitions, 2487 flow [2024-06-27 18:04:13,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 507 transitions, 2461 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 18:04:13,868 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 977 flow [2024-06-27 18:04:13,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=977, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2024-06-27 18:04:13,871 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2024-06-27 18:04:13,871 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 977 flow [2024-06-27 18:04:13,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 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-06-27 18:04:13,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:13,871 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-06-27 18:04:13,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 18:04:14,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:14,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:04:14,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1107771450, now seen corresponding path program 2 times [2024-06-27 18:04:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473299769] [2024-06-27 18:04:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:04:15,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:15,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473299769] [2024-06-27 18:04:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473299769] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:15,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699720784] [2024-06-27 18:04:15,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 18:04:15,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:15,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:04:15,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:04:15,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 18:04:15,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 18:04:15,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:04:15,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 28 conjunts are in the unsatisfiable core [2024-06-27 18:04:15,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:04:15,858 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-06-27 18:04:15,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-06-27 18:04:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:04:15,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:04:20,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:04:20,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 176 [2024-06-27 18:04:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 18:04:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699720784] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:04:20,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:04:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 26 [2024-06-27 18:04:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859602779] [2024-06-27 18:04:20,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:04:20,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-06-27 18:04:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:20,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-06-27 18:04:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=570, Unknown=1, NotChecked=0, Total=702 [2024-06-27 18:04:24,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:04:28,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:04:32,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:04:36,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:04:36,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-27 18:04:36,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 977 flow. Second operand has 27 states, 27 states have (on average 8.925925925925926) internal successors, (241), 27 states have internal predecessors, (241), 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-06-27 18:04:36,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:36,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-27 18:04:36,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:39,957 INFO L124 PetriNetUnfolderBase]: 2873/4720 cut-off events. [2024-06-27 18:04:39,957 INFO L125 PetriNetUnfolderBase]: For 46302/46305 co-relation queries the response was YES. [2024-06-27 18:04:39,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24121 conditions, 4720 events. 2873/4720 cut-off events. For 46302/46305 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 26389 event pairs, 189 based on Foata normal form. 5/4518 useless extension candidates. Maximal degree in co-relation 24047. Up to 1344 conditions per place. [2024-06-27 18:04:39,994 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 215 selfloop transitions, 124 changer transitions 25/368 dead transitions. [2024-06-27 18:04:39,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 368 transitions, 3411 flow [2024-06-27 18:04:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-06-27 18:04:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-06-27 18:04:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 375 transitions. [2024-06-27 18:04:39,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38580246913580246 [2024-06-27 18:04:39,997 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 977 flow. Second operand 27 states and 375 transitions. [2024-06-27 18:04:39,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 368 transitions, 3411 flow [2024-06-27 18:04:40,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 368 transitions, 2870 flow, removed 248 selfloop flow, removed 15 redundant places. [2024-06-27 18:04:40,089 INFO L231 Difference]: Finished difference. Result has 148 places, 211 transitions, 1751 flow [2024-06-27 18:04:40,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1751, PETRI_PLACES=148, PETRI_TRANSITIONS=211} [2024-06-27 18:04:40,090 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 113 predicate places. [2024-06-27 18:04:40,090 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 211 transitions, 1751 flow [2024-06-27 18:04:40,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.925925925925926) internal successors, (241), 27 states have internal predecessors, (241), 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-06-27 18:04:40,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:40,091 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-06-27 18:04:40,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 18:04:40,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-06-27 18:04:40,303 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:04:40,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -760245204, now seen corresponding path program 3 times [2024-06-27 18:04:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:40,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328272210] [2024-06-27 18:04:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:04:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328272210] [2024-06-27 18:04:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328272210] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348038200] [2024-06-27 18:04:40,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 18:04:40,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:40,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:04:40,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:04:40,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 18:04:40,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 18:04:40,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:04:40,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 18:04:40,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:04:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:04:40,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:04:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:04:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348038200] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:04:40,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:04:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 13 [2024-06-27 18:04:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446510255] [2024-06-27 18:04:40,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:04:40,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 18:04:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 18:04:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-06-27 18:04:40,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 18:04:40,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 211 transitions, 1751 flow. Second operand has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 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-06-27 18:04:40,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:40,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 18:04:40,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:41,557 INFO L124 PetriNetUnfolderBase]: 1570/3207 cut-off events. [2024-06-27 18:04:41,557 INFO L125 PetriNetUnfolderBase]: For 28303/28687 co-relation queries the response was YES. [2024-06-27 18:04:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16024 conditions, 3207 events. 1570/3207 cut-off events. For 28303/28687 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 20208 event pairs, 349 based on Foata normal form. 135/3281 useless extension candidates. Maximal degree in co-relation 15954. Up to 695 conditions per place. [2024-06-27 18:04:41,578 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 147 selfloop transitions, 34 changer transitions 103/298 dead transitions. [2024-06-27 18:04:41,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 298 transitions, 3126 flow [2024-06-27 18:04:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:04:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:04:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-06-27 18:04:41,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-06-27 18:04:41,580 INFO L175 Difference]: Start difference. First operand has 148 places, 211 transitions, 1751 flow. Second operand 9 states and 204 transitions. [2024-06-27 18:04:41,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 298 transitions, 3126 flow [2024-06-27 18:04:41,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 298 transitions, 2783 flow, removed 142 selfloop flow, removed 11 redundant places. [2024-06-27 18:04:41,624 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 1186 flow [2024-06-27 18:04:41,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1186, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2024-06-27 18:04:41,625 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2024-06-27 18:04:41,625 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 1186 flow [2024-06-27 18:04:41,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 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-06-27 18:04:41,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:41,626 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:41,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 18:04:41,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:41,851 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:04:41,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1272984865, now seen corresponding path program 4 times [2024-06-27 18:04:41,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:41,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674202878] [2024-06-27 18:04:41,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 18:04:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674202878] [2024-06-27 18:04:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674202878] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428302577] [2024-06-27 18:04:42,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 18:04:42,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:04:42,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:04:42,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 18:04:42,115 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 18:04:42,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:04:42,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 18:04:42,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:04:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 18:04:42,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:04:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 18:04:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428302577] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:04:42,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:04:42,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-06-27 18:04:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147889366] [2024-06-27 18:04:42,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:04:42,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-27 18:04:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-27 18:04:42,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-06-27 18:04:42,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 18:04:42,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 137 transitions, 1186 flow. Second operand has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-06-27 18:04:42,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:42,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 18:04:42,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:42,793 INFO L124 PetriNetUnfolderBase]: 874/1888 cut-off events. [2024-06-27 18:04:42,794 INFO L125 PetriNetUnfolderBase]: For 11502/11591 co-relation queries the response was YES. [2024-06-27 18:04:42,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8778 conditions, 1888 events. 874/1888 cut-off events. For 11502/11591 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10518 event pairs, 236 based on Foata normal form. 52/1896 useless extension candidates. Maximal degree in co-relation 8735. Up to 926 conditions per place. [2024-06-27 18:04:42,806 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 83 selfloop transitions, 19 changer transitions 53/165 dead transitions. [2024-06-27 18:04:42,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 165 transitions, 1629 flow [2024-06-27 18:04:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:04:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:04:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 18:04:42,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-27 18:04:42,808 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 1186 flow. Second operand 9 states and 159 transitions. [2024-06-27 18:04:42,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 165 transitions, 1629 flow [2024-06-27 18:04:42,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 165 transitions, 1493 flow, removed 63 selfloop flow, removed 14 redundant places. [2024-06-27 18:04:42,825 INFO L231 Difference]: Finished difference. Result has 112 places, 92 transitions, 704 flow [2024-06-27 18:04:42,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=704, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2024-06-27 18:04:42,826 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2024-06-27 18:04:42,826 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 704 flow [2024-06-27 18:04:42,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-06-27 18:04:42,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:42,827 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:42,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 18:04:43,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:43,039 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:04:43,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash 808740313, now seen corresponding path program 5 times [2024-06-27 18:04:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66942703] [2024-06-27 18:04:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 18:04:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66942703] [2024-06-27 18:04:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66942703] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189180789] [2024-06-27 18:04:44,902 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 18:04:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:04:44,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:04:44,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 18:04:44,999 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 18:04:45,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:04:45,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 57 conjunts are in the unsatisfiable core [2024-06-27 18:04:45,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:04:45,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-06-27 18:04:45,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 18:04:45,199 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 18:04:45,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-27 18:04:45,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 18:04:45,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 18:04:46,580 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-06-27 18:04:46,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 42 [2024-06-27 18:04:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:04:46,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:04:57,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:04:57,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 116 [2024-06-27 18:04:57,827 INFO L349 Elim1Store]: treesize reduction 4, result has 98.0 percent of original size [2024-06-27 18:04:57,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 347 treesize of output 433 [2024-06-27 18:04:57,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:04:57,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 224 treesize of output 315 [2024-06-27 18:05:17,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:05:17,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 121 [2024-06-27 18:05:17,361 INFO L349 Elim1Store]: treesize reduction 36, result has 81.3 percent of original size [2024-06-27 18:05:17,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 307 treesize of output 361 [2024-06-27 18:05:17,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 18:05:17,415 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 18:05:17,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:05:17,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 187 treesize of output 261 [2024-06-27 18:05:27,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:05:27,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 93 [2024-06-27 18:05:27,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:05:27,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 251 [2024-06-27 18:05:27,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:05:27,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 168 [2024-06-27 18:05:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:05:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189180789] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:05:33,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:05:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-06-27 18:05:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883746873] [2024-06-27 18:05:33,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:05:33,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-06-27 18:05:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:05:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-06-27 18:05:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=2338, Unknown=7, NotChecked=0, Total=2756 [2024-06-27 18:05:36,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:05:40,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:05:40,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2024-06-27 18:05:40,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 92 transitions, 704 flow. Second operand has 53 states, 53 states have (on average 7.132075471698113) internal successors, (378), 53 states have internal predecessors, (378), 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-06-27 18:05:40,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:05:40,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2024-06-27 18:05:40,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:06:03,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:06:07,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:06:09,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:06:13,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:06:17,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:06:31,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:06:35,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:06:39,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:07:00,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:07:04,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:07:08,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:07:57,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:01,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:05,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:09,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:13,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:15,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:32,138 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse45 (* c_~start~0 4))) (let ((.cse37 (+ c_~start~0 1)) (.cse1 (select |c_#memory_int#1| c_~queue~0.base)) (.cse21 (+ .cse45 c_~queue~0.offset)) (.cse44 (* c_~end~0 4))) (let ((.cse2 (+ .cse45 c_~queue~0.offset 4)) (.cse16 (+ .cse44 c_~queue~0.offset 4)) (.cse15 (+ .cse44 c_~queue~0.offset)) (.cse10 (* c_~i~0 4)) (.cse36 (<= c_~new~0 c_~v_old~0)) (.cse3 (select .cse1 .cse21)) (.cse17 (< c_~start~0 0)) (.cse18 (< c_~n~0 .cse37)) (.cse11 (not (= (mod c_~ok~0 256) 0))) (.cse0 (+ c_~end~0 1)) (.cse19 (= c_~n~0 .cse37)) (.cse42 (+ c_~start~0 c_~n~0)) (.cse43 (+ 2 c_~end~0)) (.cse41 (= c_~start~0 c_~end~0))) (and (or (< c_~n~0 3) (< c_~end~0 1)) (<= 1 c_~ok~0) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (let ((.cse7 (select .cse1 .cse16)) (.cse9 (select .cse1 .cse15))) (let ((.cse4 (forall ((v_~A~0.base_91 Int) (|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| Int)) (let ((.cse14 (select |c_#memory_int#1| v_~A~0.base_91))) (let ((.cse12 (select .cse14 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10 4))) (.cse13 (select .cse14 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10)))) (or (not (= .cse12 .cse7)) (< .cse13 .cse12) (not (= .cse9 .cse13)))))))) (and (or (< (select .cse1 .cse2) (+ .cse3 1)) .cse4) (forall ((v_~A~0.base_91 Int) (|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| Int)) (let ((.cse5 (select |c_#memory_int#1| v_~A~0.base_91))) (let ((.cse6 (select .cse5 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10 4))) (.cse8 (select .cse5 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10)))) (or (< .cse3 (+ (select .cse5 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87|) 1)) (not (= .cse6 .cse7)) (< .cse8 .cse6) (not (= .cse9 .cse8)))))) (or .cse11 .cse4)))) .cse17 .cse18 .cse19) (or (and (forall ((v_ArrVal_137 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_137))) (let ((.cse20 (select .cse25 c_~queue~0.base))) (or (< (select .cse20 .cse2) (+ (select .cse20 .cse21) 1)) (forall ((v_~A~0.base_91 Int) (|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| Int)) (let ((.cse24 (select .cse25 v_~A~0.base_91))) (let ((.cse23 (select .cse24 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10 4))) (.cse22 (select .cse24 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10)))) (or (< .cse22 .cse23) (not (= .cse23 (select .cse20 .cse16))) (not (= .cse22 (select .cse20 .cse15))))))))))) (forall ((v_~A~0.base_91 Int) (|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| Int) (v_ArrVal_137 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_137))) (let ((.cse29 (select .cse30 v_~A~0.base_91))) (let ((.cse27 (select .cse29 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10 4))) (.cse26 (select .cse29 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10))) (.cse28 (select .cse30 c_~queue~0.base))) (or (< .cse26 .cse27) (< (select .cse28 .cse21) (+ (select .cse29 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87|) 1)) (not (= .cse27 (select .cse28 .cse16))) (not (= .cse26 (select .cse28 .cse15)))))))) (or (forall ((v_~A~0.base_91 Int) (|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| Int) (v_ArrVal_137 (Array Int Int))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_137))) (let ((.cse35 (select .cse34 v_~A~0.base_91))) (let ((.cse32 (select .cse35 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10 4))) (.cse31 (select .cse35 (+ |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_87| .cse10))) (.cse33 (select .cse34 c_~queue~0.base))) (or (< .cse31 .cse32) (not (= .cse32 (select .cse33 .cse16))) (not (= .cse31 (select .cse33 .cse15)))))))) .cse11)) .cse17 .cse18 .cse19) .cse36 (= c_~ok~0 1) (<= (div c_~ok~0 256) 0) (or (and .cse11 .cse36 (<= .cse3 c_~new~0)) .cse17 (< c_~end~0 .cse37) .cse18) (= c_~queue~0.offset 0) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse17 .cse18 (let ((.cse38 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_167|) 0))))) (and (or .cse38 .cse11) (or .cse38 (let ((.cse40 (= c_~start~0 .cse0)) (.cse39 (= c_~i~0 0))) (and (or .cse39 .cse40) (or (= (+ c_~i~0 1) 0) (and (or .cse40 .cse41) .cse39))))) (or .cse38 .cse41))) .cse19) (<= .cse42 .cse43) (or (< .cse42 .cse43) .cse41))))) is different from false [2024-06-27 18:08:35,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:38,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:44,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:48,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:08:59,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:00,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:04,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:09,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:13,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:18,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:22,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:27,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:31,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:36,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:41,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:45,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:47,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:09:52,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:06,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:12,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:17,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:21,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:27,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:30,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:34,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:38,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:44,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:48,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:53,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:10:56,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:00,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:04,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:13,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:19,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:23,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:27,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:32,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:36,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:41,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:45,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:55,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:11:59,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:00,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:02,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:06,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:11,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:15,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:17,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:21,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:26,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:30,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:34,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:39,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:43,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:47,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:52,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:12:56,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:13:00,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 18:13:03,071 INFO L124 PetriNetUnfolderBase]: 7846/13055 cut-off events. [2024-06-27 18:13:03,071 INFO L125 PetriNetUnfolderBase]: For 39469/39472 co-relation queries the response was YES. [2024-06-27 18:13:03,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51371 conditions, 13055 events. 7846/13055 cut-off events. For 39469/39472 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 80436 event pairs, 635 based on Foata normal form. 70/13123 useless extension candidates. Maximal degree in co-relation 51336. Up to 2122 conditions per place. [2024-06-27 18:13:03,132 INFO L140 encePairwiseOnDemand]: 14/36 looper letters, 763 selfloop transitions, 338 changer transitions 169/1273 dead transitions. [2024-06-27 18:13:03,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 1273 transitions, 10457 flow [2024-06-27 18:13:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-06-27 18:13:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2024-06-27 18:13:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 1597 transitions. [2024-06-27 18:13:03,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3960813492063492 [2024-06-27 18:13:03,137 INFO L175 Difference]: Start difference. First operand has 112 places, 92 transitions, 704 flow. Second operand 112 states and 1597 transitions. [2024-06-27 18:13:03,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 1273 transitions, 10457 flow [2024-06-27 18:13:03,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1273 transitions, 9639 flow, removed 370 selfloop flow, removed 11 redundant places. [2024-06-27 18:13:03,241 INFO L231 Difference]: Finished difference. Result has 274 places, 453 transitions, 4931 flow [2024-06-27 18:13:03,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=112, PETRI_FLOW=4931, PETRI_PLACES=274, PETRI_TRANSITIONS=453} [2024-06-27 18:13:03,243 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 239 predicate places. [2024-06-27 18:13:03,243 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 453 transitions, 4931 flow [2024-06-27 18:13:03,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 7.132075471698113) internal successors, (378), 53 states have internal predecessors, (378), 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-06-27 18:13:03,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:13:03,243 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:13:03,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 18:13:03,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-06-27 18:13:03,456 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:13:03,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:13:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -106651835, now seen corresponding path program 6 times [2024-06-27 18:13:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:13:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512629035] [2024-06-27 18:13:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:13:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:13:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:13:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 18:13:05,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:13:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512629035] [2024-06-27 18:13:05,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512629035] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:13:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789947299] [2024-06-27 18:13:05,752 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 18:13:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:13:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:13:05,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:13:05,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-27 18:13:05,873 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 18:13:05,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:13:05,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 55 conjunts are in the unsatisfiable core [2024-06-27 18:13:05,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:13:05,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-06-27 18:13:06,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-06-27 18:13:06,229 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 18:13:06,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-27 18:13:06,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 18:13:06,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 18:13:11,440 INFO L349 Elim1Store]: treesize reduction 284, result has 60.2 percent of original size [2024-06-27 18:13:11,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 184 treesize of output 502 [2024-06-27 18:13:49,153 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:13:51,058 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:14:55,117 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:14:55,342 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:15:03,750 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:16:14,204 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:16:15,319 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:16:15,687 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:16:15,978 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:16:17,011 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:16:17,386 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:17:09,928 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:17:17,779 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 18:17:35,578 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 101 [2024-06-27 18:17:35,578 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 18:17:35,579 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 18:17:35,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-27 18:17:35,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:17:35,790 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2024-06-27 18:17:35,795 INFO L158 Benchmark]: Toolchain (without parser) took 857593.55ms. Allocated memory was 125.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 97.4MB in the beginning and 1.0GB in the end (delta: -934.7MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 18:17:35,796 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:17:35,797 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:17:35,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.65ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 81.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-27 18:17:35,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.46ms. Allocated memory is still 125.8MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 18:17:35,797 INFO L158 Benchmark]: Boogie Preprocessor took 71.21ms. Allocated memory is still 125.8MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 18:17:35,798 INFO L158 Benchmark]: RCFGBuilder took 635.07ms. Allocated memory was 125.8MB in the beginning and 197.1MB in the end (delta: 71.3MB). Free memory was 77.1MB in the beginning and 147.1MB in the end (delta: -70.0MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-06-27 18:17:35,798 INFO L158 Benchmark]: TraceAbstraction took 856562.54ms. Allocated memory was 197.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 146.1MB in the beginning and 1.0GB in the end (delta: -886.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 18:17:35,806 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.65ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 81.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.46ms. Allocated memory is still 125.8MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.21ms. Allocated memory is still 125.8MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 635.07ms. Allocated memory was 125.8MB in the beginning and 197.1MB in the end (delta: 71.3MB). Free memory was 77.1MB in the beginning and 147.1MB in the end (delta: -70.0MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 856562.54ms. Allocated memory was 197.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 146.1MB in the beginning and 1.0GB in the end (delta: -886.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/weaver/popl20-more-dec-subseq.wvr.c ./goblint.2024-06-19_11-23-25.files/protection/popl20-more-dec-subseq.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:17:37,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:17:37,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 18:17:37,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:17:37,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:17:37,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:17:37,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:17:37,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:17:37,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:17:37,863 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:17:37,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:17:37,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:17:37,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:17:37,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:17:37,865 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:17:37,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:17:37,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:17:37,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:17:37,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:17:37,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:17:37,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:17:37,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:17:37,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:17:37,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 18:17:37,868 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 18:17:37,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:17:37,868 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 18:17:37,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:17:37,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:17:37,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:17:37,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:17:37,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:17:37,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:17:37,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:17:37,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:17:37,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:17:37,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:17:37,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:17:37,872 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 18:17:37,872 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 18:17:37,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:17:37,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:17:37,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:17:37,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:17:37,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:17:37,873 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 18:17:37,873 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-06-27 18:17:38,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:17:38,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:17:38,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:17:38,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:17:38,142 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:17:38,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 18:17:39,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:17:39,527 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:17:39,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 18:17:39,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f00a9b/3370a90be67e4b22a87309add8edd0dd/FLAG86e830c3f [2024-06-27 18:17:39,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f00a9b/3370a90be67e4b22a87309add8edd0dd [2024-06-27 18:17:39,553 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:17:39,553 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:17:39,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/popl20-more-dec-subseq.wvr.yml/witness.yml [2024-06-27 18:17:39,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:17:39,620 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:17:39,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:17:39,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:17:39,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:17:39,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:17:39" (1/2) ... [2024-06-27 18:17:39,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3035b93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:17:39, skipping insertion in model container [2024-06-27 18:17:39,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:17:39" (1/2) ... [2024-06-27 18:17:39,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d2e20be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:17:39, skipping insertion in model container [2024-06-27 18:17:39,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:17:39" (2/2) ... [2024-06-27 18:17:39,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3035b93c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:39, skipping insertion in model container [2024-06-27 18:17:39,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:17:39" (2/2) ... [2024-06-27 18:17:39,630 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:17:39,647 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:17:39,648 INFO L97 edCorrectnessWitness]: Location invariant before [L103-L103] ! multithreaded || 0 <= i [2024-06-27 18:17:39,648 INFO L97 edCorrectnessWitness]: Location invariant before [L102-L102] ! multithreaded || 0 <= i [2024-06-27 18:17:39,648 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:17:39,648 INFO L106 edCorrectnessWitness]: ghost_update [L101-L101] multithreaded = 1; [2024-06-27 18:17:39,665 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:17:39,831 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 18:17:39,844 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:17:39,858 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 18:17:39,863 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:17:39,876 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 18:17:39,882 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:17:39,888 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:17:39,928 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 18:17:39,930 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:17:39,953 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:17:39,953 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:39 WrapperNode [2024-06-27 18:17:39,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:17:39,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:17:39,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:17:39,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:17:39,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:39" (1/1) ... [2024-06-27 18:17:39,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:39" (1/1) ... [2024-06-27 18:17:39,996 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 187 [2024-06-27 18:17:39,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:17:39,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:17:39,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:17:39,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:17:40,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:39" (1/1) ... [2024-06-27 18:17:40,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:17:39" (1/1) ... Killed by 15