./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/unroll-3.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 a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:56:53,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:56:53,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:56:53,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:56:53,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:56:54,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:56:54,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:56:54,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:56:54,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:56:54,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:56:54,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:56:54,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:56:54,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:56:54,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:56:54,033 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:56:54,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:56:54,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:56:54,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:56:54,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:56:54,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:56:54,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:56:54,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:56:54,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:56:54,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:56:54,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:56:54,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:56:54,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:56:54,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:56:54,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:56:54,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:56:54,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:56:54,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:56:54,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:56:54,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:56:54,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:56:54,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:56:54,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:56:54,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:56:54,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:56:54,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:56:54,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:56:54,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:56:54,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:56:54,041 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 -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2024-01-27 15:56:54,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:56:54,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:56:54,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:56:54,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:56:54,320 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:56:54,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-01-27 15:56:55,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:56:55,658 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:56:55,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-01-27 15:56:55,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d767d57c4/2b4640a267d749e9be6052a284efa1d5/FLAG43654cfc9 [2024-01-27 15:56:55,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d767d57c4/2b4640a267d749e9be6052a284efa1d5 [2024-01-27 15:56:55,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:56:55,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:56:55,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:56:55,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:56:55,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:56:55,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:55,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb661e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55, skipping insertion in model container [2024-01-27 15:56:55,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:55,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:56:55,901 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-01-27 15:56:55,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:56:55,928 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:56:55,952 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-01-27 15:56:55,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:56:55,970 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:56:55,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55 WrapperNode [2024-01-27 15:56:55,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:56:55,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:56:55,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:56:55,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:56:55,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:55,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,051 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 149 [2024-01-27 15:56:56,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:56:56,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:56:56,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:56:56,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:56:56,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,118 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 2, 2, 5]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 15:56:56,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:56:56,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:56:56,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:56:56,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:56:56,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (1/1) ... [2024-01-27 15:56:56,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:56:56,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:56:56,201 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-01-27 15:56:56,216 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-01-27 15:56:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:56:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:56:56,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:56:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:56:56,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:56:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:56:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:56:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:56:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:56:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:56:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:56:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:56:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:56:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:56:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:56:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:56:56,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:56:56,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:56:56,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:56:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:56:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:56:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:56:56,265 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:56:56,397 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:56:56,400 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:56:56,718 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:56:56,719 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:56:56,929 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:56:56,930 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-27 15:56:56,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:56:56 BoogieIcfgContainer [2024-01-27 15:56:56,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:56:56,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:56:56,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:56:56,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:56:56,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:56:55" (1/3) ... [2024-01-27 15:56:56,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7e83b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:56:56, skipping insertion in model container [2024-01-27 15:56:56,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:55" (2/3) ... [2024-01-27 15:56:56,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7e83b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:56:56, skipping insertion in model container [2024-01-27 15:56:56,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:56:56" (3/3) ... [2024-01-27 15:56:56,937 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-01-27 15:56:56,945 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:56:56,952 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:56:56,952 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:56:56,952 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:56:57,004 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:56:57,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-01-27 15:56:57,070 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-01-27 15:56:57,071 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:56:57,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-01-27 15:56:57,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-01-27 15:56:57,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-01-27 15:56:57,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:56:57,095 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;@cdbff95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:56:57,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:56:57,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:56:57,111 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-01-27 15:56:57,111 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:56:57,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:57,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:56:57,113 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-01-27 15:56:57,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1764738099, now seen corresponding path program 1 times [2024-01-27 15:56:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:56:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209952152] [2024-01-27 15:56:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:56:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:56:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:56:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209952152] [2024-01-27 15:56:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209952152] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:57,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:57,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:56:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778763658] [2024-01-27 15:56:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:57,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:56:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:56:57,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:56:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:56:57,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:56:57,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-27 15:56:57,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:57,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:56:57,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:57,635 INFO L124 PetriNetUnfolderBase]: 75/137 cut-off events. [2024-01-27 15:56:57,636 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-27 15:56:57,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 137 events. 75/137 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 352 event pairs, 24 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 220. Up to 79 conditions per place. [2024-01-27 15:56:57,642 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 25 selfloop transitions, 3 changer transitions 1/30 dead transitions. [2024-01-27 15:56:57,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 30 transitions, 139 flow [2024-01-27 15:56:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:56:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:56:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2024-01-27 15:56:57,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-01-27 15:56:57,656 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 48 flow. Second operand 3 states and 39 transitions. [2024-01-27 15:56:57,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 30 transitions, 139 flow [2024-01-27 15:56:57,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 30 transitions, 125 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 15:56:57,663 INFO L231 Difference]: Finished difference. Result has 21 places, 20 transitions, 59 flow [2024-01-27 15:56:57,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=21, PETRI_TRANSITIONS=20} [2024-01-27 15:56:57,669 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2024-01-27 15:56:57,670 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 20 transitions, 59 flow [2024-01-27 15:56:57,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-27 15:56:57,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:57,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:56:57,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:56:57,671 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-01-27 15:56:57,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1495654762, now seen corresponding path program 1 times [2024-01-27 15:56:57,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:56:57,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353435269] [2024-01-27 15:56:57,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:57,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:56:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:57,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:56:57,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353435269] [2024-01-27 15:56:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353435269] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:56:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190857241] [2024-01-27 15:56:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:57,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:56:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:56:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:56:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:56:57,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:56:57,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 20 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-27 15:56:57,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:57,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:56:57,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:57,916 INFO L124 PetriNetUnfolderBase]: 75/138 cut-off events. [2024-01-27 15:56:57,916 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-27 15:56:57,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 138 events. 75/138 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 338 event pairs, 48 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 120. Up to 137 conditions per place. [2024-01-27 15:56:57,919 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2024-01-27 15:56:57,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 21 transitions, 101 flow [2024-01-27 15:56:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:56:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:56:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-01-27 15:56:57,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-01-27 15:56:57,922 INFO L175 Difference]: Start difference. First operand has 21 places, 20 transitions, 59 flow. Second operand 3 states and 28 transitions. [2024-01-27 15:56:57,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 21 transitions, 101 flow [2024-01-27 15:56:57,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 21 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:56:57,924 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 68 flow [2024-01-27 15:56:57,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2024-01-27 15:56:57,925 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2024-01-27 15:56:57,925 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 68 flow [2024-01-27 15:56:57,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-27 15:56:57,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:57,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:56:57,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:56:57,929 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-01-27 15:56:57,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 689632753, now seen corresponding path program 1 times [2024-01-27 15:56:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:56:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645781906] [2024-01-27 15:56:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:56:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:58,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:56:58,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645781906] [2024-01-27 15:56:58,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645781906] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:56:58,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315246033] [2024-01-27 15:56:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:56:58,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:56:58,152 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-01-27 15:56:58,186 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-01-27 15:56:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:58,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:56:58,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:58,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:56:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:58,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315246033] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:56:58,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:56:58,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-01-27 15:56:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181555624] [2024-01-27 15:56:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:58,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:56:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:56:58,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:56:58,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:56:58,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:56:58,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 15:56:58,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:58,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:56:58,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:58,501 INFO L124 PetriNetUnfolderBase]: 83/152 cut-off events. [2024-01-27 15:56:58,501 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-01-27 15:56:58,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 152 events. 83/152 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 415 event pairs, 24 based on Foata normal form. 6/157 useless extension candidates. Maximal degree in co-relation 348. Up to 78 conditions per place. [2024-01-27 15:56:58,503 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 31 selfloop transitions, 4 changer transitions 1/37 dead transitions. [2024-01-27 15:56:58,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 37 transitions, 180 flow [2024-01-27 15:56:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:56:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:56:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-01-27 15:56:58,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-01-27 15:56:58,505 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 68 flow. Second operand 4 states and 48 transitions. [2024-01-27 15:56:58,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 37 transitions, 180 flow [2024-01-27 15:56:58,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 37 transitions, 176 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:56:58,510 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 90 flow [2024-01-27 15:56:58,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2024-01-27 15:56:58,511 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2024-01-27 15:56:58,511 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 90 flow [2024-01-27 15:56:58,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 15:56:58,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:58,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:56:58,531 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-01-27 15:56:58,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:56:58,727 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-01-27 15:56:58,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash -888707086, now seen corresponding path program 1 times [2024-01-27 15:56:58,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:56:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321240092] [2024-01-27 15:56:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:56:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:56:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321240092] [2024-01-27 15:56:58,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321240092] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:58,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:58,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:56:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154148809] [2024-01-27 15:56:58,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:58,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:56:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:56:58,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:56:58,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:56:58,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:56:58,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 15:56:58,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:58,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:56:58,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:59,000 INFO L124 PetriNetUnfolderBase]: 93/186 cut-off events. [2024-01-27 15:56:59,000 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-01-27 15:56:59,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 186 events. 93/186 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 630 event pairs, 26 based on Foata normal form. 12/197 useless extension candidates. Maximal degree in co-relation 492. Up to 101 conditions per place. [2024-01-27 15:56:59,002 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 33 selfloop transitions, 4 changer transitions 8/46 dead transitions. [2024-01-27 15:56:59,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 46 transitions, 255 flow [2024-01-27 15:56:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:56:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:56:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-01-27 15:56:59,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-01-27 15:56:59,004 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 90 flow. Second operand 5 states and 56 transitions. [2024-01-27 15:56:59,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 46 transitions, 255 flow [2024-01-27 15:56:59,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 250 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:56:59,006 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 117 flow [2024-01-27 15:56:59,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-01-27 15:56:59,020 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2024-01-27 15:56:59,020 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 117 flow [2024-01-27 15:56:59,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 15:56:59,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:59,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:56:59,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:56:59,021 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-01-27 15:56:59,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1401451265, now seen corresponding path program 2 times [2024-01-27 15:56:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:56:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571102651] [2024-01-27 15:56:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:56:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:56:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571102651] [2024-01-27 15:56:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571102651] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:56:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200220616] [2024-01-27 15:56:59,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:56:59,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:56:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:56:59,137 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-01-27 15:56:59,160 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-01-27 15:56:59,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:56:59,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:56:59,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:56:59,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:59,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:56:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200220616] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:56:59,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:56:59,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-01-27 15:56:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943996793] [2024-01-27 15:56:59,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:56:59,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:56:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:56:59,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:56:59,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:56:59,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:56:59,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 117 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-01-27 15:56:59,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:59,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:56:59,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:59,461 INFO L124 PetriNetUnfolderBase]: 117/235 cut-off events. [2024-01-27 15:56:59,462 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2024-01-27 15:56:59,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 235 events. 117/235 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 821 event pairs, 42 based on Foata normal form. 6/240 useless extension candidates. Maximal degree in co-relation 764. Up to 135 conditions per place. [2024-01-27 15:56:59,465 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 34 selfloop transitions, 11 changer transitions 6/52 dead transitions. [2024-01-27 15:56:59,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 340 flow [2024-01-27 15:56:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:56:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:56:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-01-27 15:56:59,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-01-27 15:56:59,468 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 117 flow. Second operand 5 states and 58 transitions. [2024-01-27 15:56:59,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 340 flow [2024-01-27 15:56:59,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 322 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-01-27 15:56:59,473 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 196 flow [2024-01-27 15:56:59,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-01-27 15:56:59,475 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2024-01-27 15:56:59,475 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 196 flow [2024-01-27 15:56:59,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-01-27 15:56:59,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:59,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:56:59,489 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-01-27 15:56:59,682 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-01-27 15:56:59,683 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-01-27 15:56:59,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -766146222, now seen corresponding path program 2 times [2024-01-27 15:56:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:56:59,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486973011] [2024-01-27 15:56:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:56:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:59,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:56:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486973011] [2024-01-27 15:56:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486973011] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:59,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:59,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:56:59,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891162819] [2024-01-27 15:56:59,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:59,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:56:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:56:59,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:56:59,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:56:59,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:56:59,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 15:56:59,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:59,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:56:59,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:59,866 INFO L124 PetriNetUnfolderBase]: 123/245 cut-off events. [2024-01-27 15:56:59,866 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-01-27 15:56:59,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 245 events. 123/245 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 894 event pairs, 38 based on Foata normal form. 4/248 useless extension candidates. Maximal degree in co-relation 906. Up to 147 conditions per place. [2024-01-27 15:56:59,868 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 36 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2024-01-27 15:56:59,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 365 flow [2024-01-27 15:56:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:56:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:56:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-01-27 15:56:59,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-01-27 15:56:59,870 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 196 flow. Second operand 4 states and 46 transitions. [2024-01-27 15:56:59,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 365 flow [2024-01-27 15:56:59,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 363 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-01-27 15:56:59,873 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 258 flow [2024-01-27 15:56:59,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2024-01-27 15:56:59,874 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2024-01-27 15:56:59,874 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 258 flow [2024-01-27 15:56:59,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 15:56:59,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:59,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:56:59,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:56:59,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:56:59,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 936842816, now seen corresponding path program 3 times [2024-01-27 15:56:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:56:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058101873] [2024-01-27 15:56:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:56:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:56:59,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:56:59,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058101873] [2024-01-27 15:56:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058101873] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:56:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980748399] [2024-01-27 15:56:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:59,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:56:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:56:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:56:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:56:59,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:56:59,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 15:56:59,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:59,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:56:59,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:57:00,051 INFO L124 PetriNetUnfolderBase]: 123/238 cut-off events. [2024-01-27 15:57:00,051 INFO L125 PetriNetUnfolderBase]: For 620/620 co-relation queries the response was YES. [2024-01-27 15:57:00,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 238 events. 123/238 cut-off events. For 620/620 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 821 event pairs, 38 based on Foata normal form. 4/241 useless extension candidates. Maximal degree in co-relation 984. Up to 146 conditions per place. [2024-01-27 15:57:00,054 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 33 selfloop transitions, 9 changer transitions 4/47 dead transitions. [2024-01-27 15:57:00,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 407 flow [2024-01-27 15:57:00,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:57:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:57:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-01-27 15:57:00,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-01-27 15:57:00,055 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 258 flow. Second operand 4 states and 46 transitions. [2024-01-27 15:57:00,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 407 flow [2024-01-27 15:57:00,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 392 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-27 15:57:00,059 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 287 flow [2024-01-27 15:57:00,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-01-27 15:57:00,060 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 23 predicate places. [2024-01-27 15:57:00,060 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 287 flow [2024-01-27 15:57:00,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 15:57:00,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:57:00,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:57:00,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:57:00,061 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:57:00,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:57:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 283534479, now seen corresponding path program 3 times [2024-01-27 15:57:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:57:00,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147137912] [2024-01-27 15:57:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:57:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:57:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:57:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:57:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:57:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147137912] [2024-01-27 15:57:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147137912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:57:00,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:57:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:57:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910633325] [2024-01-27 15:57:00,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:57:00,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:57:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:57:00,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:57:00,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:57:00,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:57:00,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 15:57:00,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:57:00,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:57:00,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:57:00,240 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2024-01-27 15:57:00,241 INFO L125 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2024-01-27 15:57:00,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 197 events. 106/197 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 582 event pairs, 34 based on Foata normal form. 2/198 useless extension candidates. Maximal degree in co-relation 849. Up to 149 conditions per place. [2024-01-27 15:57:00,243 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 31 selfloop transitions, 11 changer transitions 2/45 dead transitions. [2024-01-27 15:57:00,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 417 flow [2024-01-27 15:57:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:57:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:57:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2024-01-27 15:57:00,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-01-27 15:57:00,245 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 287 flow. Second operand 5 states and 45 transitions. [2024-01-27 15:57:00,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 417 flow [2024-01-27 15:57:00,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 385 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-01-27 15:57:00,248 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 303 flow [2024-01-27 15:57:00,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-01-27 15:57:00,249 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2024-01-27 15:57:00,249 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 303 flow [2024-01-27 15:57:00,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 15:57:00,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:57:00,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:57:00,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:57:00,250 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:57:00,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:57:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -107225049, now seen corresponding path program 4 times [2024-01-27 15:57:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:57:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951949549] [2024-01-27 15:57:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:57:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:57:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:57:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:57:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:57:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951949549] [2024-01-27 15:57:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951949549] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:57:00,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:57:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:57:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663697115] [2024-01-27 15:57:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:57:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:57:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:57:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:57:00,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:57:00,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:57:00,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 15:57:00,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:57:00,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:57:00,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:57:00,447 INFO L124 PetriNetUnfolderBase]: 100/182 cut-off events. [2024-01-27 15:57:00,448 INFO L125 PetriNetUnfolderBase]: For 711/711 co-relation queries the response was YES. [2024-01-27 15:57:00,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 182 events. 100/182 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 519 event pairs, 31 based on Foata normal form. 4/185 useless extension candidates. Maximal degree in co-relation 846. Up to 130 conditions per place. [2024-01-27 15:57:00,450 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 32 selfloop transitions, 9 changer transitions 4/46 dead transitions. [2024-01-27 15:57:00,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 435 flow [2024-01-27 15:57:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:57:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:57:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2024-01-27 15:57:00,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-01-27 15:57:00,451 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 303 flow. Second operand 5 states and 45 transitions. [2024-01-27 15:57:00,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 435 flow [2024-01-27 15:57:00,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 421 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:57:00,455 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 325 flow [2024-01-27 15:57:00,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2024-01-27 15:57:00,456 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 29 predicate places. [2024-01-27 15:57:00,456 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 325 flow [2024-01-27 15:57:00,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 15:57:00,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:57:00,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:57:00,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:57:00,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:57:00,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:57:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1474385269, now seen corresponding path program 1 times [2024-01-27 15:57:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:57:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120564700] [2024-01-27 15:57:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:57:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:57:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:57:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:57:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:57:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120564700] [2024-01-27 15:57:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120564700] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:57:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379599927] [2024-01-27 15:57:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:57:00,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:57:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:57:00,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:57:00,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:57:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:57:00,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjunts are in the unsatisfiable core [2024-01-27 15:57:00,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:57:00,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-01-27 15:57:01,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:57:01,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2024-01-27 15:57:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:57:01,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:57:01,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 116 [2024-01-27 15:57:01,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:57:01,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 765 treesize of output 645 [2024-01-27 15:57:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:57:18,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379599927] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:57:18,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:57:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2024-01-27 15:57:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86736954] [2024-01-27 15:57:18,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:57:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-27 15:57:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:57:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-27 15:57:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-01-27 15:57:18,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 15:57:18,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 325 flow. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 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-01-27 15:57:18,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:57:18,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 15:57:18,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:57:20,146 INFO L124 PetriNetUnfolderBase]: 309/558 cut-off events. [2024-01-27 15:57:20,146 INFO L125 PetriNetUnfolderBase]: For 2083/2083 co-relation queries the response was YES. [2024-01-27 15:57:20,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 558 events. 309/558 cut-off events. For 2083/2083 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2368 event pairs, 14 based on Foata normal form. 10/566 useless extension candidates. Maximal degree in co-relation 2670. Up to 237 conditions per place. [2024-01-27 15:57:20,151 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 58 selfloop transitions, 27 changer transitions 93/179 dead transitions. [2024-01-27 15:57:20,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 179 transitions, 1565 flow [2024-01-27 15:57:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-27 15:57:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-01-27 15:57:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 245 transitions. [2024-01-27 15:57:20,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40229885057471265 [2024-01-27 15:57:20,154 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 325 flow. Second operand 29 states and 245 transitions. [2024-01-27 15:57:20,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 179 transitions, 1565 flow [2024-01-27 15:57:20,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 179 transitions, 1455 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-01-27 15:57:20,164 INFO L231 Difference]: Finished difference. Result has 86 places, 49 transitions, 518 flow [2024-01-27 15:57:20,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=518, PETRI_PLACES=86, PETRI_TRANSITIONS=49} [2024-01-27 15:57:20,165 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 64 predicate places. [2024-01-27 15:57:20,165 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 49 transitions, 518 flow [2024-01-27 15:57:20,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 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-01-27 15:57:20,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:57:20,166 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:57:20,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-27 15:57:20,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:57:20,383 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:57:20,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:57:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash -839814674, now seen corresponding path program 2 times [2024-01-27 15:57:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:57:20,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496521550] [2024-01-27 15:57:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:57:20,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:57:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:57:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:57:20,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:57:20,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496521550] [2024-01-27 15:57:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496521550] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:57:20,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698748473] [2024-01-27 15:57:20,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:57:20,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:57:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:57:20,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:57:20,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:57:21,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:57:21,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:57:21,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-27 15:57:21,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:57:21,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-01-27 15:57:21,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-01-27 15:57:21,310 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-01-27 15:57:21,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2024-01-27 15:57:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:57:21,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:57:21,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 230 [2024-01-27 15:57:22,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:57:22,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 6135 treesize of output 5183 [2024-01-27 16:00:45,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-01-27 16:00:45,456 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-01-27 16:00:45,457 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 16:00:45,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 16:00:45,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:00:45,658 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:516) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-01-27 16:00:45,678 INFO L158 Benchmark]: Toolchain (without parser) took 229995.90ms. Allocated memory was 153.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 85.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-01-27 16:00:45,678 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:00:45,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.97ms. Allocated memory is still 153.1MB. Free memory was 84.9MB in the beginning and 72.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:00:45,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.90ms. Allocated memory is still 153.1MB. Free memory was 72.8MB in the beginning and 127.0MB in the end (delta: -54.2MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-01-27 16:00:45,679 INFO L158 Benchmark]: Boogie Preprocessor took 89.20ms. Allocated memory is still 153.1MB. Free memory was 127.0MB in the beginning and 124.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:00:45,681 INFO L158 Benchmark]: RCFGBuilder took 770.79ms. Allocated memory is still 153.1MB. Free memory was 124.7MB in the beginning and 78.6MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-27 16:00:45,681 INFO L158 Benchmark]: TraceAbstraction took 228744.30ms. Allocated memory was 153.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 78.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-01-27 16:00:45,683 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.16ms. Allocated memory is still 109.1MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.97ms. Allocated memory is still 153.1MB. Free memory was 84.9MB in the beginning and 72.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.90ms. Allocated memory is still 153.1MB. Free memory was 72.8MB in the beginning and 127.0MB in the end (delta: -54.2MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.20ms. Allocated memory is still 153.1MB. Free memory was 127.0MB in the beginning and 124.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 770.79ms. Allocated memory is still 153.1MB. Free memory was 124.7MB in the beginning and 78.6MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 228744.30ms. Allocated memory was 153.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 78.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:00:47,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:00:47,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 16:00:47,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:00:47,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:00:48,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:00:48,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:00:48,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:00:48,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:00:48,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:00:48,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:00:48,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:00:48,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:00:48,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:00:48,021 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:00:48,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:00:48,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:00:48,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:00:48,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:00:48,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:00:48,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:00:48,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:00:48,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:00:48,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 16:00:48,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 16:00:48,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:00:48,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 16:00:48,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:00:48,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:00:48,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:00:48,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:00:48,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:00:48,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:00:48,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:00:48,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:00:48,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:00:48,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:00:48,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:00:48,030 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 16:00:48,030 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 16:00:48,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:00:48,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:00:48,031 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:00:48,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:00:48,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:00:48,032 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 16:00:48,032 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 -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2024-01-27 16:00:48,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:00:48,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:00:48,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:00:48,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:00:48,392 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:00:48,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-01-27 16:00:49,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:00:49,908 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:00:49,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-01-27 16:00:49,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e715840e/9d86cc68eb304e71a9ec0c1a99f8cb8a/FLAG62b3702fc [2024-01-27 16:00:49,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e715840e/9d86cc68eb304e71a9ec0c1a99f8cb8a [2024-01-27 16:00:49,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:00:49,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:00:49,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:00:49,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:00:49,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:00:49,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:00:49" (1/1) ... [2024-01-27 16:00:49,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8dae9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:49, skipping insertion in model container [2024-01-27 16:00:49,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:00:49" (1/1) ... [2024-01-27 16:00:49,962 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:00:50,161 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-01-27 16:00:50,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:00:50,195 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 16:00:50,205 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:00:50,230 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-01-27 16:00:50,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:00:50,243 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:00:50,277 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-01-27 16:00:50,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:00:50,298 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:00:50,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50 WrapperNode [2024-01-27 16:00:50,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:00:50,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:00:50,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:00:50,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:00:50,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,369 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 147 [2024-01-27 16:00:50,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:00:50,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:00:50,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:00:50,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:00:50,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,419 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 5, 2, 2]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 16:00:50,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:00:50,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:00:50,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:00:50,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:00:50,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (1/1) ... [2024-01-27 16:00:50,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:00:50,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:00:50,489 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-01-27 16:00:50,515 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-01-27 16:00:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:00:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 16:00:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 16:00:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 16:00:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 16:00:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:00:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 16:00:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 16:00:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 16:00:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 16:00:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 16:00:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 16:00:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 16:00:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 16:00:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 16:00:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:00:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:00:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:00:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 16:00:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 16:00:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 16:00:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 16:00:50,543 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:00:50,643 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:00:50,646 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:00:50,935 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:00:50,935 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:00:51,259 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:00:51,260 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-27 16:00:51,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:00:51 BoogieIcfgContainer [2024-01-27 16:00:51,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:00:51,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:00:51,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:00:51,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:00:51,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:00:49" (1/3) ... [2024-01-27 16:00:51,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2c7f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:00:51, skipping insertion in model container [2024-01-27 16:00:51,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:00:50" (2/3) ... [2024-01-27 16:00:51,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2c7f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:00:51, skipping insertion in model container [2024-01-27 16:00:51,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:00:51" (3/3) ... [2024-01-27 16:00:51,269 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-01-27 16:00:51,277 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:00:51,285 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:00:51,286 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:00:51,286 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:00:51,324 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:00:51,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-01-27 16:00:51,384 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-01-27 16:00:51,384 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:00:51,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-01-27 16:00:51,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-01-27 16:00:51,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-01-27 16:00:51,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:00:51,412 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;@46d7b001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:00:51,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 16:00:51,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:00:51,429 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-01-27 16:00:51,430 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:00:51,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:51,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:51,431 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-01-27 16:00:51,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash -551342263, now seen corresponding path program 1 times [2024-01-27 16:00:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848008307] [2024-01-27 16:00:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:00:51,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:51,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:51,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:51,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-01-27 16:00:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:00:51,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 16:00:51,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:00:51,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 16:00:51,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848008307] [2024-01-27 16:00:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848008307] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:00:51,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:00:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:00:51,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294333350] [2024-01-27 16:00:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:00:51,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:00:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:00:51,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:00:51,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:51,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-27 16:00:51,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:51,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:51,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:51,981 INFO L124 PetriNetUnfolderBase]: 75/137 cut-off events. [2024-01-27 16:00:51,982 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-27 16:00:51,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 137 events. 75/137 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 352 event pairs, 24 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 220. Up to 79 conditions per place. [2024-01-27 16:00:51,987 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 25 selfloop transitions, 3 changer transitions 1/30 dead transitions. [2024-01-27 16:00:51,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 30 transitions, 139 flow [2024-01-27 16:00:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:00:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:00:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2024-01-27 16:00:51,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-01-27 16:00:51,999 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 48 flow. Second operand 3 states and 39 transitions. [2024-01-27 16:00:52,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 30 transitions, 139 flow [2024-01-27 16:00:52,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 30 transitions, 125 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:00:52,005 INFO L231 Difference]: Finished difference. Result has 21 places, 20 transitions, 59 flow [2024-01-27 16:00:52,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=21, PETRI_TRANSITIONS=20} [2024-01-27 16:00:52,012 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2024-01-27 16:00:52,012 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 20 transitions, 59 flow [2024-01-27 16:00:52,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-27 16:00:52,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:52,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:52,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-01-27 16:00:52,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:52,218 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-01-27 16:00:52,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 456220010, now seen corresponding path program 1 times [2024-01-27 16:00:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875559460] [2024-01-27 16:00:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:00:52,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:52,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:52,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-01-27 16:00:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:00:52,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 16:00:52,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:52,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 16:00:52,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875559460] [2024-01-27 16:00:52,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875559460] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:00:52,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:00:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:00:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054398313] [2024-01-27 16:00:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:00:52,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:00:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:52,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:00:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:00:52,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:52,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 20 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-27 16:00:52,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:52,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:52,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:52,491 INFO L124 PetriNetUnfolderBase]: 75/138 cut-off events. [2024-01-27 16:00:52,499 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-01-27 16:00:52,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 138 events. 75/138 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 340 event pairs, 48 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 120. Up to 137 conditions per place. [2024-01-27 16:00:52,501 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2024-01-27 16:00:52,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 21 transitions, 101 flow [2024-01-27 16:00:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:00:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:00:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-01-27 16:00:52,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-01-27 16:00:52,503 INFO L175 Difference]: Start difference. First operand has 21 places, 20 transitions, 59 flow. Second operand 3 states and 28 transitions. [2024-01-27 16:00:52,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 21 transitions, 101 flow [2024-01-27 16:00:52,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 21 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:00:52,505 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 68 flow [2024-01-27 16:00:52,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2024-01-27 16:00:52,506 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2024-01-27 16:00:52,506 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 68 flow [2024-01-27 16:00:52,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-27 16:00:52,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:52,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:52,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-01-27 16:00:52,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:52,710 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-01-27 16:00:52,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1468073491, now seen corresponding path program 1 times [2024-01-27 16:00:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173268367] [2024-01-27 16:00:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:00:52,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:52,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:52,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:52,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-01-27 16:00:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:00:52,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 16:00:52,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:52,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:00:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:53,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173268367] [2024-01-27 16:00:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173268367] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:00:53,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:00:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-01-27 16:00:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455125321] [2024-01-27 16:00:53,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 16:00:53,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:00:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:00:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:00:53,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:53,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 68 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-01-27 16:00:53,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:53,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:53,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:53,423 INFO L124 PetriNetUnfolderBase]: 125/234 cut-off events. [2024-01-27 16:00:53,423 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-01-27 16:00:53,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 234 events. 125/234 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 793 event pairs, 13 based on Foata normal form. 20/253 useless extension candidates. Maximal degree in co-relation 546. Up to 76 conditions per place. [2024-01-27 16:00:53,425 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 51 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2024-01-27 16:00:53,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 62 transitions, 304 flow [2024-01-27 16:00:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:00:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:00:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-01-27 16:00:53,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-01-27 16:00:53,428 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 68 flow. Second operand 8 states and 84 transitions. [2024-01-27 16:00:53,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 62 transitions, 304 flow [2024-01-27 16:00:53,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 62 transitions, 300 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 16:00:53,430 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 142 flow [2024-01-27 16:00:53,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=142, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-01-27 16:00:53,431 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 12 predicate places. [2024-01-27 16:00:53,432 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 142 flow [2024-01-27 16:00:53,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-01-27 16:00:53,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:53,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:53,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-01-27 16:00:53,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:53,641 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-01-27 16:00:53,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1220863428, now seen corresponding path program 1 times [2024-01-27 16:00:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899533424] [2024-01-27 16:00:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:00:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:53,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:53,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:53,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-01-27 16:00:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:00:53,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 16:00:53,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:53,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:00:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:53,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899533424] [2024-01-27 16:00:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899533424] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:00:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 16:00:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-01-27 16:00:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862091492] [2024-01-27 16:00:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:00:53,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:00:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:00:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:00:53,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:53,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 16:00:53,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:53,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:53,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:54,081 INFO L124 PetriNetUnfolderBase]: 121/223 cut-off events. [2024-01-27 16:00:54,081 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-01-27 16:00:54,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 223 events. 121/223 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 685 event pairs, 24 based on Foata normal form. 4/227 useless extension candidates. Maximal degree in co-relation 710. Up to 146 conditions per place. [2024-01-27 16:00:54,085 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 33 selfloop transitions, 6 changer transitions 1/41 dead transitions. [2024-01-27 16:00:54,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 265 flow [2024-01-27 16:00:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:00:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:00:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-01-27 16:00:54,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-01-27 16:00:54,090 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 142 flow. Second operand 4 states and 46 transitions. [2024-01-27 16:00:54,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 265 flow [2024-01-27 16:00:54,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 260 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 16:00:54,096 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 178 flow [2024-01-27 16:00:54,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-01-27 16:00:54,098 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 16 predicate places. [2024-01-27 16:00:54,098 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 178 flow [2024-01-27 16:00:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-01-27 16:00:54,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:54,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:54,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-01-27 16:00:54,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:54,306 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-01-27 16:00:54,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1248553966, now seen corresponding path program 2 times [2024-01-27 16:00:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470037198] [2024-01-27 16:00:54,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:00:54,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:54,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:54,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:54,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-01-27 16:00:54,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:00:54,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:00:54,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 16:00:54,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:54,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 16:00:54,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470037198] [2024-01-27 16:00:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470037198] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:00:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:00:54,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:00:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824156420] [2024-01-27 16:00:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:00:54,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:00:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:54,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:00:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:00:54,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:54,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 16:00:54,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:54,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:54,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:54,654 INFO L124 PetriNetUnfolderBase]: 111/202 cut-off events. [2024-01-27 16:00:54,654 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2024-01-27 16:00:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 202 events. 111/202 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 609 event pairs, 44 based on Foata normal form. 4/206 useless extension candidates. Maximal degree in co-relation 688. Up to 129 conditions per place. [2024-01-27 16:00:54,656 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 27 selfloop transitions, 7 changer transitions 9/44 dead transitions. [2024-01-27 16:00:54,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 300 flow [2024-01-27 16:00:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:00:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:00:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2024-01-27 16:00:54,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-01-27 16:00:54,659 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 178 flow. Second operand 5 states and 49 transitions. [2024-01-27 16:00:54,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 300 flow [2024-01-27 16:00:54,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 291 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-27 16:00:54,664 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 173 flow [2024-01-27 16:00:54,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-01-27 16:00:54,666 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2024-01-27 16:00:54,667 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 173 flow [2024-01-27 16:00:54,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-01-27 16:00:54,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:54,668 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:54,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-01-27 16:00:54,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:54,872 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-01-27 16:00:54,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 30585403, now seen corresponding path program 2 times [2024-01-27 16:00:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40227819] [2024-01-27 16:00:54,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:00:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:54,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:54,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-01-27 16:00:54,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:00:54,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:00:54,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 16:00:54,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 16:00:55,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:00:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:55,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40227819] [2024-01-27 16:00:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40227819] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:00:55,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:00:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-01-27 16:00:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094391026] [2024-01-27 16:00:55,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 16:00:55,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 16:00:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 16:00:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-01-27 16:00:55,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:55,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 173 flow. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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-01-27 16:00:55,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:55,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:56,186 INFO L124 PetriNetUnfolderBase]: 138/245 cut-off events. [2024-01-27 16:00:56,186 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2024-01-27 16:00:56,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 245 events. 138/245 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 745 event pairs, 2 based on Foata normal form. 8/253 useless extension candidates. Maximal degree in co-relation 839. Up to 103 conditions per place. [2024-01-27 16:00:56,188 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 56 selfloop transitions, 34 changer transitions 0/91 dead transitions. [2024-01-27 16:00:56,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 570 flow [2024-01-27 16:00:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-27 16:00:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-01-27 16:00:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 140 transitions. [2024-01-27 16:00:56,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-01-27 16:00:56,191 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 173 flow. Second operand 17 states and 140 transitions. [2024-01-27 16:00:56,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 570 flow [2024-01-27 16:00:56,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 91 transitions, 520 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-01-27 16:00:56,195 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 394 flow [2024-01-27 16:00:56,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=394, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2024-01-27 16:00:56,195 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 35 predicate places. [2024-01-27 16:00:56,196 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 394 flow [2024-01-27 16:00:56,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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-01-27 16:00:56,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:56,196 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:56,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-01-27 16:00:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:56,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:00:56,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash 408948803, now seen corresponding path program 3 times [2024-01-27 16:00:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458535504] [2024-01-27 16:00:56,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:00:56,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:56,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:56,403 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:56,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-01-27 16:00:56,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 16:00:56,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:00:56,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 16:00:56,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 16:00:56,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 16:00:56,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458535504] [2024-01-27 16:00:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458535504] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:00:56,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:00:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:00:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115710581] [2024-01-27 16:00:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:00:56,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:00:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:00:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:00:56,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:56,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-01-27 16:00:56,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:56,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:56,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:56,716 INFO L124 PetriNetUnfolderBase]: 150/276 cut-off events. [2024-01-27 16:00:56,717 INFO L125 PetriNetUnfolderBase]: For 954/954 co-relation queries the response was YES. [2024-01-27 16:00:56,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 276 events. 150/276 cut-off events. For 954/954 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 889 event pairs, 41 based on Foata normal form. 14/290 useless extension candidates. Maximal degree in co-relation 1220. Up to 164 conditions per place. [2024-01-27 16:00:56,720 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 49 selfloop transitions, 19 changer transitions 2/71 dead transitions. [2024-01-27 16:00:56,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 618 flow [2024-01-27 16:00:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:00:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:00:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2024-01-27 16:00:56,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-01-27 16:00:56,723 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 394 flow. Second operand 5 states and 48 transitions. [2024-01-27 16:00:56,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 618 flow [2024-01-27 16:00:56,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 476 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-01-27 16:00:56,729 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 341 flow [2024-01-27 16:00:56,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2024-01-27 16:00:56,730 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 32 predicate places. [2024-01-27 16:00:56,730 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 341 flow [2024-01-27 16:00:56,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-01-27 16:00:56,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:56,730 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:56,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-01-27 16:00:56,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:56,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:00:56,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:56,934 INFO L85 PathProgramCache]: Analyzing trace with hash -966931217, now seen corresponding path program 4 times [2024-01-27 16:00:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:56,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677137178] [2024-01-27 16:00:56,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 16:00:56,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:56,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:56,937 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:56,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-01-27 16:00:57,021 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 16:00:57,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:00:57,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 16:00:57,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:57,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:00:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 16:00:57,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:00:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677137178] [2024-01-27 16:00:57,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677137178] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:00:57,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 16:00:57,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-01-27 16:00:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177298055] [2024-01-27 16:00:57,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:00:57,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:00:57,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:00:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:00:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:00:57,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:00:57,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-01-27 16:00:57,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:00:57,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:00:57,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:00:57,376 INFO L124 PetriNetUnfolderBase]: 148/267 cut-off events. [2024-01-27 16:00:57,376 INFO L125 PetriNetUnfolderBase]: For 1125/1125 co-relation queries the response was YES. [2024-01-27 16:00:57,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 267 events. 148/267 cut-off events. For 1125/1125 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 842 event pairs, 23 based on Foata normal form. 14/281 useless extension candidates. Maximal degree in co-relation 1129. Up to 194 conditions per place. [2024-01-27 16:00:57,380 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 47 selfloop transitions, 12 changer transitions 1/61 dead transitions. [2024-01-27 16:00:57,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 488 flow [2024-01-27 16:00:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:00:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:00:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-01-27 16:00:57,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-01-27 16:00:57,381 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 341 flow. Second operand 4 states and 44 transitions. [2024-01-27 16:00:57,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 488 flow [2024-01-27 16:00:57,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 446 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-01-27 16:00:57,385 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 319 flow [2024-01-27 16:00:57,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2024-01-27 16:00:57,386 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 30 predicate places. [2024-01-27 16:00:57,386 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 319 flow [2024-01-27 16:00:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-01-27 16:00:57,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:00:57,387 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:00:57,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-01-27 16:00:57,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:57,591 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:00:57,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:00:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash 849287873, now seen corresponding path program 5 times [2024-01-27 16:00:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:00:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587692808] [2024-01-27 16:00:57,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:00:57,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:00:57,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:00:57,593 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:00:57,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-01-27 16:00:57,690 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 16:00:57,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:00:57,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjunts are in the unsatisfiable core [2024-01-27 16:00:57,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:00:58,015 INFO L349 Elim1Store]: treesize reduction 220, result has 5.6 percent of original size [2024-01-27 16:00:58,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 262 treesize of output 90 [2024-01-27 16:00:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:00:58,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:00:58,402 INFO L349 Elim1Store]: treesize reduction 201, result has 20.6 percent of original size [2024-01-27 16:00:58,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 299 treesize of output 140 [2024-01-27 16:01:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:01:05,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:01:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587692808] [2024-01-27 16:01:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587692808] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:01:05,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:01:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-01-27 16:01:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432600316] [2024-01-27 16:01:05,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 16:01:05,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 16:01:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:01:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 16:01:05,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-01-27 16:01:05,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:01:05,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 319 flow. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:01:05,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:01:05,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:01:05,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:01:06,461 INFO L124 PetriNetUnfolderBase]: 295/528 cut-off events. [2024-01-27 16:01:06,461 INFO L125 PetriNetUnfolderBase]: For 1654/1654 co-relation queries the response was YES. [2024-01-27 16:01:06,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 528 events. 295/528 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2080 event pairs, 52 based on Foata normal form. 2/528 useless extension candidates. Maximal degree in co-relation 1917. Up to 235 conditions per place. [2024-01-27 16:01:06,466 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 49 selfloop transitions, 6 changer transitions 57/113 dead transitions. [2024-01-27 16:01:06,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 113 transitions, 930 flow [2024-01-27 16:01:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:01:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:01:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-01-27 16:01:06,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-01-27 16:01:06,470 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 319 flow. Second operand 8 states and 81 transitions. [2024-01-27 16:01:06,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 113 transitions, 930 flow [2024-01-27 16:01:06,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 113 transitions, 856 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-01-27 16:01:06,477 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 326 flow [2024-01-27 16:01:06,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-01-27 16:01:06,479 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 35 predicate places. [2024-01-27 16:01:06,479 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 326 flow [2024-01-27 16:01:06,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:01:06,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:01:06,480 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:01:06,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-01-27 16:01:06,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:01:06,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:01:06,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:01:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash -708608, now seen corresponding path program 6 times [2024-01-27 16:01:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:01:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111112872] [2024-01-27 16:01:06,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 16:01:06,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:01:06,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:01:06,686 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:01:06,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-01-27 16:01:06,802 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 16:01:06,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:01:06,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 16:01:06,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:01:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 16:01:06,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 16:01:06,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 16:01:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111112872] [2024-01-27 16:01:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111112872] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:01:06,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:01:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:01:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906846344] [2024-01-27 16:01:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:01:06,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:01:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 16:01:06,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:01:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:01:06,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-01-27 16:01:06,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-01-27 16:01:06,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:01:06,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-01-27 16:01:06,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:01:07,061 INFO L124 PetriNetUnfolderBase]: 148/261 cut-off events. [2024-01-27 16:01:07,061 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2024-01-27 16:01:07,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 261 events. 148/261 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 786 event pairs, 41 based on Foata normal form. 10/270 useless extension candidates. Maximal degree in co-relation 1005. Up to 176 conditions per place. [2024-01-27 16:01:07,063 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 44 selfloop transitions, 22 changer transitions 1/68 dead transitions. [2024-01-27 16:01:07,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 536 flow [2024-01-27 16:01:07,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:01:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:01:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-01-27 16:01:07,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-01-27 16:01:07,065 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 326 flow. Second operand 5 states and 47 transitions. [2024-01-27 16:01:07,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 536 flow [2024-01-27 16:01:07,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 496 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-01-27 16:01:07,069 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 370 flow [2024-01-27 16:01:07,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2024-01-27 16:01:07,069 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 32 predicate places. [2024-01-27 16:01:07,070 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 370 flow [2024-01-27 16:01:07,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-01-27 16:01:07,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:01:07,070 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:01:07,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-01-27 16:01:07,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:01:07,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:01:07,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:01:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1571233670, now seen corresponding path program 1 times [2024-01-27 16:01:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 16:01:07,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094073985] [2024-01-27 16:01:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:01:07,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 16:01:07,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 16:01:07,276 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 16:01:07,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-01-27 16:01:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:01:07,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 16:01:07,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:01:08,215 INFO L349 Elim1Store]: treesize reduction 420, result has 20.6 percent of original size [2024-01-27 16:01:08,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 20 new quantified variables, introduced 66 case distinctions, treesize of input 1313 treesize of output 237 [2024-01-27 16:02:26,295 WARN L293 SmtUtils]: Spent 20.05s on a formula simplification that was a NOOP. DAG size: 2097 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 16:08:06,481 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 3047 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 16:08:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 16:08:08,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:08:36,415 WARN L293 SmtUtils]: Spent 12.75s on a formula simplification. DAG size of input: 1111 DAG size of output: 253 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-01-27 16:08:36,415 INFO L349 Elim1Store]: treesize reduction 2259, result has 19.6 percent of original size [2024-01-27 16:08:36,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 40 new quantified variables, introduced 276 case distinctions, treesize of input 1725 treesize of output 801 Killed by 15