./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:56:23,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:56:23,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:56:23,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:56:23,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:56:23,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:56:23,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:56:23,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:56:23,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:56:23,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:56:23,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:56:23,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:56:23,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:56:23,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:56:23,494 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:56:23,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:56:23,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:56:23,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:56:23,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:56:23,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:56:23,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:56:23,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:56:23,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:56:23,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:56:23,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:56:23,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:56:23,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:56:23,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:56:23,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:56:23,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:56:23,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:56:23,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:56:23,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:56:23,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:56:23,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:56:23,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:56:23,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:56:23,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:56:23,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:56:23,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:56:23,502 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:56:23,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:56:23,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:56:23,503 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:56:23,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:56:23,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:56:23,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:56:23,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:56:23,799 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:56:23,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2024-02-19 14:56:25,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:56:25,234 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:56:25,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2024-02-19 14:56:25,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46c96104/93d4f2048b2848b48570fae5013a03e1/FLAG762f00606 [2024-02-19 14:56:25,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46c96104/93d4f2048b2848b48570fae5013a03e1 [2024-02-19 14:56:25,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:56:25,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:56:25,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:56:25,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:56:25,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:56:25,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af52a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25, skipping insertion in model container [2024-02-19 14:56:25,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,303 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:56:25,504 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2024-02-19 14:56:25,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:56:25,531 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:56:25,567 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2024-02-19 14:56:25,570 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:56:25,585 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:56:25,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25 WrapperNode [2024-02-19 14:56:25,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:56:25,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:56:25,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:56:25,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:56:25,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,650 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-02-19 14:56:25,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:56:25,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:56:25,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:56:25,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:56:25,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,699 INFO L175 MemorySlicer]: Split 20 memory accesses to 6 slices as follows [2, 2, 10, 2, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 2, 1, 1, 1]. [2024-02-19 14:56:25,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:56:25,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:56:25,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:56:25,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:56:25,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (1/1) ... [2024-02-19 14:56:25,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:56:25,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:56:25,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 14:56:25,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 14:56:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:56:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:56:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:56:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:56:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:56:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:56:25,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:56:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-19 14:56:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:56:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:56:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:56:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:56:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:56:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-19 14:56:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:56:25,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:56:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:56:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:56:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:56:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:56:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-19 14:56:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-19 14:56:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:56:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:56:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:56:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:56:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:56:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-19 14:56:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:56:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:56:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 14:56:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:56:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:56:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:56:25,832 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:56:25,967 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:56:25,969 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:56:26,320 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:56:26,321 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:56:26,519 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:56:26,519 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 14:56:26,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:56:26 BoogieIcfgContainer [2024-02-19 14:56:26,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:56:26,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:56:26,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:56:26,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:56:26,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:56:25" (1/3) ... [2024-02-19 14:56:26,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff6bf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:56:26, skipping insertion in model container [2024-02-19 14:56:26,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:56:25" (2/3) ... [2024-02-19 14:56:26,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff6bf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:56:26, skipping insertion in model container [2024-02-19 14:56:26,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:56:26" (3/3) ... [2024-02-19 14:56:26,528 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2024-02-19 14:56:26,546 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:56:26,546 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:56:26,547 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:56:26,615 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-19 14:56:26,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 120 flow [2024-02-19 14:56:26,680 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2024-02-19 14:56:26,680 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:56:26,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 42 events. 4/42 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-02-19 14:56:26,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 120 flow [2024-02-19 14:56:26,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 41 transitions, 106 flow [2024-02-19 14:56:26,702 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:56:26,708 INFO L369 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@bbf6485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:56:26,708 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:56:26,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:56:26,722 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-02-19 14:56:26,722 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:56:26,722 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:56:26,723 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:56:26,723 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:56:26,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:56:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 412258180, now seen corresponding path program 1 times [2024-02-19 14:56:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:56:26,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146596722] [2024-02-19 14:56:26,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:56:26,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:56:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:56:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:56:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:56:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146596722] [2024-02-19 14:56:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146596722] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:56:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:56:27,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:56:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565572081] [2024-02-19 14:56:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:56:27,150 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:56:27,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:56:27,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:56:27,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:56:27,205 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:56:27,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:27,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:56:27,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:56:27,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:56:27,872 INFO L124 PetriNetUnfolderBase]: 3334/4776 cut-off events. [2024-02-19 14:56:27,872 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2024-02-19 14:56:27,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9584 conditions, 4776 events. 3334/4776 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 25839 event pairs, 1640 based on Foata normal form. 146/4881 useless extension candidates. Maximal degree in co-relation 8540. Up to 3125 conditions per place. [2024-02-19 14:56:27,910 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-02-19 14:56:27,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 247 flow [2024-02-19 14:56:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:56:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:56:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-02-19 14:56:27,923 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5543478260869565 [2024-02-19 14:56:27,926 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-02-19 14:56:27,926 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 58 transitions, 247 flow [2024-02-19 14:56:27,926 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:27,926 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:56:27,927 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:56:27,927 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:56:27,927 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:56:27,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:56:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 524795066, now seen corresponding path program 1 times [2024-02-19 14:56:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:56:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009091805] [2024-02-19 14:56:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:56:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:56:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:56:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:56:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:56:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009091805] [2024-02-19 14:56:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009091805] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:56:28,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:56:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:56:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210065132] [2024-02-19 14:56:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:56:28,066 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:56:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:56:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:56:28,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:56:28,076 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:56:28,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:28,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:56:28,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:56:28,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:56:28,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3NotInUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 6#L113-3true, 46#L56-4true]) [2024-02-19 14:56:28,330 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:56:28,331 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:56:28,331 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:56:28,331 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:56:28,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse0 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse1 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse2 (select .cse0 .cse1))) (and (= |v_#memory_int#2_79| (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse0 .cse1 (+ .cse2 1)))) (not (= (ite (< .cse2 2147483647) 1 0) 0))))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3NotInUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 6#L113-3true, 46#L56-4true]) [2024-02-19 14:56:28,365 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,365 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:56:28,365 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,365 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:56:28,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:56:28,367 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,367 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:56:28,367 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,367 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:56:28,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse0 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse1 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse2 (select .cse0 .cse1))) (and (= |v_#memory_int#2_79| (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse0 .cse1 (+ .cse2 1)))) (not (= (ite (< .cse2 2147483647) 1 0) 0))))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 46#L56-4true]) [2024-02-19 14:56:28,402 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:56:28,402 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:56:28,402 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:56:28,402 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:56:28,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 37#L114-1true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:56:28,404 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:56:28,404 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:56:28,404 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:56:28,404 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:56:28,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse0 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse1 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse2 (select .cse0 .cse1))) (and (= |v_#memory_int#2_79| (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse0 .cse1 (+ .cse2 1)))) (not (= (ite (< .cse2 2147483647) 1 0) 0))))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, 27#$Ultimate##0true, thread2Thread1of1ForFork0InUse, 37#L114-1true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 46#L56-4true]) [2024-02-19 14:56:28,468 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:56:28,468 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:56:28,468 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:56:28,469 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:56:28,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse0 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse1 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse2 (select .cse0 .cse1))) (and (= |v_#memory_int#2_79| (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse0 .cse1 (+ .cse2 1)))) (not (= (ite (< .cse2 2147483647) 1 0) 0))))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 12#L74-4true, 46#L56-4true]) [2024-02-19 14:56:28,471 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:56:28,471 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,471 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,471 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:56:28,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), thread2Thread1of1ForFork0InUse, 15#L113-4true, thread4Thread1of1ForFork3InUse, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 12#L74-4true, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:56:28,471 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:56:28,472 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:56:28,472 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:56:28,472 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:56:28,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([506] L85-->L88: Formula: (let ((.cse0 (select |v_#memory_int#2_80| v_~A~0.base_92)) (.cse1 (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_92))) (let ((.cse2 (select .cse0 .cse1))) (and (= |v_#memory_int#2_79| (store |v_#memory_int#2_80| v_~A~0.base_92 (store .cse0 .cse1 (+ .cse2 1)))) (not (= (ite (< .cse2 2147483647) 1 0) 0))))) InVars {~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, #memory_int#2=|v_#memory_int#2_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_92, ~A~0.offset=v_~A~0.offset_92, thread3Thread1of1ForFork1_#t~post14#1=|v_thread3Thread1of1ForFork1_#t~post14#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_1|, #memory_int#2=|v_#memory_int#2_79|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post14#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, #memory_int#2, thread3Thread1of1ForFork1_#t~mem12#1][53], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), 40#L88true, thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3InUse, 37#L114-1true, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 46#L56-4true]) [2024-02-19 14:56:28,508 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-02-19 14:56:28,508 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:56:28,509 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:56:28,509 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:56:28,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([505] L84-4-->thread3EXIT: Formula: (and (<= v_~N~0_41 |v_thread3Thread1of1ForFork1_~i~2#1_5|) (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_41} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, ~N~0=v_~N~0_41, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_~i~2#1][52], [65#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork2_~i~0 0)), thread2Thread1of1ForFork0InUse, thread4Thread1of1ForFork3InUse, 37#L114-1true, 61#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)), 2#thread4EXITtrue, thread3Thread1of1ForFork1InUse, 12#L74-4true, thread1Thread1of1ForFork2InUse, 31#thread3EXITtrue, 46#L56-4true]) [2024-02-19 14:56:28,509 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:56:28,509 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,509 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:56:28,510 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:56:28,758 INFO L124 PetriNetUnfolderBase]: 4347/6305 cut-off events. [2024-02-19 14:56:28,759 INFO L125 PetriNetUnfolderBase]: For 2069/2204 co-relation queries the response was YES. [2024-02-19 14:56:28,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18077 conditions, 6305 events. 4347/6305 cut-off events. For 2069/2204 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 34543 event pairs, 1645 based on Foata normal form. 232/6490 useless extension candidates. Maximal degree in co-relation 16572. Up to 4050 conditions per place. [2024-02-19 14:56:28,851 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 75 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2024-02-19 14:56:28,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 540 flow [2024-02-19 14:56:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:56:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:56:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-02-19 14:56:28,853 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5543478260869565 [2024-02-19 14:56:28,853 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-02-19 14:56:28,854 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 88 transitions, 540 flow [2024-02-19 14:56:28,854 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:28,854 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:56:28,854 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:56:28,854 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:56:28,854 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:56:28,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:56:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 386795485, now seen corresponding path program 1 times [2024-02-19 14:56:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:56:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165895323] [2024-02-19 14:56:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:56:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:56:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:56:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:56:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:56:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165895323] [2024-02-19 14:56:28,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165895323] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:56:28,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:56:28,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:56:28,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100179749] [2024-02-19 14:56:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:56:28,955 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:56:28,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:56:28,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:56:28,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:56:28,973 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:56:28,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 88 transitions, 540 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:28,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:56:28,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:56:28,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:56:29,942 INFO L124 PetriNetUnfolderBase]: 6118/8923 cut-off events. [2024-02-19 14:56:29,943 INFO L125 PetriNetUnfolderBase]: For 9637/9873 co-relation queries the response was YES. [2024-02-19 14:56:29,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32972 conditions, 8923 events. 6118/8923 cut-off events. For 9637/9873 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 51225 event pairs, 1559 based on Foata normal form. 480/9364 useless extension candidates. Maximal degree in co-relation 30275. Up to 5565 conditions per place. [2024-02-19 14:56:30,044 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 127 selfloop transitions, 6 changer transitions 0/142 dead transitions. [2024-02-19 14:56:30,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 142 transitions, 1151 flow [2024-02-19 14:56:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:56:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:56:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-02-19 14:56:30,046 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5597826086956522 [2024-02-19 14:56:30,047 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-02-19 14:56:30,047 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 142 transitions, 1151 flow [2024-02-19 14:56:30,048 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:30,048 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:56:30,048 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:56:30,048 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:56:30,049 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:56:30,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:56:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2106135688, now seen corresponding path program 1 times [2024-02-19 14:56:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:56:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268340836] [2024-02-19 14:56:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:56:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:56:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:56:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:56:30,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:56:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268340836] [2024-02-19 14:56:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268340836] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:56:30,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:56:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:56:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578318428] [2024-02-19 14:56:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:56:30,212 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:56:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:56:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:56:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:56:30,214 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-02-19 14:56:30,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 142 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:30,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:56:30,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-02-19 14:56:30,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:56:31,179 INFO L124 PetriNetUnfolderBase]: 6172/9024 cut-off events. [2024-02-19 14:56:31,179 INFO L125 PetriNetUnfolderBase]: For 19204/19534 co-relation queries the response was YES. [2024-02-19 14:56:31,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40854 conditions, 9024 events. 6172/9024 cut-off events. For 19204/19534 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 52150 event pairs, 1685 based on Foata normal form. 120/9105 useless extension candidates. Maximal degree in co-relation 37502. Up to 7578 conditions per place. [2024-02-19 14:56:31,263 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 131 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2024-02-19 14:56:31,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 143 transitions, 1425 flow [2024-02-19 14:56:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:56:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:56:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-02-19 14:56:31,265 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2024-02-19 14:56:31,265 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-02-19 14:56:31,266 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 143 transitions, 1425 flow [2024-02-19 14:56:31,266 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:31,266 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:56:31,266 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:56:31,266 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:56:31,267 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:56:31,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:56:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1093007264, now seen corresponding path program 1 times [2024-02-19 14:56:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:56:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53404662] [2024-02-19 14:56:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:56:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:56:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:56:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:56:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:56:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53404662] [2024-02-19 14:56:31,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53404662] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:56:31,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508800131] [2024-02-19 14:56:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:56:31,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:56:31,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:56:31,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:56:31,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 14:56:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:56:31,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjunts are in the unsatisfiable core [2024-02-19 14:56:31,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:56:32,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 14:56:32,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-19 14:56:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:56:32,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:56:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:56:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508800131] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:56:32,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:56:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 22 [2024-02-19 14:56:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434110335] [2024-02-19 14:56:32,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:56:32,770 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-02-19 14:56:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:56:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-02-19 14:56:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-02-19 14:56:32,830 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-02-19 14:56:32,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 143 transitions, 1425 flow. Second operand has 22 states, 22 states have (on average 15.454545454545455) internal successors, (340), 22 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:32,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:56:32,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-02-19 14:56:32,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:56:42,210 INFO L124 PetriNetUnfolderBase]: 55380/80594 cut-off events. [2024-02-19 14:56:42,210 INFO L125 PetriNetUnfolderBase]: For 176278/177468 co-relation queries the response was YES. [2024-02-19 14:56:42,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423376 conditions, 80594 events. 55380/80594 cut-off events. For 176278/177468 co-relation queries the response was YES. Maximal size of possible extension queue 3159. Compared 604668 event pairs, 893 based on Foata normal form. 660/81216 useless extension candidates. Maximal degree in co-relation 416156. Up to 64959 conditions per place. [2024-02-19 14:56:42,892 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 769 selfloop transitions, 126 changer transitions 913/1815 dead transitions. [2024-02-19 14:56:42,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 1815 transitions, 22043 flow [2024-02-19 14:56:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-02-19 14:56:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2024-02-19 14:56:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1113 transitions. [2024-02-19 14:56:42,900 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-02-19 14:56:42,904 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2024-02-19 14:56:42,904 INFO L507 AbstractCegarLoop]: Abstraction has has 102 places, 1815 transitions, 22043 flow [2024-02-19 14:56:42,905 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 15.454545454545455) internal successors, (340), 22 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:42,905 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:56:42,905 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:56:42,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 14:56:43,123 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:56:43,124 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:56:43,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:56:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 362681906, now seen corresponding path program 2 times [2024-02-19 14:56:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:56:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799085476] [2024-02-19 14:56:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:56:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:56:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:56:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 14:56:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:56:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799085476] [2024-02-19 14:56:43,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799085476] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:56:43,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:56:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:56:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616139621] [2024-02-19 14:56:43,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:56:43,403 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:56:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:56:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:56:43,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:56:43,409 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-02-19 14:56:43,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 1815 transitions, 22043 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:56:43,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:56:43,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-02-19 14:56:43,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:57:03,720 INFO L124 PetriNetUnfolderBase]: 82462/118883 cut-off events. [2024-02-19 14:57:03,721 INFO L125 PetriNetUnfolderBase]: For 394509/396595 co-relation queries the response was YES. [2024-02-19 14:57:04,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726348 conditions, 118883 events. 82462/118883 cut-off events. For 394509/396595 co-relation queries the response was YES. Maximal size of possible extension queue 4468. Compared 913963 event pairs, 353 based on Foata normal form. 762/119617 useless extension candidates. Maximal degree in co-relation 716958. Up to 96377 conditions per place. [2024-02-19 14:57:04,807 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 645 selfloop transitions, 2 changer transitions 2865/3528 dead transitions. [2024-02-19 14:57:04,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 3528 transitions, 49994 flow [2024-02-19 14:57:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:57:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:57:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-02-19 14:57:04,809 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6130434782608696 [2024-02-19 14:57:04,809 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2024-02-19 14:57:04,810 INFO L507 AbstractCegarLoop]: Abstraction has has 106 places, 3528 transitions, 49994 flow [2024-02-19 14:57:04,810 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:57:04,811 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:57:04,811 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:57:04,811 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:57:04,811 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:57:04,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:57:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1760284662, now seen corresponding path program 3 times [2024-02-19 14:57:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:57:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236823143] [2024-02-19 14:57:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:57:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:57:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:57:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:57:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:57:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236823143] [2024-02-19 14:57:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236823143] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:57:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79036285] [2024-02-19 14:57:05,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:57:05,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:57:05,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:57:05,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:57:05,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 14:57:05,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 14:57:05,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:57:05,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 14:57:05,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:57:05,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:57:05,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 38 [2024-02-19 14:57:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:57:05,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:57:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:57:05,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79036285] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 14:57:05,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 14:57:05,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-02-19 14:57:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413141016] [2024-02-19 14:57:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:57:05,645 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:57:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:57:05,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:57:05,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-02-19 14:57:05,649 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:57:05,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 3528 transitions, 49994 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:57:05,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:57:05,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:57:05,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand