./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.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 5393d9cf3b7cc0865f031a716dd61208c034931418b29464b30da9c6eaf669bf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:27:57,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:27:57,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:27:57,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:27:57,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:27:57,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:27:57,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:27:57,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:27:57,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:27:57,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:27:57,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:27:57,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:27:57,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:27:57,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:27:57,520 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:27:57,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:27:57,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:27:57,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:27:57,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:27:57,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:27:57,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:27:57,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:27:57,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:27:57,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:27:57,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:27:57,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:27:57,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:27:57,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:27:57,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:27:57,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:27:57,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:27:57,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:27:57,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:27:57,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:27:57,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:27:57,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:27:57,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:27:57,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:27:57,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:27:57,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:27:57,526 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:27:57,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:27:57,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:27:57,527 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 -> 5393d9cf3b7cc0865f031a716dd61208c034931418b29464b30da9c6eaf669bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:27:57,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:27:57,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:27:57,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:27:57,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:27:57,796 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:27:57,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-02-19 15:27:59,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:27:59,199 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:27:59,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-02-19 15:27:59,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cad04d6b/5326aede15594e97abddb4a7b929a038/FLAG466d6a6e2 [2024-02-19 15:27:59,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cad04d6b/5326aede15594e97abddb4a7b929a038 [2024-02-19 15:27:59,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:27:59,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:27:59,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:27:59,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:27:59,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:27:59,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e79a1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59, skipping insertion in model container [2024-02-19 15:27:59,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:27:59,418 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2024-02-19 15:27:59,430 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:27:59,438 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:27:59,468 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2024-02-19 15:27:59,474 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:27:59,487 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:27:59,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59 WrapperNode [2024-02-19 15:27:59,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:27:59,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:27:59,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:27:59,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:27:59,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,534 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 137 [2024-02-19 15:27:59,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:27:59,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:27:59,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:27:59,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:27:59,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,577 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 2, 4, 2]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-19 15:27:59,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:27:59,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:27:59,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:27:59,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:27:59,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (1/1) ... [2024-02-19 15:27:59,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:27:59,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:27:59,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:27:59,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:27:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:27:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:27:59,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:27:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:27:59,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:27:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:27:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:27:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:27:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:27:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:27:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:27:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:27:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:27:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:27:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:27:59,685 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:27:59,762 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:27:59,763 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:28:00,034 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:28:00,035 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:28:00,254 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:28:00,254 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-19 15:28:00,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:28:00 BoogieIcfgContainer [2024-02-19 15:28:00,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:28:00,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:28:00,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:28:00,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:28:00,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:27:59" (1/3) ... [2024-02-19 15:28:00,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6a230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:28:00, skipping insertion in model container [2024-02-19 15:28:00,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:27:59" (2/3) ... [2024-02-19 15:28:00,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6a230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:28:00, skipping insertion in model container [2024-02-19 15:28:00,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:28:00" (3/3) ... [2024-02-19 15:28:00,264 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2024-02-19 15:28:00,278 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:28:00,278 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:28:00,278 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:28:00,315 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:28:00,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:28:00,374 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-02-19 15:28:00,374 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:28:00,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-02-19 15:28:00,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:28:00,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-02-19 15:28:00,385 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:28:00,389 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d59dffe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:28:00,389 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:28:00,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:28:00,395 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-02-19 15:28:00,395 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:28:00,395 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:00,396 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:00,396 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:00,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2005861630, now seen corresponding path program 1 times [2024-02-19 15:28:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203844926] [2024-02-19 15:28:00,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:00,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203844926] [2024-02-19 15:28:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203844926] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:28:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913169621] [2024-02-19 15:28:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:00,610 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:28:00,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:28:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:28:00,632 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:28:00,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-02-19 15:28:00,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:00,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:28:00,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:00,714 INFO L124 PetriNetUnfolderBase]: 66/117 cut-off events. [2024-02-19 15:28:00,715 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-19 15:28:00,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 117 events. 66/117 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 9 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2024-02-19 15:28:00,717 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-02-19 15:28:00,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2024-02-19 15:28:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:28:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:28:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-02-19 15:28:00,725 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-02-19 15:28:00,728 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-02-19 15:28:00,728 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 28 transitions, 127 flow [2024-02-19 15:28:00,729 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-02-19 15:28:00,729 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:00,729 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:00,729 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:28:00,729 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:00,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:00,730 INFO L85 PathProgramCache]: Analyzing trace with hash -811375615, now seen corresponding path program 1 times [2024-02-19 15:28:00,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:00,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965304580] [2024-02-19 15:28:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:00,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:00,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965304580] [2024-02-19 15:28:00,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965304580] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:00,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:00,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:28:00,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151778888] [2024-02-19 15:28:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:00,838 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:28:00,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:00,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:28:00,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:28:00,839 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:28:00,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 28 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:00,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:00,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:28:00,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:00,876 INFO L124 PetriNetUnfolderBase]: 66/118 cut-off events. [2024-02-19 15:28:00,876 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-19 15:28:00,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 118 events. 66/118 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 9 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2024-02-19 15:28:00,877 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2024-02-19 15:28:00,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 183 flow [2024-02-19 15:28:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:28:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:28:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2024-02-19 15:28:00,879 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-19 15:28:00,879 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2024-02-19 15:28:00,879 INFO L507 AbstractCegarLoop]: Abstraction has has 26 places, 29 transitions, 183 flow [2024-02-19 15:28:00,880 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:00,880 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:00,880 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:00,880 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:28:00,880 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:00,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1585615714, now seen corresponding path program 1 times [2024-02-19 15:28:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:00,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253042157] [2024-02-19 15:28:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253042157] [2024-02-19 15:28:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253042157] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:01,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:01,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:28:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411844345] [2024-02-19 15:28:01,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:01,002 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:28:01,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:28:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:28:01,006 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:01,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 29 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:01,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:01,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:01,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:01,105 INFO L124 PetriNetUnfolderBase]: 93/184 cut-off events. [2024-02-19 15:28:01,106 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-02-19 15:28:01,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 184 events. 93/184 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 622 event pairs, 8 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 566. Up to 156 conditions per place. [2024-02-19 15:28:01,107 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 37 selfloop transitions, 7 changer transitions 17/62 dead transitions. [2024-02-19 15:28:01,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 62 transitions, 513 flow [2024-02-19 15:28:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:28:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:28:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-02-19 15:28:01,110 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-02-19 15:28:01,110 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2024-02-19 15:28:01,110 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 62 transitions, 513 flow [2024-02-19 15:28:01,111 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:01,111 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:01,111 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:01,111 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:28:01,111 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:01,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1592248766, now seen corresponding path program 2 times [2024-02-19 15:28:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047373932] [2024-02-19 15:28:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:01,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:01,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047373932] [2024-02-19 15:28:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047373932] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:01,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:01,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:28:01,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450368178] [2024-02-19 15:28:01,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:01,237 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:28:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:01,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:28:01,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:28:01,241 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:01,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 62 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:01,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:01,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:01,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:01,358 INFO L124 PetriNetUnfolderBase]: 105/218 cut-off events. [2024-02-19 15:28:01,358 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2024-02-19 15:28:01,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 218 events. 105/218 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 783 event pairs, 8 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 870. Up to 189 conditions per place. [2024-02-19 15:28:01,364 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 52 selfloop transitions, 7 changer transitions 39/99 dead transitions. [2024-02-19 15:28:01,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 99 transitions, 1021 flow [2024-02-19 15:28:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:28:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:28:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-02-19 15:28:01,367 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-02-19 15:28:01,368 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2024-02-19 15:28:01,369 INFO L507 AbstractCegarLoop]: Abstraction has has 35 places, 99 transitions, 1021 flow [2024-02-19 15:28:01,369 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:01,369 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:01,369 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:01,369 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:28:01,370 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:01,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1498789104, now seen corresponding path program 3 times [2024-02-19 15:28:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:01,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202928453] [2024-02-19 15:28:01,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202928453] [2024-02-19 15:28:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202928453] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559350319] [2024-02-19 15:28:01,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:28:01,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:01,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:01,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:28:01,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 15:28:01,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:28:01,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:01,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:01,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:01,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:01,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559350319] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:01,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:28:01,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-02-19 15:28:01,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914202050] [2024-02-19 15:28:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:01,706 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:28:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:01,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:28:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:28:01,708 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:28:01,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 99 transitions, 1021 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:01,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:01,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:28:01,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:01,800 INFO L124 PetriNetUnfolderBase]: 113/232 cut-off events. [2024-02-19 15:28:01,800 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-02-19 15:28:01,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 232 events. 113/232 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 850 event pairs, 8 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 1126. Up to 203 conditions per place. [2024-02-19 15:28:01,801 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 56 selfloop transitions, 8 changer transitions 39/106 dead transitions. [2024-02-19 15:28:01,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 106 transitions, 1294 flow [2024-02-19 15:28:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:28:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:28:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2024-02-19 15:28:01,803 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-19 15:28:01,805 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 16 predicate places. [2024-02-19 15:28:01,805 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 106 transitions, 1294 flow [2024-02-19 15:28:01,805 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:01,805 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:01,805 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:01,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:28:02,016 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:02,017 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:02,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2048571309, now seen corresponding path program 1 times [2024-02-19 15:28:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:02,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002190434] [2024-02-19 15:28:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002190434] [2024-02-19 15:28:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002190434] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845254613] [2024-02-19 15:28:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:02,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:02,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:02,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:28:02,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 15:28:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:02,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:02,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:02,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845254613] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:28:02,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-02-19 15:28:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117481774] [2024-02-19 15:28:02,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:02,246 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:28:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:28:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:28:02,247 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:28:02,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 106 transitions, 1294 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:02,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:02,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:28:02,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:02,310 INFO L124 PetriNetUnfolderBase]: 119/242 cut-off events. [2024-02-19 15:28:02,310 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2024-02-19 15:28:02,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 242 events. 119/242 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 877 event pairs, 8 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 1377. Up to 213 conditions per place. [2024-02-19 15:28:02,312 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 60 selfloop transitions, 8 changer transitions 39/111 dead transitions. [2024-02-19 15:28:02,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 111 transitions, 1560 flow [2024-02-19 15:28:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:28:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:28:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:28:02,325 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:28:02,327 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2024-02-19 15:28:02,327 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 111 transitions, 1560 flow [2024-02-19 15:28:02,327 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:02,327 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:02,328 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:02,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 15:28:02,539 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-19 15:28:02,540 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:02,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:02,540 INFO L85 PathProgramCache]: Analyzing trace with hash -538764308, now seen corresponding path program 4 times [2024-02-19 15:28:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350827540] [2024-02-19 15:28:02,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350827540] [2024-02-19 15:28:02,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350827540] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:02,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902392653] [2024-02-19 15:28:02,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:28:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:02,612 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-02-19 15:28:02,637 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-02-19 15:28:02,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:28:02,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:02,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:02,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:02,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-02-19 15:28:02,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:02,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902392653] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:02,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:02,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2024-02-19 15:28:02,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675956522] [2024-02-19 15:28:02,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:02,770 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 15:28:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 15:28:02,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 15:28:02,773 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:02,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 111 transitions, 1560 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-02-19 15:28:02,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:02,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:02,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:02,904 INFO L124 PetriNetUnfolderBase]: 135/270 cut-off events. [2024-02-19 15:28:02,904 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2024-02-19 15:28:02,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 270 events. 135/270 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1019 event pairs, 8 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 1808. Up to 241 conditions per place. [2024-02-19 15:28:02,906 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 66 selfloop transitions, 17 changer transitions 39/123 dead transitions. [2024-02-19 15:28:02,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 123 transitions, 1978 flow [2024-02-19 15:28:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:28:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:28:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-02-19 15:28:02,908 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2024-02-19 15:28:02,908 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 25 predicate places. [2024-02-19 15:28:02,908 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 123 transitions, 1978 flow [2024-02-19 15:28:02,908 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-02-19 15:28:02,908 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:02,909 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:02,920 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-02-19 15:28:03,120 WARN L489 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-02-19 15:28:03,121 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:03,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1449660235, now seen corresponding path program 2 times [2024-02-19 15:28:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430495026] [2024-02-19 15:28:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430495026] [2024-02-19 15:28:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430495026] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261725207] [2024-02-19 15:28:03,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:28:03,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:03,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:03,215 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-02-19 15:28:03,236 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-02-19 15:28:03,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:28:03,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:03,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:03,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:03,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261725207] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:03,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-02-19 15:28:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075460967] [2024-02-19 15:28:03,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:03,362 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:28:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:03,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:28:03,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:28:03,363 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:03,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 123 transitions, 1978 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:03,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:03,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:03,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:03,464 INFO L124 PetriNetUnfolderBase]: 156/300 cut-off events. [2024-02-19 15:28:03,464 INFO L125 PetriNetUnfolderBase]: For 299/299 co-relation queries the response was YES. [2024-02-19 15:28:03,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 300 events. 156/300 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1124 event pairs, 4 based on Foata normal form. 2/247 useless extension candidates. Maximal degree in co-relation 2294. Up to 270 conditions per place. [2024-02-19 15:28:03,467 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 79 selfloop transitions, 17 changer transitions 41/138 dead transitions. [2024-02-19 15:28:03,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 138 transitions, 2483 flow [2024-02-19 15:28:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:28:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:28:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-02-19 15:28:03,468 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-02-19 15:28:03,468 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 30 predicate places. [2024-02-19 15:28:03,469 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 138 transitions, 2483 flow [2024-02-19 15:28:03,469 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:03,469 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:03,469 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:03,490 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-02-19 15:28:03,680 WARN L489 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-02-19 15:28:03,681 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:03,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 249798049, now seen corresponding path program 5 times [2024-02-19 15:28:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273689603] [2024-02-19 15:28:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273689603] [2024-02-19 15:28:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273689603] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2236864] [2024-02-19 15:28:03,819 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:28:03,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:03,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:03,830 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-02-19 15:28:03,853 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-02-19 15:28:03,893 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:28:03,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:03,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:03,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:28:03,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:28:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2236864] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:03,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:03,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-02-19 15:28:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621517864] [2024-02-19 15:28:03,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:03,970 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:28:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:03,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:28:03,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:28:03,974 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:03,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 138 transitions, 2483 flow. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:03,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:03,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:03,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:04,103 INFO L124 PetriNetUnfolderBase]: 149/282 cut-off events. [2024-02-19 15:28:04,103 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2024-02-19 15:28:04,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 282 events. 149/282 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1037 event pairs, 4 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 2405. Up to 253 conditions per place. [2024-02-19 15:28:04,106 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 70 selfloop transitions, 19 changer transitions 39/129 dead transitions. [2024-02-19 15:28:04,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 129 transitions, 2571 flow [2024-02-19 15:28:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:28:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:28:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-02-19 15:28:04,107 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-02-19 15:28:04,107 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 35 predicate places. [2024-02-19 15:28:04,107 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 129 transitions, 2571 flow [2024-02-19 15:28:04,108 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:04,108 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:04,108 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:04,126 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-02-19 15:28:04,319 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:04,320 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:04,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash -103897647, now seen corresponding path program 1 times [2024-02-19 15:28:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021331632] [2024-02-19 15:28:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021331632] [2024-02-19 15:28:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021331632] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:04,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245185251] [2024-02-19 15:28:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:04,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:28:04,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-19 15:28:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:04,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2024-02-19 15:28:04,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:04,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:28:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:04,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:05,175 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 140 treesize of output 124 [2024-02-19 15:28:05,278 INFO L349 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2024-02-19 15:28:05,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 439 treesize of output 326 [2024-02-19 15:28:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245185251] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:13,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:13,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-02-19 15:28:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103646263] [2024-02-19 15:28:13,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:13,890 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-19 15:28:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-19 15:28:13,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-02-19 15:28:13,891 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:28:13,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 129 transitions, 2571 flow. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:13,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:13,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:28:13,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:14,136 INFO L124 PetriNetUnfolderBase]: 351/661 cut-off events. [2024-02-19 15:28:14,136 INFO L125 PetriNetUnfolderBase]: For 1001/1001 co-relation queries the response was YES. [2024-02-19 15:28:14,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7101 conditions, 661 events. 351/661 cut-off events. For 1001/1001 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3009 event pairs, 16 based on Foata normal form. 2/537 useless extension candidates. Maximal degree in co-relation 3666. Up to 602 conditions per place. [2024-02-19 15:28:14,142 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 90 selfloop transitions, 24 changer transitions 157/279 dead transitions. [2024-02-19 15:28:14,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 279 transitions, 6190 flow [2024-02-19 15:28:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:28:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:28:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-02-19 15:28:14,143 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6017316017316018 [2024-02-19 15:28:14,144 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 45 predicate places. [2024-02-19 15:28:14,144 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 279 transitions, 6190 flow [2024-02-19 15:28:14,144 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:14,144 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:14,144 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:14,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-19 15:28:14,352 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:14,353 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:14,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 602503450, now seen corresponding path program 2 times [2024-02-19 15:28:14,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471460319] [2024-02-19 15:28:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471460319] [2024-02-19 15:28:15,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471460319] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18922997] [2024-02-19 15:28:15,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:28:15,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:15,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:15,040 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:28:15,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-19 15:28:15,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:28:15,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:15,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjunts are in the unsatisfiable core [2024-02-19 15:28:15,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:15,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:28:15,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:28:15,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:28:15,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 26 [2024-02-19 15:28:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:15,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:15,577 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 204 treesize of output 188 [2024-02-19 15:28:15,756 INFO L349 Elim1Store]: treesize reduction 5, result has 96.7 percent of original size [2024-02-19 15:28:15,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 13024 treesize of output 10451 [2024-02-19 15:28:32,789 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:37,891 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:28:54,644 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:13,795 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:29:43,208 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:21,775 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:24,878 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:30:33,860 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:42,872 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:01,892 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:31:13,870 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:31:33,340 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-02-19 15:31:47,155 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:01,465 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:03,775 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:10,461 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-02-19 15:32:17,331 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:32:29,995 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-02-19 15:32:33,991 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-02-19 15:32:33,995 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:32:34,008 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-02-19 15:32:34,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-19 15:32:34,211 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:32:34,212 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:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:527) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) 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-02-19 15:32:34,227 INFO L158 Benchmark]: Toolchain (without parser) took 274995.77ms. Allocated memory was 62.9MB in the beginning and 1.9GB in the end (delta: 1.9GB). Free memory was 34.2MB in the beginning and 890.9MB in the end (delta: -856.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-02-19 15:32:34,227 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:32:34,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.98ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 33.9MB in the beginning and 67.1MB in the end (delta: -33.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-02-19 15:32:34,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.14ms. Allocated memory is still 92.3MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:32:34,229 INFO L158 Benchmark]: Boogie Preprocessor took 65.61ms. Allocated memory is still 92.3MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:32:34,229 INFO L158 Benchmark]: RCFGBuilder took 653.78ms. Allocated memory is still 92.3MB. Free memory was 62.7MB in the beginning and 45.8MB in the end (delta: 16.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-02-19 15:32:34,229 INFO L158 Benchmark]: TraceAbstraction took 273968.18ms. Allocated memory was 92.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 45.1MB in the beginning and 890.9MB in the end (delta: -845.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-02-19 15:32:34,232 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory is still 42.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.98ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 33.9MB in the beginning and 67.1MB in the end (delta: -33.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.14ms. Allocated memory is still 92.3MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.61ms. Allocated memory is still 92.3MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 653.78ms. Allocated memory is still 92.3MB. Free memory was 62.7MB in the beginning and 45.8MB in the end (delta: 16.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 273968.18ms. Allocated memory was 92.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 45.1MB in the beginning and 890.9MB in the end (delta: -845.8MB). Peak memory consumption was 1.2GB. 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-2.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 5393d9cf3b7cc0865f031a716dd61208c034931418b29464b30da9c6eaf669bf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:32:36,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:32:36,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:32:36,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:32:36,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:32:36,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:32:36,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:32:36,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:32:36,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:32:36,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:32:36,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:32:36,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:32:36,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:32:36,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:32:36,292 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:32:36,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:32:36,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:32:36,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:32:36,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:32:36,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:32:36,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:32:36,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:32:36,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:32:36,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:32:36,295 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:32:36,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:32:36,295 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:32:36,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:32:36,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:32:36,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:32:36,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:32:36,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:32:36,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:32:36,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:32:36,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:32:36,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:32:36,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:32:36,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:32:36,299 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:32:36,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:32:36,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:32:36,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:32:36,300 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:32:36,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:32:36,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:32:36,300 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:32:36,300 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 -> 5393d9cf3b7cc0865f031a716dd61208c034931418b29464b30da9c6eaf669bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:32:36,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:32:36,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:32:36,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:32:36,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:32:36,585 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:32:36,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-02-19 15:32:37,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:32:37,861 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:32:37,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-02-19 15:32:37,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b857085a6/f8d8b7b9b9a342ee8d70bfacedf40b5a/FLAG5ed62b25b [2024-02-19 15:32:37,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b857085a6/f8d8b7b9b9a342ee8d70bfacedf40b5a [2024-02-19 15:32:37,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:32:37,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:32:37,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:32:37,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:32:37,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:32:37,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:32:37" (1/1) ... [2024-02-19 15:32:37,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643697d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:37, skipping insertion in model container [2024-02-19 15:32:37,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:32:37" (1/1) ... [2024-02-19 15:32:37,909 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:32:38,055 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2024-02-19 15:32:38,064 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:32:38,078 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:32:38,084 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:32:38,103 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2024-02-19 15:32:38,107 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:32:38,110 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:32:38,137 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2024-02-19 15:32:38,141 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:32:38,157 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:32:38,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38 WrapperNode [2024-02-19 15:32:38,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:32:38,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:32:38,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:32:38,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:32:38,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,205 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 135 [2024-02-19 15:32:38,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:32:38,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:32:38,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:32:38,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:32:38,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,244 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 2, 2, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-19 15:32:38,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:32:38,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:32:38,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:32:38,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:32:38,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (1/1) ... [2024-02-19 15:32:38,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:32:38,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:32:38,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:32:38,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:32:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:32:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:32:38,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:32:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:32:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:32:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:32:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:32:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:32:38,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:32:38,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:32:38,349 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:32:38,349 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:32:38,349 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:32:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:32:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:32:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:32:38,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:32:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:32:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:32:38,354 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:32:38,464 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:32:38,465 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:32:38,725 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:32:38,726 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:32:38,935 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:32:38,936 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-19 15:32:38,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:32:38 BoogieIcfgContainer [2024-02-19 15:32:38,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:32:38,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:32:38,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:32:38,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:32:38,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:32:37" (1/3) ... [2024-02-19 15:32:38,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253d09f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:32:38, skipping insertion in model container [2024-02-19 15:32:38,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:38" (2/3) ... [2024-02-19 15:32:38,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253d09f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:32:38, skipping insertion in model container [2024-02-19 15:32:38,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:32:38" (3/3) ... [2024-02-19 15:32:38,942 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2024-02-19 15:32:38,955 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:32:38,955 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:32:38,955 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:32:39,003 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:32:39,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:32:39,059 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-02-19 15:32:39,059 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:32:39,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-02-19 15:32:39,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:32:39,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-02-19 15:32:39,080 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:32:39,089 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3088ae12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:32:39,090 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:32:39,101 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:32:39,101 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-02-19 15:32:39,101 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:32:39,101 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:39,102 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:39,102 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:39,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1512436290, now seen corresponding path program 1 times [2024-02-19 15:32:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:39,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797404753] [2024-02-19 15:32:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:39,125 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-02-19 15:32:39,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:39,128 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-02-19 15:32:39,131 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-02-19 15:32:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:39,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:32:39,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:32:39,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:39,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797404753] [2024-02-19 15:32:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797404753] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:32:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650108404] [2024-02-19 15:32:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:39,302 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:32:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:32:39,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:32:39,331 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:32:39,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-02-19 15:32:39,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:39,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:32:39,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:39,413 INFO L124 PetriNetUnfolderBase]: 66/117 cut-off events. [2024-02-19 15:32:39,413 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-19 15:32:39,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 117 events. 66/117 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 323 event pairs, 9 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2024-02-19 15:32:39,416 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-02-19 15:32:39,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2024-02-19 15:32:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:32:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:32:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-02-19 15:32:39,424 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-02-19 15:32:39,426 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-02-19 15:32:39,427 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 28 transitions, 127 flow [2024-02-19 15:32:39,427 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-02-19 15:32:39,427 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:39,427 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:39,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:32:39,630 WARN L489 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-02-19 15:32:39,630 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:39,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1356106823, now seen corresponding path program 1 times [2024-02-19 15:32:39,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:39,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772410654] [2024-02-19 15:32:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:39,631 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-02-19 15:32:39,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:39,632 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-02-19 15:32:39,649 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-02-19 15:32:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:39,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:32:39,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:39,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:39,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772410654] [2024-02-19 15:32:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772410654] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:39,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:39,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:32:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860168934] [2024-02-19 15:32:39,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:39,738 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:32:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:32:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:32:39,739 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:32:39,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 28 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:39,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:39,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:32:39,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:39,831 INFO L124 PetriNetUnfolderBase]: 66/118 cut-off events. [2024-02-19 15:32:39,832 INFO L125 PetriNetUnfolderBase]: For 16/20 co-relation queries the response was YES. [2024-02-19 15:32:39,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 118 events. 66/118 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 9 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2024-02-19 15:32:39,834 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2024-02-19 15:32:39,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 183 flow [2024-02-19 15:32:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:32:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:32:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2024-02-19 15:32:39,838 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-19 15:32:39,839 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2024-02-19 15:32:39,839 INFO L507 AbstractCegarLoop]: Abstraction has has 26 places, 29 transitions, 183 flow [2024-02-19 15:32:39,839 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:39,840 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:39,840 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:39,843 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 (3)] Ended with exit code 0 [2024-02-19 15:32:40,042 WARN L489 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-02-19 15:32:40,043 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:40,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2010694938, now seen corresponding path program 1 times [2024-02-19 15:32:40,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069034324] [2024-02-19 15:32:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:40,046 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-02-19 15:32:40,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:40,047 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-02-19 15:32:40,067 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-02-19 15:32:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:40,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:32:40,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:40,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:40,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:40,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069034324] [2024-02-19 15:32:40,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069034324] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:40,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:40,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:32:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853732303] [2024-02-19 15:32:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:40,158 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:32:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:32:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:32:40,158 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:40,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 29 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:40,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:40,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:40,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:40,268 INFO L124 PetriNetUnfolderBase]: 80/151 cut-off events. [2024-02-19 15:32:40,268 INFO L125 PetriNetUnfolderBase]: For 87/91 co-relation queries the response was YES. [2024-02-19 15:32:40,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 151 events. 80/151 cut-off events. For 87/91 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 479 event pairs, 3 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 417. Up to 136 conditions per place. [2024-02-19 15:32:40,270 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 39 selfloop transitions, 4 changer transitions 6/51 dead transitions. [2024-02-19 15:32:40,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 51 transitions, 428 flow [2024-02-19 15:32:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:32:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:32:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-02-19 15:32:40,271 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-02-19 15:32:40,271 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2024-02-19 15:32:40,271 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 51 transitions, 428 flow [2024-02-19 15:32:40,271 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:40,271 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:40,271 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:40,276 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-02-19 15:32:40,474 WARN L489 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-02-19 15:32:40,474 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:40,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash -630810740, now seen corresponding path program 2 times [2024-02-19 15:32:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:40,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259482693] [2024-02-19 15:32:40,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:32:40,475 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-02-19 15:32:40,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:40,479 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-02-19 15:32:40,482 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-02-19 15:32:40,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:32:40,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:32:40,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:32:40,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:40,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:32:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:40,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:40,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259482693] [2024-02-19 15:32:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259482693] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:32:40,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:32:40,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-02-19 15:32:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878728267] [2024-02-19 15:32:40,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:32:40,651 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:32:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:40,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:32:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:32:40,655 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:40,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 51 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:40,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:40,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:40,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:41,026 INFO L124 PetriNetUnfolderBase]: 188/359 cut-off events. [2024-02-19 15:32:41,027 INFO L125 PetriNetUnfolderBase]: For 363/365 co-relation queries the response was YES. [2024-02-19 15:32:41,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 359 events. 188/359 cut-off events. For 363/365 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1427 event pairs, 4 based on Foata normal form. 6/278 useless extension candidates. Maximal degree in co-relation 1422. Up to 321 conditions per place. [2024-02-19 15:32:41,030 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 94 selfloop transitions, 13 changer transitions 12/121 dead transitions. [2024-02-19 15:32:41,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 121 transitions, 1265 flow [2024-02-19 15:32:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:32:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:32:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-02-19 15:32:41,032 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2024-02-19 15:32:41,032 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2024-02-19 15:32:41,032 INFO L507 AbstractCegarLoop]: Abstraction has has 35 places, 121 transitions, 1265 flow [2024-02-19 15:32:41,032 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:41,033 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:41,033 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:41,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-02-19 15:32:41,236 WARN L489 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-02-19 15:32:41,236 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:41,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash -718911833, now seen corresponding path program 1 times [2024-02-19 15:32:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:41,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040046128] [2024-02-19 15:32:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:41,237 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-02-19 15:32:41,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:41,238 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-02-19 15:32:41,239 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-02-19 15:32:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:41,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:32:41,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:41,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:41,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040046128] [2024-02-19 15:32:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040046128] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:32:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686355308] [2024-02-19 15:32:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:41,351 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:32:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:32:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:32:41,352 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:41,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 121 transitions, 1265 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:41,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:41,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:41,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:41,499 INFO L124 PetriNetUnfolderBase]: 174/334 cut-off events. [2024-02-19 15:32:41,500 INFO L125 PetriNetUnfolderBase]: For 540/548 co-relation queries the response was YES. [2024-02-19 15:32:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 334 events. 174/334 cut-off events. For 540/548 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1291 event pairs, 4 based on Foata normal form. 8/267 useless extension candidates. Maximal degree in co-relation 1565. Up to 297 conditions per place. [2024-02-19 15:32:41,503 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 93 selfloop transitions, 6 changer transitions 24/125 dead transitions. [2024-02-19 15:32:41,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 125 transitions, 1548 flow [2024-02-19 15:32:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:32:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:32:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:32:41,507 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:32:41,508 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 16 predicate places. [2024-02-19 15:32:41,508 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 125 transitions, 1548 flow [2024-02-19 15:32:41,509 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:41,509 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:41,509 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:41,526 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-02-19 15:32:41,712 WARN L489 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-02-19 15:32:41,713 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:41,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1378417623, now seen corresponding path program 2 times [2024-02-19 15:32:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:41,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327345956] [2024-02-19 15:32:41,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:32:41,715 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-02-19 15:32:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:41,716 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-02-19 15:32:41,768 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-02-19 15:32:41,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:32:41,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:32:41,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:32:41,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:41,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:32:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:41,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327345956] [2024-02-19 15:32:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327345956] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:32:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:32:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-02-19 15:32:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840973765] [2024-02-19 15:32:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:41,910 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:32:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:32:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:32:41,911 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:41,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 125 transitions, 1548 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:41,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:41,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:42,074 INFO L124 PetriNetUnfolderBase]: 174/327 cut-off events. [2024-02-19 15:32:42,074 INFO L125 PetriNetUnfolderBase]: For 764/772 co-relation queries the response was YES. [2024-02-19 15:32:42,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 327 events. 174/327 cut-off events. For 764/772 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1243 event pairs, 4 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 1790. Up to 291 conditions per place. [2024-02-19 15:32:42,076 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 90 selfloop transitions, 7 changer transitions 24/123 dead transitions. [2024-02-19 15:32:42,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 123 transitions, 1754 flow [2024-02-19 15:32:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:32:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:32:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:32:42,078 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:32:42,080 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2024-02-19 15:32:42,080 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 123 transitions, 1754 flow [2024-02-19 15:32:42,081 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:42,081 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:42,081 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:42,088 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-02-19 15:32:42,288 WARN L489 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-02-19 15:32:42,289 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:42,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2006730403, now seen corresponding path program 3 times [2024-02-19 15:32:42,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712479778] [2024-02-19 15:32:42,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:32:42,291 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-02-19 15:32:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:42,293 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-02-19 15:32:42,294 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-02-19 15:32:42,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:32:42,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:32:42,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:32:42,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:42,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:32:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:32:42,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:42,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712479778] [2024-02-19 15:32:42,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712479778] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:32:42,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:32:42,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-02-19 15:32:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761523776] [2024-02-19 15:32:42,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:42,468 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:32:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:32:42,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:32:42,469 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:42,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 123 transitions, 1754 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:42,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:42,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:42,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:42,605 INFO L124 PetriNetUnfolderBase]: 196/365 cut-off events. [2024-02-19 15:32:42,606 INFO L125 PetriNetUnfolderBase]: For 829/837 co-relation queries the response was YES. [2024-02-19 15:32:42,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2792 conditions, 365 events. 196/365 cut-off events. For 829/837 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1397 event pairs, 4 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 2361. Up to 329 conditions per place. [2024-02-19 15:32:42,608 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 106 selfloop transitions, 9 changer transitions 24/142 dead transitions. [2024-02-19 15:32:42,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 142 transitions, 2294 flow [2024-02-19 15:32:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:32:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:32:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2024-02-19 15:32:42,609 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-19 15:32:42,610 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 22 predicate places. [2024-02-19 15:32:42,610 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 142 transitions, 2294 flow [2024-02-19 15:32:42,610 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:42,610 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:42,610 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:42,615 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-02-19 15:32:42,813 WARN L489 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-02-19 15:32:42,813 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:42,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1893669819, now seen corresponding path program 4 times [2024-02-19 15:32:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134028655] [2024-02-19 15:32:42,815 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:32:42,815 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-02-19 15:32:42,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:42,816 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-02-19 15:32:42,846 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-02-19 15:32:42,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:32:42,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:32:42,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:32:42,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:42,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:32:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:43,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134028655] [2024-02-19 15:32:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134028655] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:32:43,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:32:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-02-19 15:32:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372980539] [2024-02-19 15:32:43,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:32:43,106 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-19 15:32:43,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:43,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-19 15:32:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-02-19 15:32:43,111 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:32:43,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 142 transitions, 2294 flow. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:43,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:43,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:32:43,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:47,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:32:51,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:32:55,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:32:56,136 INFO L124 PetriNetUnfolderBase]: 321/592 cut-off events. [2024-02-19 15:32:56,137 INFO L125 PetriNetUnfolderBase]: For 976/976 co-relation queries the response was YES. [2024-02-19 15:32:56,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5167 conditions, 592 events. 321/592 cut-off events. For 976/976 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2529 event pairs, 12 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 4320. Up to 548 conditions per place. [2024-02-19 15:32:56,144 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 148 selfloop transitions, 71 changer transitions 36/256 dead transitions. [2024-02-19 15:32:56,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 256 transitions, 4636 flow [2024-02-19 15:32:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 15:32:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 15:32:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2024-02-19 15:32:56,160 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2024-02-19 15:32:56,161 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 34 predicate places. [2024-02-19 15:32:56,161 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 256 transitions, 4636 flow [2024-02-19 15:32:56,161 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:56,161 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:56,162 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:56,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-02-19 15:32:56,366 WARN L489 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-02-19 15:32:56,366 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:56,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1387323553, now seen corresponding path program 5 times [2024-02-19 15:32:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512218109] [2024-02-19 15:32:56,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:32:56,368 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-02-19 15:32:56,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:56,369 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-02-19 15:32:56,370 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-02-19 15:32:56,479 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:32:56,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:32:56,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:32:56,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:56,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:32:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:56,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512218109] [2024-02-19 15:32:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512218109] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:32:56,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:32:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-02-19 15:32:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457951496] [2024-02-19 15:32:56,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:32:56,773 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 15:32:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 15:32:56,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:32:56,782 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:32:56,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 256 transitions, 4636 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:56,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:56,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:32:56,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:01,234 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-02-19 15:33:05,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:33:05,551 INFO L124 PetriNetUnfolderBase]: 359/654 cut-off events. [2024-02-19 15:33:05,551 INFO L125 PetriNetUnfolderBase]: For 978/978 co-relation queries the response was YES. [2024-02-19 15:33:05,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6376 conditions, 654 events. 359/654 cut-off events. For 978/978 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2827 event pairs, 12 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 5437. Up to 610 conditions per place. [2024-02-19 15:33:05,557 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 184 selfloop transitions, 59 changer transitions 32/276 dead transitions. [2024-02-19 15:33:05,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 276 transitions, 5546 flow [2024-02-19 15:33:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 15:33:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 15:33:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2024-02-19 15:33:05,558 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-02-19 15:33:05,559 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 45 predicate places. [2024-02-19 15:33:05,559 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 276 transitions, 5546 flow [2024-02-19 15:33:05,559 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:33:05,559 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:05,559 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:05,565 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-02-19 15:33:05,762 WARN L489 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-02-19 15:33:05,762 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:33:05,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1616812131, now seen corresponding path program 1 times [2024-02-19 15:33:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:05,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60984253] [2024-02-19 15:33:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:33:05,764 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-02-19 15:33:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:05,767 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-02-19 15:33:05,773 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-02-19 15:33:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:33:05,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:33:05,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:06,175 INFO L349 Elim1Store]: treesize reduction 162, result has 19.4 percent of original size [2024-02-19 15:33:06,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 313 treesize of output 112 [2024-02-19 15:33:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:33:08,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:19,553 INFO L349 Elim1Store]: treesize reduction 1042, result has 17.1 percent of original size [2024-02-19 15:33:19,553 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 24 new quantified variables, introduced 120 case distinctions, treesize of input 413 treesize of output 348 [2024-02-19 15:34:29,384 WARN L293 SmtUtils]: Spent 25.98s on a formula simplification that was a NOOP. DAG size: 2883 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:38:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:38:36,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:38:36,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60984253] [2024-02-19 15:38:36,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60984253] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:38:36,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:38:36,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-02-19 15:38:36,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223507096] [2024-02-19 15:38:36,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:38:36,015 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 15:38:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:38:36,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 15:38:36,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=64, Unknown=2, NotChecked=0, Total=90 [2024-02-19 15:38:36,016 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:38:36,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 276 transitions, 5546 flow. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:38:36,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:38:36,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:38:36,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:38:48,741 INFO L124 PetriNetUnfolderBase]: 429/780 cut-off events. [2024-02-19 15:38:48,741 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2024-02-19 15:38:48,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8385 conditions, 780 events. 429/780 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3488 event pairs, 8 based on Foata normal form. 4/619 useless extension candidates. Maximal degree in co-relation 7310. Up to 736 conditions per place. [2024-02-19 15:38:48,748 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 222 selfloop transitions, 55 changer transitions 36/321 dead transitions. [2024-02-19 15:38:48,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 321 transitions, 7099 flow [2024-02-19 15:38:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:38:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:38:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-02-19 15:38:48,775 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-02-19 15:38:48,775 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 52 predicate places. [2024-02-19 15:38:48,776 INFO L507 AbstractCegarLoop]: Abstraction has has 74 places, 321 transitions, 7099 flow [2024-02-19 15:38:48,776 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:38:48,776 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:38:48,776 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:38:48,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-02-19 15:38:48,977 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:38:48,977 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:38:48,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:38:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1792429781, now seen corresponding path program 2 times [2024-02-19 15:38:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:38:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941400840] [2024-02-19 15:38:48,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:38:48,978 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-02-19 15:38:48,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:38:48,979 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:38:48,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-02-19 15:38:49,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:38:49,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:38:49,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:38:49,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:38:50,055 INFO L349 Elim1Store]: treesize reduction 162, result has 19.4 percent of original size [2024-02-19 15:38:50,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 313 treesize of output 112 [2024-02-19 15:38:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:38:51,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:39:03,299 INFO L349 Elim1Store]: treesize reduction 1042, result has 17.1 percent of original size [2024-02-19 15:39:03,299 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 24 new quantified variables, introduced 120 case distinctions, treesize of input 413 treesize of output 348 [2024-02-19 15:40:32,087 WARN L293 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 3762 DAG size of output: 3903 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-19 15:41:58,551 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 6856 DAG size of output: 6856 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15