./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c --full-output --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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.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 ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:32:30,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:32:30,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:32:30,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:32:30,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:32:30,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:32:30,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:32:30,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:32:30,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:32:30,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:32:30,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:32:30,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:32:30,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:32:30,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:32:30,957 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:32:30,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:32:30,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:32:30,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:32:30,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:32:30,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:32:30,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:32:30,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:32:30,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:32:30,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:32:30,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:32:30,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:32:30,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:32:30,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:32:30,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:32:30,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:32:30,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:32:30,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:32:30,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:32:30,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:32:30,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:32:30,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:32:30,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:32:30,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:32:30,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:32:30,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:32:30,963 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:32:30,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:32:30,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:32:30,964 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 -> ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 [2024-06-27 17:32:31,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:32:31,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:32:31,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:32:31,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:32:31,179 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:32:31,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-06-27 17:32:32,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:32:32,367 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:32:32,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-06-27 17:32:32,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71b6bfee/96e5eb94790f420aa691d092d280b5ee/FLAG32adb3217 [2024-06-27 17:32:32,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71b6bfee/96e5eb94790f420aa691d092d280b5ee [2024-06-27 17:32:32,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:32:32,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:32:32,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:32:32,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:32:32,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:32:32,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30fb4c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32, skipping insertion in model container [2024-06-27 17:32:32,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,411 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:32:32,568 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-06-27 17:32:32,576 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:32:32,583 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:32:32,620 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-06-27 17:32:32,624 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:32:32,639 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:32:32,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32 WrapperNode [2024-06-27 17:32:32,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:32:32,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:32:32,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:32:32,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:32:32,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,699 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2024-06-27 17:32:32,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:32:32,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:32:32,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:32:32,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:32:32,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,728 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:32:32,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:32:32,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:32:32,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:32:32,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:32:32,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (1/1) ... [2024-06-27 17:32:32,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:32:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:32,781 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 17:32:32,819 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 17:32:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:32:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:32:32,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:32:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:32:32,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:32:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:32:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:32:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:32:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:32:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:32:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:32:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:32:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:32:32,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:32:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:32:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:32:32,855 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 17:32:32,932 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:32:32,934 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:32:33,151 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:32:33,152 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:32:33,282 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:32:33,282 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:32:33,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:32:33 BoogieIcfgContainer [2024-06-27 17:32:33,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:32:33,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:32:33,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:32:33,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:32:33,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:32:32" (1/3) ... [2024-06-27 17:32:33,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6dd713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:32:33, skipping insertion in model container [2024-06-27 17:32:33,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:32:32" (2/3) ... [2024-06-27 17:32:33,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6dd713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:32:33, skipping insertion in model container [2024-06-27 17:32:33,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:32:33" (3/3) ... [2024-06-27 17:32:33,289 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-06-27 17:32:33,295 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:32:33,302 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:32:33,302 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:32:33,303 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:32:33,340 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:32:33,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 66 flow [2024-06-27 17:32:33,398 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-06-27 17:32:33,399 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:32:33,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 3/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2024-06-27 17:32:33,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 66 flow [2024-06-27 17:32:33,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 23 transitions, 58 flow [2024-06-27 17:32:33,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:32:33,414 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=true, 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;@4a0a656a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:32:33,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:32:33,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:32:33,421 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-06-27 17:32:33,421 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:32:33,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:33,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:32:33,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:32:33,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -909110588, now seen corresponding path program 1 times [2024-06-27 17:32:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:33,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599377836] [2024-06-27 17:32:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:33,758 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 17:32:33,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:33,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599377836] [2024-06-27 17:32:33,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599377836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:32:33,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:32:33,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:32:33,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754845672] [2024-06-27 17:32:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:33,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:32:33,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:32:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:32:33,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2024-06-27 17:32:33,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:33,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:33,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2024-06-27 17:32:33,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:33,931 INFO L124 PetriNetUnfolderBase]: 147/279 cut-off events. [2024-06-27 17:32:33,931 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-06-27 17:32:33,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 279 events. 147/279 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1049 event pairs, 42 based on Foata normal form. 1/278 useless extension candidates. Maximal degree in co-relation 501. Up to 168 conditions per place. [2024-06-27 17:32:33,935 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 29 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2024-06-27 17:32:33,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 36 transitions, 159 flow [2024-06-27 17:32:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:32:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:32:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-27 17:32:33,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2024-06-27 17:32:33,946 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 58 flow. Second operand 3 states and 49 transitions. [2024-06-27 17:32:33,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 36 transitions, 159 flow [2024-06-27 17:32:33,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 36 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:32:33,950 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 69 flow [2024-06-27 17:32:33,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2024-06-27 17:32:33,955 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2024-06-27 17:32:33,955 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 69 flow [2024-06-27 17:32:33,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:32:33,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:33,955 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 17:32:33,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:32:33,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:32:33,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash -553407121, now seen corresponding path program 1 times [2024-06-27 17:32:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091007070] [2024-06-27 17:32:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091007070] [2024-06-27 17:32:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091007070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:32:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:32:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:32:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794750214] [2024-06-27 17:32:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:34,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:34,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:32:34,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-06-27 17:32:34,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:34,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:34,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-06-27 17:32:34,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:34,225 INFO L124 PetriNetUnfolderBase]: 208/434 cut-off events. [2024-06-27 17:32:34,225 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-06-27 17:32:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 434 events. 208/434 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1966 event pairs, 144 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 380. Up to 249 conditions per place. [2024-06-27 17:32:34,228 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 36 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2024-06-27 17:32:34,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 202 flow [2024-06-27 17:32:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-27 17:32:34,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-06-27 17:32:34,230 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 69 flow. Second operand 5 states and 72 transitions. [2024-06-27 17:32:34,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 202 flow [2024-06-27 17:32:34,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:32:34,232 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 102 flow [2024-06-27 17:32:34,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2024-06-27 17:32:34,233 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2024-06-27 17:32:34,233 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 102 flow [2024-06-27 17:32:34,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:34,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:34,233 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 17:32:34,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:32:34,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:32:34,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1680081727, now seen corresponding path program 1 times [2024-06-27 17:32:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:34,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994568314] [2024-06-27 17:32:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:32:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994568314] [2024-06-27 17:32:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994568314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:32:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:32:34,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:32:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140918892] [2024-06-27 17:32:34,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:34,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:34,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:34,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:34,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:32:34,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-06-27 17:32:34,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:34,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:34,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-06-27 17:32:34,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:34,486 INFO L124 PetriNetUnfolderBase]: 169/328 cut-off events. [2024-06-27 17:32:34,486 INFO L125 PetriNetUnfolderBase]: For 91/111 co-relation queries the response was YES. [2024-06-27 17:32:34,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 328 events. 169/328 cut-off events. For 91/111 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1272 event pairs, 124 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 604. Up to 250 conditions per place. [2024-06-27 17:32:34,489 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 18 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2024-06-27 17:32:34,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 209 flow [2024-06-27 17:32:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2024-06-27 17:32:34,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-06-27 17:32:34,493 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 102 flow. Second operand 5 states and 66 transitions. [2024-06-27 17:32:34,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 209 flow [2024-06-27 17:32:34,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 205 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:32:34,497 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 90 flow [2024-06-27 17:32:34,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2024-06-27 17:32:34,498 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2024-06-27 17:32:34,499 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 90 flow [2024-06-27 17:32:34,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:34,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:34,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:32:34,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:32:34,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:32:34,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash -394227253, now seen corresponding path program 1 times [2024-06-27 17:32:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497619808] [2024-06-27 17:32:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497619808] [2024-06-27 17:32:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497619808] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558946133] [2024-06-27 17:32:34,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:34,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:34,592 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 17:32:34,620 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 17:32:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:34,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:32:34,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:34,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558946133] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:32:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-06-27 17:32:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531911294] [2024-06-27 17:32:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:32:34,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-06-27 17:32:34,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:34,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:34,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-06-27 17:32:34,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:34,891 INFO L124 PetriNetUnfolderBase]: 143/271 cut-off events. [2024-06-27 17:32:34,891 INFO L125 PetriNetUnfolderBase]: For 61/81 co-relation queries the response was YES. [2024-06-27 17:32:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 271 events. 143/271 cut-off events. For 61/81 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1030 event pairs, 42 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 644. Up to 138 conditions per place. [2024-06-27 17:32:34,894 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 22 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2024-06-27 17:32:34,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 165 flow [2024-06-27 17:32:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-06-27 17:32:34,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-06-27 17:32:34,896 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 90 flow. Second operand 5 states and 58 transitions. [2024-06-27 17:32:34,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 165 flow [2024-06-27 17:32:34,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 141 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 17:32:34,899 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 95 flow [2024-06-27 17:32:34,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-27 17:32:34,900 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2024-06-27 17:32:34,901 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 95 flow [2024-06-27 17:32:34,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:34,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:34,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:32:34,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:32:35,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:35,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:32:35,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1818183591, now seen corresponding path program 1 times [2024-06-27 17:32:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902439090] [2024-06-27 17:32:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:32:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902439090] [2024-06-27 17:32:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902439090] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560674787] [2024-06-27 17:32:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:32:35,195 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 17:32:35,223 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 17:32:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:32:35,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:32:35,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:32:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:35,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:32:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:32:35,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560674787] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:32:35,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:32:35,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-06-27 17:32:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064213849] [2024-06-27 17:32:35,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:32:35,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:32:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:32:35,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:32:35,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:32:35,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2024-06-27 17:32:35,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:35,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:32:35,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2024-06-27 17:32:35,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:32:35,405 INFO L124 PetriNetUnfolderBase]: 144/285 cut-off events. [2024-06-27 17:32:35,406 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-06-27 17:32:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 285 events. 144/285 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1054 event pairs, 46 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 663. Up to 139 conditions per place. [2024-06-27 17:32:35,408 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 23 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-27 17:32:35,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 178 flow [2024-06-27 17:32:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:32:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:32:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2024-06-27 17:32:35,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45384615384615384 [2024-06-27 17:32:35,409 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 95 flow. Second operand 5 states and 59 transitions. [2024-06-27 17:32:35,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 178 flow [2024-06-27 17:32:35,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:32:35,410 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 112 flow [2024-06-27 17:32:35,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-06-27 17:32:35,411 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2024-06-27 17:32:35,411 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 112 flow [2024-06-27 17:32:35,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 17:32:35,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:32:35,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:32:35,436 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 17:32:35,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:32:35,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:32:35,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:32:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1425929380, now seen corresponding path program 1 times [2024-06-27 17:32:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:32:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496333156] [2024-06-27 17:32:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:32:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:32:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:32:35,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:32:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:32:35,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:32:35,697 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:32:35,698 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-06-27 17:32:35,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-06-27 17:32:35,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-06-27 17:32:35,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:32:35,703 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-06-27 17:32:35,707 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:32:35,707 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:32:35,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:32:35 BasicIcfg [2024-06-27 17:32:35,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:32:35,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:32:35,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:32:35,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:32:35,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:32:33" (3/4) ... [2024-06-27 17:32:35,764 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:32:35,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:32:35,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:32:35,822 INFO L158 Benchmark]: Toolchain (without parser) took 3434.98ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 83.0MB in the beginning and 127.6MB in the end (delta: -44.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:32:35,822 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:32:35,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.31ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 124.3MB in the end (delta: -41.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-06-27 17:32:35,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 124.3MB in the beginning and 161.5MB in the end (delta: -37.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:32:35,823 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 159.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:32:35,823 INFO L158 Benchmark]: RCFGBuilder took 543.45ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 117.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-06-27 17:32:35,824 INFO L158 Benchmark]: TraceAbstraction took 2478.05ms. Allocated memory is still 190.8MB. Free memory was 116.4MB in the beginning and 133.9MB in the end (delta: -17.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:32:35,824 INFO L158 Benchmark]: Witness Printer took 59.18ms. Allocated memory is still 190.8MB. Free memory was 133.9MB in the beginning and 127.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 17:32:35,825 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.31ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 124.3MB in the end (delta: -41.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.93ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 124.3MB in the beginning and 161.5MB in the end (delta: -37.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 159.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.45ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 117.4MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2478.05ms. Allocated memory is still 190.8MB. Free memory was 116.4MB in the beginning and 133.9MB in the end (delta: -17.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.18ms. Allocated memory is still 190.8MB. Free memory was 133.9MB in the beginning and 127.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1=2147483646] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1=2147483646, t2=2147483647] [L62] 2 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L49] 1 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=3, i=0, tmp=3] [L67] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=0, tmp=-3] [L49] 1 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-3, i=1] [L49] COND FALSE 1 !(i