./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-4.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 bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:09:48,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:09:48,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:09:48,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:09:48,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:09:48,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:09:48,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:09:48,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:09:48,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:09:48,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:09:48,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:09:48,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:09:48,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:09:48,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:09:48,465 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:09:48,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:09:48,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:09:48,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:09:48,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:09:48,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:09:48,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:09:48,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:09:48,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:09:48,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:09:48,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:09:48,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:09:48,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:09:48,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:09:48,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:09:48,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:09:48,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:09:48,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:09:48,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:09:48,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:09:48,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:09:48,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:09:48,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:09:48,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:09:48,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:09:48,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:09:48,470 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:09:48,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:09:48,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:09:48,473 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 -> bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd [2024-06-27 17:09:48,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:09:48,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:09:48,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:09:48,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:09:48,731 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:09:48,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-06-27 17:09:49,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:09:50,007 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:09:50,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-06-27 17:09:50,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79c8e42c/3065806532334129b8b5b5d9f734f64b/FLAGd9703c216 [2024-06-27 17:09:50,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79c8e42c/3065806532334129b8b5b5d9f734f64b [2024-06-27 17:09:50,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:09:50,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:09:50,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:09:50,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:09:50,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:09:50,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bab044f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50, skipping insertion in model container [2024-06-27 17:09:50,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,054 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:09:50,204 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2024-06-27 17:09:50,211 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:09:50,217 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:09:50,233 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2024-06-27 17:09:50,235 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:09:50,248 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:09:50,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50 WrapperNode [2024-06-27 17:09:50,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:09:50,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:09:50,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:09:50,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:09:50,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,302 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 147 [2024-06-27 17:09:50,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:09:50,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:09:50,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:09:50,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:09:50,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,328 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:09:50,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:09:50,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:09:50,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:09:50,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:09:50,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (1/1) ... [2024-06-27 17:09:50,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:09:50,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:50,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:09:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:09:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:09:50,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:09:50,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:09:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:09:50,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:09:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:09:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:09:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:09:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:09:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:09:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:09:50,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:09:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:09:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:09:50,417 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:09:50,502 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:09:50,504 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:09:50,691 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:09:50,692 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:09:50,856 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:09:50,856 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:09:50,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:09:50 BoogieIcfgContainer [2024-06-27 17:09:50,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:09:50,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:09:50,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:09:50,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:09:50,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:09:50" (1/3) ... [2024-06-27 17:09:50,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b342102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:09:50, skipping insertion in model container [2024-06-27 17:09:50,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:50" (2/3) ... [2024-06-27 17:09:50,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b342102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:09:50, skipping insertion in model container [2024-06-27 17:09:50,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:09:50" (3/3) ... [2024-06-27 17:09:50,866 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2024-06-27 17:09:50,872 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:09:50,880 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:09:50,881 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:09:50,881 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:09:50,931 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:09:50,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:09:50,993 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-06-27 17:09:50,994 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:09:50,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 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/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-06-27 17:09:50,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:09:51,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-06-27 17:09:51,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:09:51,025 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;@3939e5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:09:51,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:09:51,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:09:51,039 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-06-27 17:09:51,039 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:09:51,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:51,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:51,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:51,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1964995360, now seen corresponding path program 1 times [2024-06-27 17:09:51,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273750776] [2024-06-27 17:09:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:51,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:09:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273750776] [2024-06-27 17:09:51,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273750776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:51,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:51,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:09:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710981813] [2024-06-27 17:09:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:51,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:09:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:51,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:09:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:09:51,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:51,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:51,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:51,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:51,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:51,548 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2024-06-27 17:09:51,548 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 17:09:51,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2024-06-27 17:09:51,551 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-06-27 17:09:51,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2024-06-27 17:09:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:09:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:09:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-06-27 17:09:51,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-06-27 17:09:51,562 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2024-06-27 17:09:51,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2024-06-27 17:09:51,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:09:51,566 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2024-06-27 17:09:51,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2024-06-27 17:09:51,570 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-06-27 17:09:51,570 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2024-06-27 17:09:51,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:51,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:51,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:51,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:09:51,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:51,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:51,572 INFO L85 PathProgramCache]: Analyzing trace with hash 145856653, now seen corresponding path program 1 times [2024-06-27 17:09:51,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:51,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321455905] [2024-06-27 17:09:51,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:51,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:51,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321455905] [2024-06-27 17:09:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321455905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:09:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656706689] [2024-06-27 17:09:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:09:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:09:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:09:51,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:51,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 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-06-27 17:09:51,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:51,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:51,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:51,757 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2024-06-27 17:09:51,757 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 17:09:51,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 302 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2024-06-27 17:09:51,759 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2024-06-27 17:09:51,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2024-06-27 17:09:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:09:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:09:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-06-27 17:09:51,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:09:51,760 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2024-06-27 17:09:51,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2024-06-27 17:09:51,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:51,762 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2024-06-27 17:09:51,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2024-06-27 17:09:51,762 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2024-06-27 17:09:51,763 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2024-06-27 17:09:51,763 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-06-27 17:09:51,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:51,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:51,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:09:51,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:51,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash -598134457, now seen corresponding path program 1 times [2024-06-27 17:09:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750777738] [2024-06-27 17:09:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:51,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:51,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750777738] [2024-06-27 17:09:51,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750777738] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:51,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138660355] [2024-06-27 17:09:51,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:51,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:51,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:51,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:09:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:51,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:09:51,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:52,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138660355] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:52,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:09:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-06-27 17:09:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572032086] [2024-06-27 17:09:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:52,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:09:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:09:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:09:52,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:52,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:52,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:52,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:52,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:52,199 INFO L124 PetriNetUnfolderBase]: 76/138 cut-off events. [2024-06-27 17:09:52,200 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-06-27 17:09:52,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 138 events. 76/138 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 22 based on Foata normal form. 5/142 useless extension candidates. Maximal degree in co-relation 317. Up to 71 conditions per place. [2024-06-27 17:09:52,202 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2024-06-27 17:09:52,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 168 flow [2024-06-27 17:09:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:09:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:09:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-06-27 17:09:52,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-06-27 17:09:52,204 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 4 states and 45 transitions. [2024-06-27 17:09:52,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 168 flow [2024-06-27 17:09:52,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:52,208 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 88 flow [2024-06-27 17:09:52,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2024-06-27 17:09:52,209 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2024-06-27 17:09:52,209 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 88 flow [2024-06-27 17:09:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:52,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:52,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:52,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 17:09:52,416 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-06-27 17:09:52,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:52,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash -508767549, now seen corresponding path program 1 times [2024-06-27 17:09:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:52,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364648815] [2024-06-27 17:09:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:52,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:52,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364648815] [2024-06-27 17:09:52,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364648815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:52,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:52,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:09:52,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623063863] [2024-06-27 17:09:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:52,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:09:52,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:09:52,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:09:52,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:52,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:52,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:52,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:52,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:52,671 INFO L124 PetriNetUnfolderBase]: 85/167 cut-off events. [2024-06-27 17:09:52,671 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-06-27 17:09:52,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 167 events. 85/167 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 556 event pairs, 24 based on Foata normal form. 9/175 useless extension candidates. Maximal degree in co-relation 442. Up to 93 conditions per place. [2024-06-27 17:09:52,673 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 4 changer transitions 7/43 dead transitions. [2024-06-27 17:09:52,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 43 transitions, 243 flow [2024-06-27 17:09:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2024-06-27 17:09:52,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-27 17:09:52,674 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 88 flow. Second operand 5 states and 53 transitions. [2024-06-27 17:09:52,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 43 transitions, 243 flow [2024-06-27 17:09:52,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 238 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:52,676 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 115 flow [2024-06-27 17:09:52,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2024-06-27 17:09:52,677 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2024-06-27 17:09:52,677 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 115 flow [2024-06-27 17:09:52,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:52,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:52,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:52,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:09:52,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:52,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash 502260631, now seen corresponding path program 2 times [2024-06-27 17:09:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:52,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203490674] [2024-06-27 17:09:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:52,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203490674] [2024-06-27 17:09:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203490674] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710201108] [2024-06-27 17:09:52,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:09:52,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:52,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:52,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:52,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 17:09:52,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:09:52,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:09:52,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:09:52,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:52,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:52,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710201108] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:52,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:09:52,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2024-06-27 17:09:52,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139595434] [2024-06-27 17:09:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:52,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:09:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:09:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:09:52,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:52,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:52,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:52,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:52,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:53,003 INFO L124 PetriNetUnfolderBase]: 87/166 cut-off events. [2024-06-27 17:09:53,003 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-06-27 17:09:53,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 166 events. 87/166 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 25 based on Foata normal form. 4/169 useless extension candidates. Maximal degree in co-relation 550. Up to 103 conditions per place. [2024-06-27 17:09:53,006 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 3/36 dead transitions. [2024-06-27 17:09:53,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 234 flow [2024-06-27 17:09:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:09:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:09:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 17:09:53,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 17:09:53,008 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 115 flow. Second operand 4 states and 44 transitions. [2024-06-27 17:09:53,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 234 flow [2024-06-27 17:09:53,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 221 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 17:09:53,012 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 134 flow [2024-06-27 17:09:53,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2024-06-27 17:09:53,013 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2024-06-27 17:09:53,013 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 134 flow [2024-06-27 17:09:53,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:53,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:53,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:53,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 17:09:53,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:53,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:53,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1082508279, now seen corresponding path program 2 times [2024-06-27 17:09:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:53,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624709400] [2024-06-27 17:09:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624709400] [2024-06-27 17:09:53,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624709400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:53,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:53,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:09:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869265565] [2024-06-27 17:09:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:53,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:09:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:53,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:09:53,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:09:53,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:53,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:53,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:53,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:53,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:53,436 INFO L124 PetriNetUnfolderBase]: 96/186 cut-off events. [2024-06-27 17:09:53,436 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2024-06-27 17:09:53,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 186 events. 96/186 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 618 event pairs, 25 based on Foata normal form. 2/187 useless extension candidates. Maximal degree in co-relation 637. Up to 99 conditions per place. [2024-06-27 17:09:53,437 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 9 changer transitions 9/50 dead transitions. [2024-06-27 17:09:53,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 343 flow [2024-06-27 17:09:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:09:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:09:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2024-06-27 17:09:53,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 17:09:53,440 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 134 flow. Second operand 6 states and 60 transitions. [2024-06-27 17:09:53,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 343 flow [2024-06-27 17:09:53,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:53,444 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 191 flow [2024-06-27 17:09:53,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-27 17:09:53,446 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2024-06-27 17:09:53,446 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 191 flow [2024-06-27 17:09:53,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:53,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:53,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:53,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:09:53,447 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-06-27 17:09:53,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2069705145, now seen corresponding path program 3 times [2024-06-27 17:09:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:53,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246445668] [2024-06-27 17:09:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246445668] [2024-06-27 17:09:53,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246445668] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21619617] [2024-06-27 17:09:53,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:09:53,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:53,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:53,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:53,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 17:09:53,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:09:53,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:09:53,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:09:53,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:53,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21619617] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:09:53,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:09:53,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-06-27 17:09:53,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973207302] [2024-06-27 17:09:53,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:09:53,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:09:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:53,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:09:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:09:53,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:53,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 191 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:53,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:53,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:53,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:53,802 INFO L124 PetriNetUnfolderBase]: 106/205 cut-off events. [2024-06-27 17:09:53,803 INFO L125 PetriNetUnfolderBase]: For 451/451 co-relation queries the response was YES. [2024-06-27 17:09:53,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 205 events. 106/205 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 657 event pairs, 35 based on Foata normal form. 5/209 useless extension candidates. Maximal degree in co-relation 808. Up to 133 conditions per place. [2024-06-27 17:09:53,804 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 33 selfloop transitions, 13 changer transitions 3/50 dead transitions. [2024-06-27 17:09:53,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 403 flow [2024-06-27 17:09:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2024-06-27 17:09:53,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-27 17:09:53,805 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 191 flow. Second operand 5 states and 53 transitions. [2024-06-27 17:09:53,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 403 flow [2024-06-27 17:09:53,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 381 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 17:09:53,807 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 275 flow [2024-06-27 17:09:53,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-06-27 17:09:53,808 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2024-06-27 17:09:53,808 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 275 flow [2024-06-27 17:09:53,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:53,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:53,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:53,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:09:54,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:54,025 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-06-27 17:09:54,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 74454075, now seen corresponding path program 3 times [2024-06-27 17:09:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:54,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392989527] [2024-06-27 17:09:54,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:54,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392989527] [2024-06-27 17:09:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392989527] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445525650] [2024-06-27 17:09:54,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:09:54,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:54,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:54,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:54,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 17:09:54,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:09:54,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:09:54,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:09:54,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:54,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:09:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445525650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:09:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-06-27 17:09:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152286789] [2024-06-27 17:09:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:54,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:09:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:09:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:09:54,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:54,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:54,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:54,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:54,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:54,310 INFO L124 PetriNetUnfolderBase]: 107/201 cut-off events. [2024-06-27 17:09:54,311 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2024-06-27 17:09:54,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 201 events. 107/201 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 637 event pairs, 31 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 896. Up to 136 conditions per place. [2024-06-27 17:09:54,312 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 13 changer transitions 3/47 dead transitions. [2024-06-27 17:09:54,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 429 flow [2024-06-27 17:09:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2024-06-27 17:09:54,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49 [2024-06-27 17:09:54,313 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 275 flow. Second operand 5 states and 49 transitions. [2024-06-27 17:09:54,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 429 flow [2024-06-27 17:09:54,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 410 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:54,316 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 304 flow [2024-06-27 17:09:54,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2024-06-27 17:09:54,316 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2024-06-27 17:09:54,316 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 304 flow [2024-06-27 17:09:54,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:54,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:54,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:54,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:09:54,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:54,529 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-06-27 17:09:54,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash -466967981, now seen corresponding path program 4 times [2024-06-27 17:09:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012135387] [2024-06-27 17:09:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012135387] [2024-06-27 17:09:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012135387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:54,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:54,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:09:54,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249618573] [2024-06-27 17:09:54,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:54,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:09:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:54,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:09:54,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:09:54,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:54,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:54,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:54,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:54,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:54,649 INFO L124 PetriNetUnfolderBase]: 94/170 cut-off events. [2024-06-27 17:09:54,649 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2024-06-27 17:09:54,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 170 events. 94/170 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 479 event pairs, 29 based on Foata normal form. 4/173 useless extension candidates. Maximal degree in co-relation 790. Up to 122 conditions per place. [2024-06-27 17:09:54,651 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 9 changer transitions 4/44 dead transitions. [2024-06-27 17:09:54,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 433 flow [2024-06-27 17:09:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2024-06-27 17:09:54,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-06-27 17:09:54,652 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 304 flow. Second operand 5 states and 43 transitions. [2024-06-27 17:09:54,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 433 flow [2024-06-27 17:09:54,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 399 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 17:09:54,655 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 307 flow [2024-06-27 17:09:54,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-06-27 17:09:54,655 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2024-06-27 17:09:54,655 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 307 flow [2024-06-27 17:09:54,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:54,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:54,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:54,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:09:54,656 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-06-27 17:09:54,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1614118186, now seen corresponding path program 1 times [2024-06-27 17:09:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:54,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058830501] [2024-06-27 17:09:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:09:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058830501] [2024-06-27 17:09:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058830501] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564340091] [2024-06-27 17:09:54,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:54,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:54,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:54,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:54,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 17:09:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:54,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjunts are in the unsatisfiable core [2024-06-27 17:09:54,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:54,864 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-06-27 17:09:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:09:54,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:55,313 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 283 treesize of output 249 [2024-06-27 17:09:55,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:09:55,572 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 13 new quantified variables, introduced 28 case distinctions, treesize of input 1392 treesize of output 1002 [2024-06-27 17:10:09,980 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 17:10:18,574 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:10:27,090 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 17:10:33,206 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:10:37,387 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 17:10:39,485 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:10:48,717 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:11:01,346 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 17:11:13,729 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:11:18,549 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 17:11:25,307 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:11:29,767 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:11:48,872 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-06-27 17:16:10,386 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-06-27 17:17:29,292 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 17:17:36,516 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-06-27 17:18:14,443 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-06-27 17:18:14,443 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-06-27 17:18:14,445 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 17:18:14,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:14,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 17:18:14,646 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:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) 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:609) 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-06-27 17:18:14,651 INFO L158 Benchmark]: Toolchain (without parser) took 504619.71ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 93.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-06-27 17:18:14,651 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:18:14,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.31ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 134.8MB in the end (delta: -41.2MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-06-27 17:18:14,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.61ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:18:14,652 INFO L158 Benchmark]: Boogie Preprocessor took 49.69ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 129.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:18:14,652 INFO L158 Benchmark]: RCFGBuilder took 502.30ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 83.4MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-06-27 17:18:14,653 INFO L158 Benchmark]: TraceAbstraction took 503792.16ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 83.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-06-27 17:18:14,653 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.13ms. Allocated memory is still 100.7MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.31ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 134.8MB in the end (delta: -41.2MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.61ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.69ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 129.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 502.30ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 83.4MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 503792.16ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 83.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.6GB. 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-4.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 bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:18:16,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:18:16,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 17:18:16,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:18:16,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:18:16,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:18:16,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:18:16,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:18:16,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:18:16,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:18:16,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:18:16,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:18:16,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:18:16,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:18:16,627 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:18:16,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:18:16,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:18:16,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:18:16,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:18:16,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:18:16,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:18:16,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:18:16,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:18:16,629 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 17:18:16,630 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 17:18:16,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:18:16,630 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 17:18:16,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:18:16,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:18:16,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:18:16,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:18:16,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:18:16,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:18:16,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:18:16,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:18:16,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:18:16,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:18:16,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:18:16,633 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 17:18:16,633 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 17:18:16,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:18:16,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:18:16,634 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:18:16,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:18:16,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:18:16,638 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 17:18:16,639 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 -> bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd [2024-06-27 17:18:16,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:18:16,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:18:16,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:18:16,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:18:16,934 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:18:16,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-06-27 17:18:17,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:18:18,135 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:18:18,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-06-27 17:18:18,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c68c87f/bca8e0826ebe45faa80209bd2aaa13b7/FLAG133b79c59 [2024-06-27 17:18:18,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c68c87f/bca8e0826ebe45faa80209bd2aaa13b7 [2024-06-27 17:18:18,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:18:18,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:18:18,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:18:18,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:18:18,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:18:18,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dde823f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18, skipping insertion in model container [2024-06-27 17:18:18,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,201 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:18:18,362 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2024-06-27 17:18:18,368 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:18:18,383 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 17:18:18,385 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:18:18,394 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2024-06-27 17:18:18,396 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:18:18,399 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:18:18,415 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2024-06-27 17:18:18,417 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:18:18,430 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:18:18,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18 WrapperNode [2024-06-27 17:18:18,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:18:18,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:18:18,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:18:18,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:18:18,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,472 INFO L138 Inliner]: procedures = 25, calls = 26, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 145 [2024-06-27 17:18:18,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:18:18,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:18:18,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:18:18,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:18:18,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,518 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:18:18,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:18:18,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:18:18,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:18:18,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:18:18,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (1/1) ... [2024-06-27 17:18:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:18:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:18:18,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:18:18,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:18:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:18:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:18:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:18:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:18:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:18:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 17:18:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 17:18:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:18:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 17:18:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 17:18:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:18:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:18:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 17:18:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 17:18:18,617 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:18:18,691 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:18:18,693 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:18:18,968 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:18:18,969 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:18:19,211 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:18:19,211 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:18:19,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:18:19 BoogieIcfgContainer [2024-06-27 17:18:19,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:18:19,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:18:19,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:18:19,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:18:19,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:18:18" (1/3) ... [2024-06-27 17:18:19,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f155ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:18:19, skipping insertion in model container [2024-06-27 17:18:19,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:18" (2/3) ... [2024-06-27 17:18:19,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f155ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:18:19, skipping insertion in model container [2024-06-27 17:18:19,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:18:19" (3/3) ... [2024-06-27 17:18:19,219 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2024-06-27 17:18:19,224 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:18:19,231 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:18:19,231 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:18:19,231 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:18:19,263 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:18:19,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:18:19,313 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-06-27 17:18:19,313 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:18:19,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 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/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-06-27 17:18:19,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:18:19,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-06-27 17:18:19,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:18:19,337 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;@69cff818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:18:19,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:18:19,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:18:19,350 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-06-27 17:18:19,350 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:18:19,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:19,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:19,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:19,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash 983640416, now seen corresponding path program 1 times [2024-06-27 17:18:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:19,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254876236] [2024-06-27 17:18:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:19,366 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-06-27 17:18:19,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:19,368 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-06-27 17:18:19,381 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-06-27 17:18:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:19,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 17:18:19,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:18:19,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:19,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254876236] [2024-06-27 17:18:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254876236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:18:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084779189] [2024-06-27 17:18:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:19,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:18:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:19,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:18:19,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:18:19,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:19,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:19,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:19,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:19,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:19,718 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2024-06-27 17:18:19,719 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 17:18:19,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2024-06-27 17:18:19,722 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-06-27 17:18:19,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2024-06-27 17:18:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:18:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:18:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-06-27 17:18:19,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-06-27 17:18:19,732 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2024-06-27 17:18:19,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2024-06-27 17:18:19,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:18:19,736 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2024-06-27 17:18:19,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2024-06-27 17:18:19,740 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-06-27 17:18:19,740 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2024-06-27 17:18:19,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:19,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:19,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:19,762 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 (2)] Ended with exit code 0 [2024-06-27 17:18:19,945 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-06-27 17:18:19,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:19,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1359252489, now seen corresponding path program 1 times [2024-06-27 17:18:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314817607] [2024-06-27 17:18:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:19,949 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-06-27 17:18:19,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:19,950 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-06-27 17:18:19,986 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-06-27 17:18:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:20,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:20,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:20,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:20,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:20,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314817607] [2024-06-27 17:18:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314817607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:20,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:18:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75301504] [2024-06-27 17:18:20,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:20,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:18:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:18:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:18:20,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:20,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 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-06-27 17:18:20,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:20,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:20,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:20,136 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2024-06-27 17:18:20,137 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 17:18:20,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 302 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2024-06-27 17:18:20,138 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2024-06-27 17:18:20,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2024-06-27 17:18:20,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:18:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:18:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-06-27 17:18:20,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:18:20,139 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2024-06-27 17:18:20,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2024-06-27 17:18:20,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:20,151 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2024-06-27 17:18:20,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2024-06-27 17:18:20,152 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2024-06-27 17:18:20,152 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2024-06-27 17:18:20,152 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-06-27 17:18:20,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:20,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:20,158 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-06-27 17:18:20,355 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-06-27 17:18:20,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:20,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1637569209, now seen corresponding path program 1 times [2024-06-27 17:18:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698837750] [2024-06-27 17:18:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:20,357 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-06-27 17:18:20,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:20,358 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-06-27 17:18:20,378 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-06-27 17:18:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:20,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:18:20,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:20,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:20,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698837750] [2024-06-27 17:18:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698837750] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:20,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:20,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-06-27 17:18:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953018084] [2024-06-27 17:18:20,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:20,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:18:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:18:20,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:18:20,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:20,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:20,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:20,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:20,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:20,781 INFO L124 PetriNetUnfolderBase]: 126/233 cut-off events. [2024-06-27 17:18:20,781 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-06-27 17:18:20,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 233 events. 126/233 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 808 event pairs, 24 based on Foata normal form. 28/260 useless extension candidates. Maximal degree in co-relation 551. Up to 82 conditions per place. [2024-06-27 17:18:20,783 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 50 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2024-06-27 17:18:20,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 60 transitions, 298 flow [2024-06-27 17:18:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:18:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:18:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-27 17:18:20,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-06-27 17:18:20,785 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 7 states and 80 transitions. [2024-06-27 17:18:20,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 60 transitions, 298 flow [2024-06-27 17:18:20,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 60 transitions, 294 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:20,788 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 138 flow [2024-06-27 17:18:20,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-06-27 17:18:20,789 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2024-06-27 17:18:20,789 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 138 flow [2024-06-27 17:18:20,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:20,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:20,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:20,793 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 (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:20,989 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-06-27 17:18:20,990 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:20,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash -534548345, now seen corresponding path program 1 times [2024-06-27 17:18:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179129864] [2024-06-27 17:18:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:20,991 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-06-27 17:18:20,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:21,028 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-06-27 17:18:21,057 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-06-27 17:18:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:21,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:21,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:21,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:21,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:21,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179129864] [2024-06-27 17:18:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179129864] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:18:21,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:18:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-06-27 17:18:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067335573] [2024-06-27 17:18:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:21,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:18:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:18:21,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:18:21,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:21,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:21,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:21,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:21,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:21,337 INFO L124 PetriNetUnfolderBase]: 124/226 cut-off events. [2024-06-27 17:18:21,338 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-06-27 17:18:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 226 events. 124/226 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 22 based on Foata normal form. 4/229 useless extension candidates. Maximal degree in co-relation 742. Up to 154 conditions per place. [2024-06-27 17:18:21,340 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2024-06-27 17:18:21,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 266 flow [2024-06-27 17:18:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:18:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:18:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 17:18:21,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 17:18:21,341 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 138 flow. Second operand 4 states and 44 transitions. [2024-06-27 17:18:21,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 266 flow [2024-06-27 17:18:21,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 260 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 17:18:21,344 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 172 flow [2024-06-27 17:18:21,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-27 17:18:21,345 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2024-06-27 17:18:21,345 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 172 flow [2024-06-27 17:18:21,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:21,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:21,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:21,350 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 (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:21,548 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-06-27 17:18:21,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:21,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:21,549 INFO L85 PathProgramCache]: Analyzing trace with hash -787584265, now seen corresponding path program 2 times [2024-06-27 17:18:21,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:21,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442933551] [2024-06-27 17:18:21,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:21,550 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-06-27 17:18:21,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:21,551 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-06-27 17:18:21,555 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-06-27 17:18:21,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:21,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:21,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 17:18:21,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:21,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:21,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:21,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442933551] [2024-06-27 17:18:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442933551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:21,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:21,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:18:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177245939] [2024-06-27 17:18:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:21,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:18:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:21,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:18:21,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:18:21,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:21,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:21,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:21,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:21,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:21,786 INFO L124 PetriNetUnfolderBase]: 117/210 cut-off events. [2024-06-27 17:18:21,786 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2024-06-27 17:18:21,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 210 events. 117/210 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 636 event pairs, 51 based on Foata normal form. 3/212 useless extension candidates. Maximal degree in co-relation 735. Up to 146 conditions per place. [2024-06-27 17:18:21,788 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 6 changer transitions 8/43 dead transitions. [2024-06-27 17:18:21,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 302 flow [2024-06-27 17:18:21,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:18:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:18:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 17:18:21,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 17:18:21,789 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 172 flow. Second operand 4 states and 44 transitions. [2024-06-27 17:18:21,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 302 flow [2024-06-27 17:18:21,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 293 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:21,792 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 185 flow [2024-06-27 17:18:21,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2024-06-27 17:18:21,792 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2024-06-27 17:18:21,792 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 185 flow [2024-06-27 17:18:21,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:21,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:21,793 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:21,808 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 (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:21,996 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-06-27 17:18:21,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:21,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1856794386, now seen corresponding path program 2 times [2024-06-27 17:18:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867401799] [2024-06-27 17:18:21,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:21,997 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-06-27 17:18:21,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:21,999 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-06-27 17:18:21,999 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-06-27 17:18:22,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:22,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:22,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:18:22,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:18:22,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:22,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:22,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867401799] [2024-06-27 17:18:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867401799] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:22,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2024-06-27 17:18:22,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647429470] [2024-06-27 17:18:22,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:22,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:22,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:22,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:22,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:22,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:22,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 185 flow. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:22,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:22,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:22,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:23,126 INFO L124 PetriNetUnfolderBase]: 158/280 cut-off events. [2024-06-27 17:18:23,126 INFO L125 PetriNetUnfolderBase]: For 726/726 co-relation queries the response was YES. [2024-06-27 17:18:23,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 280 events. 158/280 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 917 event pairs, 2 based on Foata normal form. 10/289 useless extension candidates. Maximal degree in co-relation 1030. Up to 127 conditions per place. [2024-06-27 17:18:23,128 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 62 selfloop transitions, 45 changer transitions 0/108 dead transitions. [2024-06-27 17:18:23,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 718 flow [2024-06-27 17:18:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-27 17:18:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-27 17:18:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 164 transitions. [2024-06-27 17:18:23,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-06-27 17:18:23,141 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 185 flow. Second operand 20 states and 164 transitions. [2024-06-27 17:18:23,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 718 flow [2024-06-27 17:18:23,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 108 transitions, 674 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 17:18:23,147 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 541 flow [2024-06-27 17:18:23,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=20, PETRI_FLOW=541, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2024-06-27 17:18:23,153 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 45 predicate places. [2024-06-27 17:18:23,154 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 541 flow [2024-06-27 17:18:23,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:23,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:23,154 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:23,162 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 (7)] Ended with exit code 0 [2024-06-27 17:18:23,354 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-06-27 17:18:23,355 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-06-27 17:18:23,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash 371133204, now seen corresponding path program 3 times [2024-06-27 17:18:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:23,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854364295] [2024-06-27 17:18:23,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:18:23,356 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-06-27 17:18:23,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:23,357 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-06-27 17:18:23,358 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-06-27 17:18:23,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:18:23,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:23,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 17:18:23,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:18:23,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:23,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854364295] [2024-06-27 17:18:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854364295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:23,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:18:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920176528] [2024-06-27 17:18:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:23,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:18:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:23,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:18:23,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:18:23,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:23,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 541 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-06-27 17:18:23,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:23,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:23,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:23,588 INFO L124 PetriNetUnfolderBase]: 166/305 cut-off events. [2024-06-27 17:18:23,588 INFO L125 PetriNetUnfolderBase]: For 2049/2049 co-relation queries the response was YES. [2024-06-27 17:18:23,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 305 events. 166/305 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1035 event pairs, 47 based on Foata normal form. 20/324 useless extension candidates. Maximal degree in co-relation 1560. Up to 184 conditions per place. [2024-06-27 17:18:23,591 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 52 selfloop transitions, 22 changer transitions 4/79 dead transitions. [2024-06-27 17:18:23,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 784 flow [2024-06-27 17:18:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:18:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:18:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2024-06-27 17:18:23,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 17:18:23,594 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 541 flow. Second operand 4 states and 42 transitions. [2024-06-27 17:18:23,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 784 flow [2024-06-27 17:18:23,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 569 flow, removed 78 selfloop flow, removed 9 redundant places. [2024-06-27 17:18:23,599 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 407 flow [2024-06-27 17:18:23,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=407, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-06-27 17:18:23,600 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 40 predicate places. [2024-06-27 17:18:23,600 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 407 flow [2024-06-27 17:18:23,600 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-06-27 17:18:23,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:23,600 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:23,605 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-06-27 17:18:23,805 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-06-27 17:18:23,806 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-06-27 17:18:23,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash -847651710, now seen corresponding path program 4 times [2024-06-27 17:18:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:23,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928186741] [2024-06-27 17:18:23,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:18:23,806 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-06-27 17:18:23,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:23,808 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-06-27 17:18:23,808 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-06-27 17:18:23,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:18:23,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:23,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:18:23,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:24,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:24,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928186741] [2024-06-27 17:18:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928186741] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:24,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:24,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2024-06-27 17:18:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683158123] [2024-06-27 17:18:24,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:24,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 17:18:24,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:24,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 17:18:24,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-06-27 17:18:24,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:24,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 407 flow. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:24,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:24,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:24,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:24,697 INFO L124 PetriNetUnfolderBase]: 178/317 cut-off events. [2024-06-27 17:18:24,697 INFO L125 PetriNetUnfolderBase]: For 2173/2173 co-relation queries the response was YES. [2024-06-27 17:18:24,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 317 events. 178/317 cut-off events. For 2173/2173 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1097 event pairs, 8 based on Foata normal form. 17/333 useless extension candidates. Maximal degree in co-relation 1481. Up to 120 conditions per place. [2024-06-27 17:18:24,699 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 61 selfloop transitions, 35 changer transitions 5/102 dead transitions. [2024-06-27 17:18:24,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 102 transitions, 894 flow [2024-06-27 17:18:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 17:18:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 17:18:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2024-06-27 17:18:24,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42333333333333334 [2024-06-27 17:18:24,700 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 407 flow. Second operand 15 states and 127 transitions. [2024-06-27 17:18:24,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 102 transitions, 894 flow [2024-06-27 17:18:24,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 787 flow, removed 42 selfloop flow, removed 2 redundant places. [2024-06-27 17:18:24,704 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 499 flow [2024-06-27 17:18:24,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=499, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2024-06-27 17:18:24,705 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2024-06-27 17:18:24,705 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 499 flow [2024-06-27 17:18:24,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:24,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:24,705 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:24,708 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 (9)] Ended with exit code 0 [2024-06-27 17:18:24,908 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-06-27 17:18:24,908 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-06-27 17:18:24,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2112114752, now seen corresponding path program 5 times [2024-06-27 17:18:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772261249] [2024-06-27 17:18:24,909 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:18:24,909 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-06-27 17:18:24,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:24,912 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-06-27 17:18:24,913 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-06-27 17:18:24,977 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 17:18:24,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:24,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:18:24,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:25,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:25,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:25,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772261249] [2024-06-27 17:18:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772261249] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:25,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:25,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-06-27 17:18:25,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415455072] [2024-06-27 17:18:25,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:25,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 17:18:25,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:25,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 17:18:25,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-06-27 17:18:25,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:25,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 499 flow. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:25,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:25,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:25,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:30,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:34,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:34,683 INFO L124 PetriNetUnfolderBase]: 312/540 cut-off events. [2024-06-27 17:18:34,683 INFO L125 PetriNetUnfolderBase]: For 3352/3352 co-relation queries the response was YES. [2024-06-27 17:18:34,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 540 events. 312/540 cut-off events. For 3352/3352 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2005 event pairs, 36 based on Foata normal form. 25/564 useless extension candidates. Maximal degree in co-relation 2437. Up to 231 conditions per place. [2024-06-27 17:18:34,686 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 83 selfloop transitions, 85 changer transitions 2/171 dead transitions. [2024-06-27 17:18:34,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 171 transitions, 1526 flow [2024-06-27 17:18:34,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:18:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:18:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 166 transitions. [2024-06-27 17:18:34,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-27 17:18:34,690 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 499 flow. Second operand 18 states and 166 transitions. [2024-06-27 17:18:34,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 171 transitions, 1526 flow [2024-06-27 17:18:34,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 171 transitions, 1364 flow, removed 41 selfloop flow, removed 11 redundant places. [2024-06-27 17:18:34,697 INFO L231 Difference]: Finished difference. Result has 90 places, 123 transitions, 1097 flow [2024-06-27 17:18:34,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1097, PETRI_PLACES=90, PETRI_TRANSITIONS=123} [2024-06-27 17:18:34,701 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2024-06-27 17:18:34,701 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 123 transitions, 1097 flow [2024-06-27 17:18:34,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:34,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:34,701 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:34,710 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-06-27 17:18:34,904 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-06-27 17:18:34,905 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-06-27 17:18:34,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash -419544043, now seen corresponding path program 1 times [2024-06-27 17:18:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:34,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254064499] [2024-06-27 17:18:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:34,906 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-06-27 17:18:34,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:34,907 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-06-27 17:18:34,911 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-06-27 17:18:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:34,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:18:34,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:37,714 INFO L349 Elim1Store]: treesize reduction 774, result has 21.4 percent of original size [2024-06-27 17:18:37,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 28 new quantified variables, introduced 120 case distinctions, treesize of input 5313 treesize of output 394 [2024-06-27 17:21:38,009 WARN L293 SmtUtils]: Spent 16.89s on a formula simplification. DAG size of input: 2343 DAG size of output: 2357 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-06-27 17:23:20,268 WARN L293 SmtUtils]: Spent 9.69s on a formula simplification. DAG size of input: 2318 DAG size of output: 2318 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15