./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/triangular-2.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/pthread/triangular-2.i ./goblint.2024-06-19_11-23-25.files/protection/triangular-2.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:08:41,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:08:41,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:08:41,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:08:41,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:08:41,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:08:41,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:08:41,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:08:41,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:08:41,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:08:41,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:08:41,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:08:41,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:08:41,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:08:41,661 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:08:41,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:08:41,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:08:41,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:08:41,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:08:41,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:08:41,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:08:41,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:08:41,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:08:41,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:08:41,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:08:41,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:08:41,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:08:41,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:08:41,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:08:41,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:08:41,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:08:41,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:08:41,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:08:41,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:08:41,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:08:41,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:08:41,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:08:41,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:08:41,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:08:41,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:08:41,667 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:08:41,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:08:41,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:08:41,667 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:08:41,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:08:41,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:08:41,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:08:41,895 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:08:41,895 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:08:41,896 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/triangular-2.yml/witness.yml [2024-06-27 18:08:42,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:08:42,019 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:08:42,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2024-06-27 18:08:42,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:08:43,159 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:08:43,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2024-06-27 18:08:43,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c62952b2/13e06920ea8b4032bf53f9d85c1631f2/FLAGf4ebb2c87 [2024-06-27 18:08:43,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c62952b2/13e06920ea8b4032bf53f9d85c1631f2 [2024-06-27 18:08:43,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:08:43,205 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:08:43,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:08:43,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:08:43,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:08:43,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:08:42" (1/2) ... [2024-06-27 18:08:43,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eda87e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:08:43, skipping insertion in model container [2024-06-27 18:08:43,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:08:42" (1/2) ... [2024-06-27 18:08:43,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7e45e630 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:08:43, skipping insertion in model container [2024-06-27 18:08:43,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:08:43" (2/2) ... [2024-06-27 18:08:43,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eda87e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43, skipping insertion in model container [2024-06-27 18:08:43,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:08:43" (2/2) ... [2024-06-27 18:08:43,219 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:08:43,242 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:08:43,243 INFO L97 edCorrectnessWitness]: Location invariant before [L715-L715] (! multithreaded || (4 <= j && j % 2 == 0)) && (! multithreaded || (3 <= i && i % 2 == 1)) [2024-06-27 18:08:43,243 INFO L97 edCorrectnessWitness]: Location invariant before [L714-L714] (! multithreaded || (4 <= j && j % 2 == 0)) && (! multithreaded || (3 <= i && i % 2 == 1)) [2024-06-27 18:08:43,243 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:08:43,243 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-06-27 18:08:43,280 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:08:43,575 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2024-06-27 18:08:43,578 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:08:43,591 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:08:43,655 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2024-06-27 18:08:43,656 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:08:43,679 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:08:43,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43 WrapperNode [2024-06-27 18:08:43,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:08:43,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:08:43,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:08:43,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:08:43,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,732 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-06-27 18:08:43,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:08:43,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:08:43,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:08:43,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:08:43,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,773 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 18:08:43,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:08:43,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:08:43,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:08:43,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:08:43,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (1/1) ... [2024-06-27 18:08:43,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:08:43,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:43,824 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:08:43,843 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:08:43,856 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 18:08:43,856 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 18:08:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 18:08:43,857 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 18:08:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:08:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:08:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:08:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:08:43,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:08:43,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:08:43,859 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:08:43,962 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:08:43,964 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:08:44,109 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:08:44,113 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:08:44,196 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:08:44,212 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 18:08:44,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:08:44 BoogieIcfgContainer [2024-06-27 18:08:44,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:08:44,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:08:44,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:08:44,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:08:44,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:08:42" (1/4) ... [2024-06-27 18:08:44,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c48ec09 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:08:44, skipping insertion in model container [2024-06-27 18:08:44,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:08:43" (2/4) ... [2024-06-27 18:08:44,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c48ec09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:08:44, skipping insertion in model container [2024-06-27 18:08:44,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:43" (3/4) ... [2024-06-27 18:08:44,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c48ec09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:08:44, skipping insertion in model container [2024-06-27 18:08:44,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:08:44" (4/4) ... [2024-06-27 18:08:44,223 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-06-27 18:08:44,236 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:08:44,237 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 18:08:44,237 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:08:44,279 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:08:44,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 18:08:44,341 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-06-27 18:08:44,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:08:44,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-06-27 18:08:44,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 18:08:44,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 60 flow [2024-06-27 18:08:44,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:08:44,368 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;@447d28d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:08:44,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 18:08:44,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:08:44,373 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:08:44,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:08:44,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:44,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:08:44,374 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:08:44,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash 176651994, now seen corresponding path program 1 times [2024-06-27 18:08:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132954265] [2024-06-27 18:08:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:44,875 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:08:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132954265] [2024-06-27 18:08:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132954265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:08:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700279280] [2024-06-27 18:08:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:44,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:08:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:08:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:08:44,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 18:08:44,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:08:44,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:44,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 18:08:44,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:45,035 INFO L124 PetriNetUnfolderBase]: 172/337 cut-off events. [2024-06-27 18:08:45,036 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 18:08:45,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 337 events. 172/337 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1436 event pairs, 45 based on Foata normal form. 20/331 useless extension candidates. Maximal degree in co-relation 625. Up to 211 conditions per place. [2024-06-27 18:08:45,040 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2024-06-27 18:08:45,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 139 flow [2024-06-27 18:08:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:08:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:08:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-27 18:08:45,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2024-06-27 18:08:45,060 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 60 flow. Second operand 3 states and 65 transitions. [2024-06-27 18:08:45,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 139 flow [2024-06-27 18:08:45,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:08:45,064 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 75 flow [2024-06-27 18:08:45,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-06-27 18:08:45,069 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-27 18:08:45,069 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 75 flow [2024-06-27 18:08:45,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:08:45,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:45,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:45,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:08:45,070 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:08:45,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1314428841, now seen corresponding path program 1 times [2024-06-27 18:08:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407205315] [2024-06-27 18:08:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:45,345 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:08:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:45,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407205315] [2024-06-27 18:08:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407205315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:08:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114552989] [2024-06-27 18:08:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:45,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:08:45,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:08:45,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:08:45,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 18:08:45,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:08:45,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:45,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 18:08:45,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:45,493 INFO L124 PetriNetUnfolderBase]: 160/331 cut-off events. [2024-06-27 18:08:45,493 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-06-27 18:08:45,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 331 events. 160/331 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1438 event pairs, 37 based on Foata normal form. 21/342 useless extension candidates. Maximal degree in co-relation 697. Up to 109 conditions per place. [2024-06-27 18:08:45,498 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2024-06-27 18:08:45,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 199 flow [2024-06-27 18:08:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:08:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:08:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-27 18:08:45,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6620689655172414 [2024-06-27 18:08:45,502 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 75 flow. Second operand 5 states and 96 transitions. [2024-06-27 18:08:45,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 199 flow [2024-06-27 18:08:45,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:08:45,507 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 98 flow [2024-06-27 18:08:45,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-27 18:08:45,508 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-27 18:08:45,508 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 98 flow [2024-06-27 18:08:45,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:08:45,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:45,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:45,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:08:45,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:08:45,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1917013662, now seen corresponding path program 1 times [2024-06-27 18:08:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874394924] [2024-06-27 18:08:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:45,684 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:08:45,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874394924] [2024-06-27 18:08:45,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874394924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:45,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:08:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618971976] [2024-06-27 18:08:45,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:45,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:08:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:08:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:08:45,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:45,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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:08:45,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:45,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:45,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:45,868 INFO L124 PetriNetUnfolderBase]: 244/502 cut-off events. [2024-06-27 18:08:45,868 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2024-06-27 18:08:45,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 502 events. 244/502 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2451 event pairs, 88 based on Foata normal form. 18/504 useless extension candidates. Maximal degree in co-relation 1117. Up to 255 conditions per place. [2024-06-27 18:08:45,871 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 27 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2024-06-27 18:08:45,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 184 flow [2024-06-27 18:08:45,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:08:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:08:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-27 18:08:45,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2024-06-27 18:08:45,872 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 98 flow. Second operand 5 states and 74 transitions. [2024-06-27 18:08:45,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 184 flow [2024-06-27 18:08:45,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:08:45,874 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 103 flow [2024-06-27 18:08:45,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2024-06-27 18:08:45,874 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-27 18:08:45,874 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 103 flow [2024-06-27 18:08:45,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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:08:45,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:45,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:45,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:08:45,875 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:08:45,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 344931938, now seen corresponding path program 1 times [2024-06-27 18:08:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:45,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558835909] [2024-06-27 18:08:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:45,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:45,939 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:08:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558835909] [2024-06-27 18:08:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558835909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:45,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:08:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950119310] [2024-06-27 18:08:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:45,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:08:45,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:45,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:08:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:08:45,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:45,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:08:45,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:45,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:45,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:46,079 INFO L124 PetriNetUnfolderBase]: 532/914 cut-off events. [2024-06-27 18:08:46,080 INFO L125 PetriNetUnfolderBase]: For 795/795 co-relation queries the response was YES. [2024-06-27 18:08:46,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 914 events. 532/914 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4083 event pairs, 145 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 2252. Up to 397 conditions per place. [2024-06-27 18:08:46,084 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 6 changer transitions 24/65 dead transitions. [2024-06-27 18:08:46,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 366 flow [2024-06-27 18:08:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:08:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:08:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 18:08:46,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-06-27 18:08:46,086 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 103 flow. Second operand 6 states and 106 transitions. [2024-06-27 18:08:46,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 366 flow [2024-06-27 18:08:46,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 18:08:46,088 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 137 flow [2024-06-27 18:08:46,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2024-06-27 18:08:46,089 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-27 18:08:46,089 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 137 flow [2024-06-27 18:08:46,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:08:46,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:46,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:46,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:08:46,090 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:08:46,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2107222436, now seen corresponding path program 1 times [2024-06-27 18:08:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:46,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986571867] [2024-06-27 18:08:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:46,151 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:08:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986571867] [2024-06-27 18:08:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986571867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:46,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:46,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:08:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541816756] [2024-06-27 18:08:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:46,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:08:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:08:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:08:46,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:46,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:08:46,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:46,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:46,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:46,326 INFO L124 PetriNetUnfolderBase]: 379/682 cut-off events. [2024-06-27 18:08:46,326 INFO L125 PetriNetUnfolderBase]: For 785/785 co-relation queries the response was YES. [2024-06-27 18:08:46,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 682 events. 379/682 cut-off events. For 785/785 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2862 event pairs, 115 based on Foata normal form. 27/702 useless extension candidates. Maximal degree in co-relation 1858. Up to 364 conditions per place. [2024-06-27 18:08:46,330 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 39 selfloop transitions, 9 changer transitions 24/77 dead transitions. [2024-06-27 18:08:46,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 455 flow [2024-06-27 18:08:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:08:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:08:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 18:08:46,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5905172413793104 [2024-06-27 18:08:46,333 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 137 flow. Second operand 8 states and 137 transitions. [2024-06-27 18:08:46,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 455 flow [2024-06-27 18:08:46,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 445 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 18:08:46,338 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 221 flow [2024-06-27 18:08:46,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2024-06-27 18:08:46,340 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2024-06-27 18:08:46,340 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 221 flow [2024-06-27 18:08:46,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:08:46,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:46,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:46,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:08:46,341 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:08:46,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash 259230455, now seen corresponding path program 1 times [2024-06-27 18:08:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:46,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724326577] [2024-06-27 18:08:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:46,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:46,404 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:08:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724326577] [2024-06-27 18:08:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724326577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:46,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:08:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076245084] [2024-06-27 18:08:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:46,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:08:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:46,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:08:46,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:08:46,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:46,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:08:46,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:46,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:46,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:46,591 INFO L124 PetriNetUnfolderBase]: 352/644 cut-off events. [2024-06-27 18:08:46,591 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2024-06-27 18:08:46,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 644 events. 352/644 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2603 event pairs, 70 based on Foata normal form. 27/658 useless extension candidates. Maximal degree in co-relation 1997. Up to 145 conditions per place. [2024-06-27 18:08:46,594 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 39 selfloop transitions, 16 changer transitions 28/88 dead transitions. [2024-06-27 18:08:46,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 593 flow [2024-06-27 18:08:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:08:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:08:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 18:08:46,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5724137931034483 [2024-06-27 18:08:46,595 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 221 flow. Second operand 10 states and 166 transitions. [2024-06-27 18:08:46,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 593 flow [2024-06-27 18:08:46,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 584 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 18:08:46,599 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 299 flow [2024-06-27 18:08:46,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=299, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2024-06-27 18:08:46,600 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2024-06-27 18:08:46,600 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 299 flow [2024-06-27 18:08:46,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:08:46,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:46,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:46,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:08:46,612 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:08:46,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash 424661039, now seen corresponding path program 2 times [2024-06-27 18:08:46,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969763867] [2024-06-27 18:08:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:46,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:46,703 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:08:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969763867] [2024-06-27 18:08:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969763867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:08:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591471681] [2024-06-27 18:08:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:46,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:08:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:46,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:08:46,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:08:46,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:46,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:08:46,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:46,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:46,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:46,901 INFO L124 PetriNetUnfolderBase]: 379/688 cut-off events. [2024-06-27 18:08:46,901 INFO L125 PetriNetUnfolderBase]: For 2598/2598 co-relation queries the response was YES. [2024-06-27 18:08:46,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 688 events. 379/688 cut-off events. For 2598/2598 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2887 event pairs, 106 based on Foata normal form. 18/699 useless extension candidates. Maximal degree in co-relation 2383. Up to 331 conditions per place. [2024-06-27 18:08:46,905 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 49 selfloop transitions, 14 changer transitions 25/93 dead transitions. [2024-06-27 18:08:46,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 703 flow [2024-06-27 18:08:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:08:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:08:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-27 18:08:46,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.567398119122257 [2024-06-27 18:08:46,907 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 299 flow. Second operand 11 states and 181 transitions. [2024-06-27 18:08:46,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 703 flow [2024-06-27 18:08:46,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 658 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-27 18:08:46,914 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 347 flow [2024-06-27 18:08:46,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=347, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2024-06-27 18:08:46,915 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2024-06-27 18:08:46,915 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 347 flow [2024-06-27 18:08:46,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:08:46,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:46,915 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:46,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:08:46,917 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:08:46,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1086242062, now seen corresponding path program 1 times [2024-06-27 18:08:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522619791] [2024-06-27 18:08:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522619791] [2024-06-27 18:08:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522619791] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:08:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031634833] [2024-06-27 18:08:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:47,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:08:47,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:47,011 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:08:47,025 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:08:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:47,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 18:08:47,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:08:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:47,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:08:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031634833] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:08:47,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:08:47,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-06-27 18:08:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202196853] [2024-06-27 18:08:47,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:08:47,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 18:08:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 18:08:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-06-27 18:08:47,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:47,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 347 flow. Second operand has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 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:08:47,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:47,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:47,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:47,649 INFO L124 PetriNetUnfolderBase]: 613/1103 cut-off events. [2024-06-27 18:08:47,649 INFO L125 PetriNetUnfolderBase]: For 5869/5869 co-relation queries the response was YES. [2024-06-27 18:08:47,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4117 conditions, 1103 events. 613/1103 cut-off events. For 5869/5869 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4743 event pairs, 64 based on Foata normal form. 45/1135 useless extension candidates. Maximal degree in co-relation 4085. Up to 247 conditions per place. [2024-06-27 18:08:47,655 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 31 changer transitions 56/156 dead transitions. [2024-06-27 18:08:47,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 156 transitions, 1287 flow [2024-06-27 18:08:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 18:08:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 18:08:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 313 transitions. [2024-06-27 18:08:47,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5680580762250453 [2024-06-27 18:08:47,657 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 347 flow. Second operand 19 states and 313 transitions. [2024-06-27 18:08:47,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 156 transitions, 1287 flow [2024-06-27 18:08:47,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 156 transitions, 1213 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-27 18:08:47,666 INFO L231 Difference]: Finished difference. Result has 85 places, 58 transitions, 640 flow [2024-06-27 18:08:47,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=640, PETRI_PLACES=85, PETRI_TRANSITIONS=58} [2024-06-27 18:08:47,668 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-27 18:08:47,668 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 58 transitions, 640 flow [2024-06-27 18:08:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 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:08:47,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:47,669 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:47,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 18:08:47,880 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:08:47,880 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:08:47,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash -916133962, now seen corresponding path program 1 times [2024-06-27 18:08:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988953982] [2024-06-27 18:08:47,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:08:48,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:48,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988953982] [2024-06-27 18:08:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988953982] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:08:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005226835] [2024-06-27 18:08:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:48,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:08:48,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:48,010 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:08:48,040 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:08:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:48,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 18:08:48,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:08:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:08:48,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:08:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:08:48,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005226835] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:08:48,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:08:48,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-27 18:08:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521871261] [2024-06-27 18:08:48,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:08:48,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 18:08:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 18:08:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-06-27 18:08:48,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:48,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 58 transitions, 640 flow. Second operand has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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:08:48,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:48,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:48,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:49,026 INFO L124 PetriNetUnfolderBase]: 1297/2391 cut-off events. [2024-06-27 18:08:49,026 INFO L125 PetriNetUnfolderBase]: For 21806/21806 co-relation queries the response was YES. [2024-06-27 18:08:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10407 conditions, 2391 events. 1297/2391 cut-off events. For 21806/21806 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12412 event pairs, 136 based on Foata normal form. 81/2465 useless extension candidates. Maximal degree in co-relation 10368. Up to 571 conditions per place. [2024-06-27 18:08:49,040 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 127 selfloop transitions, 64 changer transitions 91/287 dead transitions. [2024-06-27 18:08:49,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 287 transitions, 3105 flow [2024-06-27 18:08:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-06-27 18:08:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-06-27 18:08:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 523 transitions. [2024-06-27 18:08:49,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5635775862068966 [2024-06-27 18:08:49,043 INFO L175 Difference]: Start difference. First operand has 85 places, 58 transitions, 640 flow. Second operand 32 states and 523 transitions. [2024-06-27 18:08:49,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 287 transitions, 3105 flow [2024-06-27 18:08:49,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 287 transitions, 2339 flow, removed 363 selfloop flow, removed 11 redundant places. [2024-06-27 18:08:49,075 INFO L231 Difference]: Finished difference. Result has 123 places, 104 transitions, 1146 flow [2024-06-27 18:08:49,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1146, PETRI_PLACES=123, PETRI_TRANSITIONS=104} [2024-06-27 18:08:49,077 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 92 predicate places. [2024-06-27 18:08:49,077 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 104 transitions, 1146 flow [2024-06-27 18:08:49,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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:08:49,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:49,078 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:49,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-27 18:08:49,288 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:08:49,289 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:08:49,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -819172168, now seen corresponding path program 2 times [2024-06-27 18:08:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705376824] [2024-06-27 18:08:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:08:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705376824] [2024-06-27 18:08:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705376824] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:08:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884592698] [2024-06-27 18:08:49,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 18:08:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:08:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:49,400 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:08:49,416 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:08:49,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 18:08:49,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:08:49,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 18:08:49,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:08:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:08:49,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:08:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:08:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884592698] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:08:49,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:08:49,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-06-27 18:08:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107299684] [2024-06-27 18:08:49,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:08:49,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 18:08:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:49,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 18:08:49,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-06-27 18:08:49,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:49,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 104 transitions, 1146 flow. Second operand has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 18 states have internal predecessors, (205), 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:08:49,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:49,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:49,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:50,588 INFO L124 PetriNetUnfolderBase]: 1684/3112 cut-off events. [2024-06-27 18:08:50,588 INFO L125 PetriNetUnfolderBase]: For 81709/81709 co-relation queries the response was YES. [2024-06-27 18:08:50,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16470 conditions, 3112 events. 1684/3112 cut-off events. For 81709/81709 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 17263 event pairs, 56 based on Foata normal form. 117/3222 useless extension candidates. Maximal degree in co-relation 16414. Up to 607 conditions per place. [2024-06-27 18:08:50,609 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 124 selfloop transitions, 105 changer transitions 115/349 dead transitions. [2024-06-27 18:08:50,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 349 transitions, 4575 flow [2024-06-27 18:08:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-06-27 18:08:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-06-27 18:08:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 589 transitions. [2024-06-27 18:08:50,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564176245210728 [2024-06-27 18:08:50,614 INFO L175 Difference]: Start difference. First operand has 123 places, 104 transitions, 1146 flow. Second operand 36 states and 589 transitions. [2024-06-27 18:08:50,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 349 transitions, 4575 flow [2024-06-27 18:08:50,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 349 transitions, 3940 flow, removed 305 selfloop flow, removed 16 redundant places. [2024-06-27 18:08:50,816 INFO L231 Difference]: Finished difference. Result has 156 places, 139 transitions, 1938 flow [2024-06-27 18:08:50,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1938, PETRI_PLACES=156, PETRI_TRANSITIONS=139} [2024-06-27 18:08:50,817 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-27 18:08:50,817 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 139 transitions, 1938 flow [2024-06-27 18:08:50,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 18 states have internal predecessors, (205), 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:08:50,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:50,818 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:50,831 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:08:51,024 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:08:51,024 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:08:51,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1018056603, now seen corresponding path program 3 times [2024-06-27 18:08:51,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:51,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272076989] [2024-06-27 18:08:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272076989] [2024-06-27 18:08:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272076989] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:08:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535759925] [2024-06-27 18:08:51,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 18:08:51,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:08:51,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:51,173 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:08:51,175 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:08:51,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-06-27 18:08:51,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:08:51,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-27 18:08:51,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:08:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:51,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:08:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535759925] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:08:51,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:08:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16 [2024-06-27 18:08:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061476187] [2024-06-27 18:08:51,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:08:51,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 18:08:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 18:08:51,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-06-27 18:08:51,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:51,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 139 transitions, 1938 flow. Second operand has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 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:08:51,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:51,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:51,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:52,272 INFO L124 PetriNetUnfolderBase]: 1711/3174 cut-off events. [2024-06-27 18:08:52,272 INFO L125 PetriNetUnfolderBase]: For 106944/106944 co-relation queries the response was YES. [2024-06-27 18:08:52,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18061 conditions, 3174 events. 1711/3174 cut-off events. For 106944/106944 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 17584 event pairs, 94 based on Foata normal form. 18/3185 useless extension candidates. Maximal degree in co-relation 17991. Up to 601 conditions per place. [2024-06-27 18:08:52,308 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 114 selfloop transitions, 107 changer transitions 51/277 dead transitions. [2024-06-27 18:08:52,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 277 transitions, 4070 flow [2024-06-27 18:08:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-06-27 18:08:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-06-27 18:08:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 391 transitions. [2024-06-27 18:08:52,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5617816091954023 [2024-06-27 18:08:52,311 INFO L175 Difference]: Start difference. First operand has 156 places, 139 transitions, 1938 flow. Second operand 24 states and 391 transitions. [2024-06-27 18:08:52,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 277 transitions, 4070 flow [2024-06-27 18:08:52,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 277 transitions, 3368 flow, removed 324 selfloop flow, removed 20 redundant places. [2024-06-27 18:08:52,526 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 2149 flow [2024-06-27 18:08:52,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2149, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-06-27 18:08:52,526 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 129 predicate places. [2024-06-27 18:08:52,527 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 2149 flow [2024-06-27 18:08:52,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 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:08:52,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:52,527 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:52,541 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:08:52,739 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:08:52,739 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:08:52,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1578246907, now seen corresponding path program 4 times [2024-06-27 18:08:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245610177] [2024-06-27 18:08:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:08:52,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 18:08:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:08:52,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 18:08:52,822 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 18:08:52,823 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 18:08:52,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 18:08:52,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 18:08:52,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 18:08:52,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 18:08:52,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:08:52,825 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:52,830 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 18:08:52,830 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 18:08:52,901 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 18:08:52,902 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 18:08:52,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 06:08:52 BasicIcfg [2024-06-27 18:08:52,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 18:08:52,903 INFO L158 Benchmark]: Toolchain (without parser) took 9698.10ms. Allocated memory was 146.8MB in the beginning and 306.2MB in the end (delta: 159.4MB). Free memory was 104.4MB in the beginning and 186.9MB in the end (delta: -82.5MB). Peak memory consumption was 203.4MB. Max. memory is 16.1GB. [2024-06-27 18:08:52,903 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 107.0MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:08:52,903 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 107.0MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:08:52,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.97ms. Allocated memory is still 146.8MB. Free memory was 104.4MB in the beginning and 79.8MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-27 18:08:52,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 146.8MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 18:08:52,904 INFO L158 Benchmark]: Boogie Preprocessor took 65.33ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 18:08:52,904 INFO L158 Benchmark]: RCFGBuilder took 412.94ms. Allocated memory is still 146.8MB. Free memory was 76.1MB in the beginning and 55.7MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 18:08:52,904 INFO L158 Benchmark]: TraceAbstraction took 8688.80ms. Allocated memory was 146.8MB in the beginning and 306.2MB in the end (delta: 159.4MB). Free memory was 55.2MB in the beginning and 186.9MB in the end (delta: -131.7MB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. [2024-06-27 18:08:52,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 107.0MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.75ms. Allocated memory is still 107.0MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.97ms. Allocated memory is still 146.8MB. Free memory was 104.4MB in the beginning and 79.8MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 146.8MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.33ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.94ms. Allocated memory is still 146.8MB. Free memory was 76.1MB in the beginning and 55.7MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8688.80ms. Allocated memory was 146.8MB in the beginning and 306.2MB in the end (delta: 159.4MB). Free memory was 55.2MB in the beginning and 186.9MB in the end (delta: -131.7MB). Peak memory consumption was 153.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] 0 //@ ghost multithreaded = 1; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] 0 //@ assert ((!multithreaded || ((4 <= j) && ((j % 2) == 0))) && (!multithreaded || ((3 <= i) && ((i % 2) == 1)))); [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L715] 0 //@ assert ((!multithreaded || ((4 <= j) && ((j % 2) == 0))) && (!multithreaded || ((3 <= i) && ((i % 2) == 1)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, i=13, id1=-1, id2=0, j=14, k=4, k=4] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=13, id1=-1, id2=0, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.5s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1742 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1661 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3622 IncrementalHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 9 mSDtfsCounter, 3622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 209 SyntacticMatches, 8 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2149occurred in iteration=11, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 1718 SizeOfPredicates, 26 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 9/231 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 18:08:52,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE