./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:28:20,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:28:20,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:28:20,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:28:20,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:28:20,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:28:20,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:28:20,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:28:20,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:28:20,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:28:20,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:28:20,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:28:20,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:28:20,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:28:20,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:28:20,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:28:20,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:28:20,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:28:20,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:28:20,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:28:20,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:28:20,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:28:20,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:28:20,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:28:20,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:28:20,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:28:20,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:28:20,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:28:20,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:28:20,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:28:20,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:28:20,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:28:20,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:28:20,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:28:20,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:28:20,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:28:20,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:28:20,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:28:20,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:28:20,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:28:20,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:28:20,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:28:20,643 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-16 19:28:20,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:28:20,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:28:20,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:28:20,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:28:20,939 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:28:20,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-16 19:28:22,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:28:22,588 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:28:22,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-16 19:28:22,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f79de3e/2b767fe59eaa4d36868aed91cabc3019/FLAGf569d5052 [2024-11-16 19:28:22,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f79de3e/2b767fe59eaa4d36868aed91cabc3019 [2024-11-16 19:28:22,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:28:22,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:28:22,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:28:22,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:28:22,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:28:22,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:22,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66549904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22, skipping insertion in model container [2024-11-16 19:28:22,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:22,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:28:22,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2024-11-16 19:28:22,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:28:22,912 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:28:22,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2024-11-16 19:28:22,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:28:22,994 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:28:22,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22 WrapperNode [2024-11-16 19:28:22,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:28:22,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:28:22,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:28:23,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:28:23,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,040 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 131 [2024-11-16 19:28:23,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:28:23,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:28:23,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:28:23,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:28:23,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,075 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-11-16 19:28:23,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:28:23,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:28:23,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:28:23,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:28:23,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (1/1) ... [2024-11-16 19:28:23,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:28:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:28:23,135 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-11-16 19:28:23,138 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-11-16 19:28:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:28:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 19:28:23,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 19:28:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 19:28:23,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 19:28:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:28:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 19:28:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 19:28:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 19:28:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 19:28:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:28:23,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:28:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 19:28:23,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 19:28:23,191 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:28:23,310 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:28:23,312 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:28:23,565 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:28:23,566 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:28:23,800 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:28:23,800 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:28:23,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:28:23 BoogieIcfgContainer [2024-11-16 19:28:23,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:28:23,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:28:23,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:28:23,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:28:23,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:28:22" (1/3) ... [2024-11-16 19:28:23,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3004e69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:28:23, skipping insertion in model container [2024-11-16 19:28:23,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:28:22" (2/3) ... [2024-11-16 19:28:23,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3004e69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:28:23, skipping insertion in model container [2024-11-16 19:28:23,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:28:23" (3/3) ... [2024-11-16 19:28:23,814 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-16 19:28:23,830 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:28:23,831 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:28:23,831 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:28:23,892 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 19:28:23,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 80 flow [2024-11-16 19:28:23,979 INFO L124 PetriNetUnfolderBase]: 6/31 cut-off events. [2024-11-16 19:28:23,979 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 19:28:23,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 31 events. 6/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-11-16 19:28:23,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 80 flow [2024-11-16 19:28:23,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 30 transitions, 72 flow [2024-11-16 19:28:23,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:28:23,999 INFO L333 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, 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;@4516dcd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:28:23,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-16 19:28:24,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:28:24,009 INFO L124 PetriNetUnfolderBase]: 6/29 cut-off events. [2024-11-16 19:28:24,009 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 19:28:24,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:28:24,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:24,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:28:24,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:28:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1615716751, now seen corresponding path program 1 times [2024-11-16 19:28:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:28:24,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537010819] [2024-11-16 19:28:24,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:24,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:28:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:28:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:28:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537010819] [2024-11-16 19:28:24,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537010819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:28:24,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:28:24,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:28:24,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991836560] [2024-11-16 19:28:24,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:28:24,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:28:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:28:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:28:24,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:28:24,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-11-16 19:28:24,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 72 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-11-16 19:28:24,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:28:24,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-11-16 19:28:24,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:28:24,372 INFO L124 PetriNetUnfolderBase]: 92/174 cut-off events. [2024-11-16 19:28:24,372 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-16 19:28:24,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 174 events. 92/174 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 622 event pairs, 68 based on Foata normal form. 24/183 useless extension candidates. Maximal degree in co-relation 310. Up to 162 conditions per place. [2024-11-16 19:28:24,381 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 20 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2024-11-16 19:28:24,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 106 flow [2024-11-16 19:28:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:28:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:28:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2024-11-16 19:28:24,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-11-16 19:28:24,431 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 72 flow. Second operand 2 states and 41 transitions. [2024-11-16 19:28:24,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 106 flow [2024-11-16 19:28:24,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 98 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 19:28:24,446 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 58 flow [2024-11-16 19:28:24,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2024-11-16 19:28:24,456 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-11-16 19:28:24,457 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 58 flow [2024-11-16 19:28:24,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-11-16 19:28:24,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:28:24,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:24,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:28:24,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:28:24,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:28:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1848780987, now seen corresponding path program 1 times [2024-11-16 19:28:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:28:24,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057864487] [2024-11-16 19:28:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:24,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:28:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:28:24,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:28:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057864487] [2024-11-16 19:28:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057864487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:28:24,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:28:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:28:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853429631] [2024-11-16 19:28:24,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:28:24,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:28:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:28:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:28:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:28:24,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-11-16 19:28:24,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-16 19:28:24,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:28:24,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-11-16 19:28:24,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:28:24,750 INFO L124 PetriNetUnfolderBase]: 147/294 cut-off events. [2024-11-16 19:28:24,751 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:28:24,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 294 events. 147/294 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1267 event pairs, 42 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 560. Up to 168 conditions per place. [2024-11-16 19:28:24,755 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 29 selfloop transitions, 3 changer transitions 1/40 dead transitions. [2024-11-16 19:28:24,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 153 flow [2024-11-16 19:28:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:28:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:28:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-11-16 19:28:24,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2024-11-16 19:28:24,764 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 58 flow. Second operand 3 states and 61 transitions. [2024-11-16 19:28:24,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 153 flow [2024-11-16 19:28:24,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:28:24,767 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 77 flow [2024-11-16 19:28:24,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-16 19:28:24,769 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-11-16 19:28:24,769 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 77 flow [2024-11-16 19:28:24,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-16 19:28:24,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:28:24,770 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:24,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:28:24,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:28:24,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:28:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1199463663, now seen corresponding path program 1 times [2024-11-16 19:28:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:28:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343792639] [2024-11-16 19:28:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:24,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:28:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:28:25,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:28:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343792639] [2024-11-16 19:28:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343792639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:28:25,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:28:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:28:25,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395161877] [2024-11-16 19:28:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:28:25,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:28:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:28:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:28:25,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:28:25,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-11-16 19:28:25,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-16 19:28:25,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:28:25,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-11-16 19:28:25,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:28:25,215 INFO L124 PetriNetUnfolderBase]: 216/461 cut-off events. [2024-11-16 19:28:25,215 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-16 19:28:25,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 461 events. 216/461 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2323 event pairs, 130 based on Foata normal form. 18/464 useless extension candidates. Maximal degree in co-relation 954. Up to 259 conditions per place. [2024-11-16 19:28:25,223 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 44 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2024-11-16 19:28:25,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 248 flow [2024-11-16 19:28:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:28:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:28:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-11-16 19:28:25,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2024-11-16 19:28:25,228 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 77 flow. Second operand 6 states and 95 transitions. [2024-11-16 19:28:25,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 248 flow [2024-11-16 19:28:25,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:28:25,230 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 118 flow [2024-11-16 19:28:25,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2024-11-16 19:28:25,234 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2024-11-16 19:28:25,235 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 118 flow [2024-11-16 19:28:25,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-16 19:28:25,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:28:25,235 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:25,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:28:25,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:28:25,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:28:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 727768027, now seen corresponding path program 1 times [2024-11-16 19:28:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:28:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312440320] [2024-11-16 19:28:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:28:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:28:25,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:28:25,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312440320] [2024-11-16 19:28:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312440320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:28:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:28:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:28:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497385555] [2024-11-16 19:28:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:28:25,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:28:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:28:25,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:28:25,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:28:25,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-11-16 19:28:25,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-16 19:28:25,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:28:25,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-11-16 19:28:25,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:28:25,577 INFO L124 PetriNetUnfolderBase]: 169/364 cut-off events. [2024-11-16 19:28:25,578 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-11-16 19:28:25,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 364 events. 169/364 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1710 event pairs, 122 based on Foata normal form. 7/362 useless extension candidates. Maximal degree in co-relation 836. Up to 259 conditions per place. [2024-11-16 19:28:25,583 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 22 selfloop transitions, 2 changer transitions 16/46 dead transitions. [2024-11-16 19:28:25,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 235 flow [2024-11-16 19:28:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:28:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:28:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-11-16 19:28:25,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-11-16 19:28:25,585 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 118 flow. Second operand 6 states and 87 transitions. [2024-11-16 19:28:25,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 235 flow [2024-11-16 19:28:25,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:28:25,588 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 102 flow [2024-11-16 19:28:25,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2024-11-16 19:28:25,589 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-11-16 19:28:25,589 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 102 flow [2024-11-16 19:28:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-16 19:28:25,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:28:25,590 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:25,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:28:25,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:28:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:28:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash 937171608, now seen corresponding path program 1 times [2024-11-16 19:28:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:28:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122735481] [2024-11-16 19:28:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:28:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:28:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:28:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122735481] [2024-11-16 19:28:25,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122735481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:28:25,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753436876] [2024-11-16 19:28:25,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:25,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:28:25,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:28:25,718 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-11-16 19:28:25,720 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-11-16 19:28:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:25,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 19:28:25,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:28:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:28:25,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:28:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:28:25,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753436876] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 19:28:25,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 19:28:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-16 19:28:25,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591636760] [2024-11-16 19:28:25,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:28:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:28:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:28:25,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:28:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 19:28:25,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-11-16 19:28:25,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:28:25,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:28:25,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-11-16 19:28:25,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:28:26,092 INFO L124 PetriNetUnfolderBase]: 163/322 cut-off events. [2024-11-16 19:28:26,093 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-11-16 19:28:26,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 322 events. 163/322 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1337 event pairs, 57 based on Foata normal form. 18/328 useless extension candidates. Maximal degree in co-relation 793. Up to 146 conditions per place. [2024-11-16 19:28:26,096 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 29 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-11-16 19:28:26,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 201 flow [2024-11-16 19:28:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:28:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:28:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2024-11-16 19:28:26,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-11-16 19:28:26,100 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 102 flow. Second operand 5 states and 67 transitions. [2024-11-16 19:28:26,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 201 flow [2024-11-16 19:28:26,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 173 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-11-16 19:28:26,104 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 105 flow [2024-11-16 19:28:26,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2024-11-16 19:28:26,106 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-11-16 19:28:26,107 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 105 flow [2024-11-16 19:28:26,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:28:26,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:28:26,108 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:26,129 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-11-16 19:28:26,308 WARN L453 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-11-16 19:28:26,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:28:26,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:28:26,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1309271468, now seen corresponding path program 1 times [2024-11-16 19:28:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:28:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587411681] [2024-11-16 19:28:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:28:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:28:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:28:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587411681] [2024-11-16 19:28:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587411681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:28:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484170758] [2024-11-16 19:28:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:26,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:28:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:28:26,422 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-11-16 19:28:26,424 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-11-16 19:28:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:28:26,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 19:28:26,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:28:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:28:26,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:28:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:28:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484170758] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 19:28:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 19:28:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-16 19:28:26,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485733991] [2024-11-16 19:28:26,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:28:26,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:28:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:28:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:28:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 19:28:26,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-11-16 19:28:26,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:28:26,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:28:26,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-11-16 19:28:26,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:28:26,720 INFO L124 PetriNetUnfolderBase]: 165/331 cut-off events. [2024-11-16 19:28:26,721 INFO L125 PetriNetUnfolderBase]: For 162/165 co-relation queries the response was YES. [2024-11-16 19:28:26,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 331 events. 165/331 cut-off events. For 162/165 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1278 event pairs, 54 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 796. Up to 144 conditions per place. [2024-11-16 19:28:26,724 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 32 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2024-11-16 19:28:26,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 220 flow [2024-11-16 19:28:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:28:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:28:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2024-11-16 19:28:26,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-11-16 19:28:26,725 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 105 flow. Second operand 5 states and 68 transitions. [2024-11-16 19:28:26,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 220 flow [2024-11-16 19:28:26,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:28:26,728 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 122 flow [2024-11-16 19:28:26,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-11-16 19:28:26,728 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-11-16 19:28:26,728 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 122 flow [2024-11-16 19:28:26,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:28:26,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:28:26,729 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:26,748 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-11-16 19:28:26,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 19:28:26,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:28:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:28:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash 852255720, now seen corresponding path program 1 times [2024-11-16 19:28:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:28:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944625766] [2024-11-16 19:28:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:28:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:28:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:28:26,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:28:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:28:27,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:28:27,010 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:28:27,011 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-16 19:28:27,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-16 19:28:27,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-16 19:28:27,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:28:27,014 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:28:27,067 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:28:27,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:28:27,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:28:27 BasicIcfg [2024-11-16 19:28:27,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:28:27,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:28:27,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:28:27,073 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:28:27,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:28:23" (3/4) ... [2024-11-16 19:28:27,075 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:28:27,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:28:27,147 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:28:27,148 INFO L158 Benchmark]: Toolchain (without parser) took 4529.91ms. Allocated memory was 134.2MB in the beginning and 226.5MB in the end (delta: 92.3MB). Free memory was 77.7MB in the beginning and 155.6MB in the end (delta: -77.9MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-16 19:28:27,148 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:28:27,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.76ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 77.4MB in the beginning and 154.2MB in the end (delta: -76.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 19:28:27,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.90ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 154.4MB in the end (delta: -184.4kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-16 19:28:27,149 INFO L158 Benchmark]: Boogie Preprocessor took 53.11ms. Allocated memory is still 184.5MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:28:27,149 INFO L158 Benchmark]: IcfgBuilder took 706.40ms. Allocated memory is still 184.5MB. Free memory was 151.2MB in the beginning and 110.3MB in the end (delta: 40.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-16 19:28:27,149 INFO L158 Benchmark]: TraceAbstraction took 3269.16ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 110.3MB in the beginning and 163.0MB in the end (delta: -52.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:28:27,149 INFO L158 Benchmark]: Witness Printer took 74.18ms. Allocated memory is still 226.5MB. Free memory was 163.0MB in the beginning and 155.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 19:28:27,151 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.21ms. Allocated memory is still 134.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.76ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 77.4MB in the beginning and 154.2MB in the end (delta: -76.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.90ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 154.4MB in the end (delta: -184.4kB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.11ms. Allocated memory is still 184.5MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 706.40ms. Allocated memory is still 184.5MB. Free memory was 151.2MB in the beginning and 110.3MB in the end (delta: 40.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3269.16ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 110.3MB in the beginning and 163.0MB in the end (delta: -52.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.18ms. Allocated memory is still 226.5MB. Free memory was 163.0MB in the beginning and 155.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=1, size=1] [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=1, counter=0, t1=-5, t2=-4] [L57] 2 int i=0; VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=0, tmp=-6] [L59] 2 counter = tmp VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=6, i=0, tmp=6] [L48] 1 i++ VAL [A={-3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=6, i=1] [L48] COND FALSE 1 !(i