./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-4.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-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7071c3ff0bb3d9f81f254bc51d27ce3551a85cc081b1b878560a7d4c8f67639e --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:28:52,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:28:52,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:28:52,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:28:52,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:28:52,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:28:52,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:28:52,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:28:52,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:28:52,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:28:52,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:28:52,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:28:52,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:28:52,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:28:52,498 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:28:52,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:28:52,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:28:52,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:28:52,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:28:52,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:28:52,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:28:52,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:28:52,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:28:52,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:28:52,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:28:52,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:28:52,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:28:52,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:28:52,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:28:52,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:28:52,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:28:52,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:28:52,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:28:52,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:28:52,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:28:52,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:28:52,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:28:52,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:28:52,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:28:52,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:28:52,507 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:28:52,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:28:52,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:28:52,508 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 -> 7071c3ff0bb3d9f81f254bc51d27ce3551a85cc081b1b878560a7d4c8f67639e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:28:52,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:28:52,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:28:52,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:28:52,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:28:52,837 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:28:52,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-02-19 15:28:53,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:28:54,148 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:28:54,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-02-19 15:28:54,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9c8595d/afccfb7c75494bd49d8d0a3e914663ae/FLAG6873718fd [2024-02-19 15:28:54,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c9c8595d/afccfb7c75494bd49d8d0a3e914663ae [2024-02-19 15:28:54,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:28:54,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:28:54,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:28:54,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:28:54,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:28:54,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154f6508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54, skipping insertion in model container [2024-02-19 15:28:54,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:28:54,397 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-4.wvr.c[2572,2585] [2024-02-19 15:28:54,412 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:28:54,421 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:28:54,455 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-4.wvr.c[2572,2585] [2024-02-19 15:28:54,462 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:28:54,479 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:28:54,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54 WrapperNode [2024-02-19 15:28:54,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:28:54,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:28:54,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:28:54,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:28:54,487 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:28:54" (1/1) ... [2024-02-19 15:28:54,511 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:28:54" (1/1) ... [2024-02-19 15:28:54,539 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 157 [2024-02-19 15:28:54,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:28:54,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:28:54,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:28:54,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:28:54,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,588 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 2, 6]. 50 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:28:54,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:28:54,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:28:54,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:28:54,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:28:54,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (1/1) ... [2024-02-19 15:28:54,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:28:54,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:54,653 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:28:54,677 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:28:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:28:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:28:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:28:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:28:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:28:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:28:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:28:54,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:28:54,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:28:54,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:28:54,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:28:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:28:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:28:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:28:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:28:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:28:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:28:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:28:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:28:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:28:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:28:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:28:54,717 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:28:54,844 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:28:54,846 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:28:55,114 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:28:55,114 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:28:55,465 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:28:55,466 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-19 15:28:55,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:28:55 BoogieIcfgContainer [2024-02-19 15:28:55,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:28:55,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:28:55,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:28:55,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:28:55,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:28:54" (1/3) ... [2024-02-19 15:28:55,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5184f507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:28:55, skipping insertion in model container [2024-02-19 15:28:55,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:54" (2/3) ... [2024-02-19 15:28:55,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5184f507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:28:55, skipping insertion in model container [2024-02-19 15:28:55,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:28:55" (3/3) ... [2024-02-19 15:28:55,476 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2024-02-19 15:28:55,493 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:28:55,494 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:28:55,494 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:28:55,527 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:28:55,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:28:55,594 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-02-19 15:28:55,595 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:28:55,597 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:55,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:28:55,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-02-19 15:28:55,608 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:28:55,617 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;@7c30c6f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:28:55,618 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:28:55,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:28:55,632 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-02-19 15:28:55,632 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:28:55,633 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:55,633 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:55,634 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:55,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1180723743, now seen corresponding path program 1 times [2024-02-19 15:28:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:55,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34524365] [2024-02-19 15:28:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:56,009 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:56,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:56,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34524365] [2024-02-19 15:28:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34524365] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:56,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:56,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:28:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555818641] [2024-02-19 15:28:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:56,020 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:28:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:56,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:28:56,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:28:56,087 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:28:56,089 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:56,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:56,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:28:56,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:56,217 INFO L124 PetriNetUnfolderBase]: 66/117 cut-off events. [2024-02-19 15:28:56,217 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-19 15:28:56,219 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 320 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2024-02-19 15:28:56,223 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-02-19 15:28:56,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2024-02-19 15:28:56,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:28:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:28:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-02-19 15:28:56,235 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-02-19 15:28:56,240 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-02-19 15:28:56,240 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 28 transitions, 127 flow [2024-02-19 15:28:56,240 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:56,240 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:56,241 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:56,241 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:28:56,241 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:56,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1056646008, now seen corresponding path program 1 times [2024-02-19 15:28:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597844547] [2024-02-19 15:28:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:56,460 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:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597844547] [2024-02-19 15:28:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597844547] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:56,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:28:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218564809] [2024-02-19 15:28:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:56,463 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:28:56,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:56,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:28:56,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:28:56,465 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:28:56,466 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:56,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:56,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:28:56,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:56,567 INFO L124 PetriNetUnfolderBase]: 66/118 cut-off events. [2024-02-19 15:28:56,567 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-02-19 15:28:56,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 118 events. 66/118 cut-off events. For 15/17 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/78 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2024-02-19 15:28:56,570 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2024-02-19 15:28:56,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 183 flow [2024-02-19 15:28:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:28:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:28:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2024-02-19 15:28:56,590 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-19 15:28:56,591 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2024-02-19 15:28:56,591 INFO L507 AbstractCegarLoop]: Abstraction has has 26 places, 29 transitions, 183 flow [2024-02-19 15:28:56,592 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:56,593 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:56,593 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:56,593 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:28:56,594 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:56,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash -436405651, now seen corresponding path program 1 times [2024-02-19 15:28:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897887816] [2024-02-19 15:28:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:56,801 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:56,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:56,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897887816] [2024-02-19 15:28:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897887816] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:56,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:56,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:28:56,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913462846] [2024-02-19 15:28:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:56,803 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:28:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:28:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:28:56,807 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:56,807 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:56,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:56,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:56,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:56,953 INFO L124 PetriNetUnfolderBase]: 93/184 cut-off events. [2024-02-19 15:28:56,954 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-02-19 15:28:56,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 184 events. 93/184 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 613 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:56,956 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 37 selfloop transitions, 7 changer transitions 17/62 dead transitions. [2024-02-19 15:28:56,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 62 transitions, 513 flow [2024-02-19 15:28:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:28:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:28:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-02-19 15:28:56,958 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-02-19 15:28:56,959 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2024-02-19 15:28:56,959 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 62 transitions, 513 flow [2024-02-19 15:28:56,960 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:56,960 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:56,960 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:56,960 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:28:56,960 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:56,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1192301795, now seen corresponding path program 2 times [2024-02-19 15:28:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:56,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954452419] [2024-02-19 15:28:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:57,091 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:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954452419] [2024-02-19 15:28:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954452419] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:28:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492656293] [2024-02-19 15:28:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:57,097 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:28:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:28:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:28:57,101 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:57,101 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:57,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:57,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:57,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:57,239 INFO L124 PetriNetUnfolderBase]: 105/218 cut-off events. [2024-02-19 15:28:57,239 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-02-19 15:28:57,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 218 events. 105/218 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 782 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:57,243 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 52 selfloop transitions, 7 changer transitions 39/99 dead transitions. [2024-02-19 15:28:57,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 99 transitions, 1021 flow [2024-02-19 15:28:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:28:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:28:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-02-19 15:28:57,245 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-02-19 15:28:57,249 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2024-02-19 15:28:57,250 INFO L507 AbstractCegarLoop]: Abstraction has has 35 places, 99 transitions, 1021 flow [2024-02-19 15:28:57,250 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:57,250 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:57,250 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:57,250 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:28:57,251 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:57,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash 539722377, now seen corresponding path program 3 times [2024-02-19 15:28:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107770784] [2024-02-19 15:28:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:57,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:57,410 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:57,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107770784] [2024-02-19 15:28:57,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107770784] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058116689] [2024-02-19 15:28:57,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:28:57,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:57,414 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:57,416 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:57,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:28:57,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:57,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:57,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:57,576 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:57,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:57,629 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:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058116689] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:57,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:28:57,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-02-19 15:28:57,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765223274] [2024-02-19 15:28:57,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:57,632 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:28:57,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:28:57,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:28:57,634 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:28:57,635 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:57,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:57,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:28:57,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:57,735 INFO L124 PetriNetUnfolderBase]: 113/232 cut-off events. [2024-02-19 15:28:57,735 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2024-02-19 15:28:57,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 232 events. 113/232 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 838 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:57,738 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 56 selfloop transitions, 8 changer transitions 39/106 dead transitions. [2024-02-19 15:28:57,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 106 transitions, 1294 flow [2024-02-19 15:28:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:28:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:28:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2024-02-19 15:28:57,741 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-19 15:28:57,743 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 16 predicate places. [2024-02-19 15:28:57,743 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 106 transitions, 1294 flow [2024-02-19 15:28:57,743 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:57,743 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:57,743 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:57,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 15:28:57,943 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:57,944 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:57,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 308052903, now seen corresponding path program 1 times [2024-02-19 15:28:57,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:57,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534713685] [2024-02-19 15:28:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:58,138 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:58,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:58,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534713685] [2024-02-19 15:28:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534713685] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561029346] [2024-02-19 15:28:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:58,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:58,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:58,144 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:58,147 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:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:58,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:58,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:58,262 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:58,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:58,296 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:58,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561029346] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:58,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:28:58,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2024-02-19 15:28:58,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057023411] [2024-02-19 15:28:58,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:58,301 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:28:58,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:58,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:28:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 15:28:58,303 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:28:58,303 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:58,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:58,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:28:58,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:58,403 INFO L124 PetriNetUnfolderBase]: 119/242 cut-off events. [2024-02-19 15:28:58,404 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2024-02-19 15:28:58,405 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 892 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:58,406 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 60 selfloop transitions, 8 changer transitions 39/111 dead transitions. [2024-02-19 15:28:58,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 111 transitions, 1560 flow [2024-02-19 15:28:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:28:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:28:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:28:58,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:28:58,412 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2024-02-19 15:28:58,412 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 111 transitions, 1560 flow [2024-02-19 15:28:58,412 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:58,412 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:58,412 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:58,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 15:28:58,635 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:58,635 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:58,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1215392811, now seen corresponding path program 2 times [2024-02-19 15:28:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527478540] [2024-02-19 15:28:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:58,749 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:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527478540] [2024-02-19 15:28:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527478540] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746809376] [2024-02-19 15:28:58,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:28:58,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:58,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:58,752 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:58,755 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:58,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:28:58,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:58,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:58,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:58,877 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:58,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:58,940 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:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746809376] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:58,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-02-19 15:28:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620567229] [2024-02-19 15:28:58,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:58,942 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:28:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:58,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:28:58,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:28:58,945 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:58,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 111 transitions, 1560 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:58,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:58,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:58,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:59,092 INFO L124 PetriNetUnfolderBase]: 137/267 cut-off events. [2024-02-19 15:28:59,092 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2024-02-19 15:28:59,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2079 conditions, 267 events. 137/267 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 966 event pairs, 4 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 1766. Up to 237 conditions per place. [2024-02-19 15:28:59,096 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 65 selfloop transitions, 16 changer transitions 41/123 dead transitions. [2024-02-19 15:28:59,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 1963 flow [2024-02-19 15:28:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:28:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:28:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-02-19 15:28:59,097 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-02-19 15:28:59,098 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2024-02-19 15:28:59,098 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 123 transitions, 1963 flow [2024-02-19 15:28:59,098 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:59,098 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:59,098 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:59,119 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:59,319 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:59,320 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:59,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1023679032, now seen corresponding path program 4 times [2024-02-19 15:28:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51353537] [2024-02-19 15:28:59,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:59,415 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:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51353537] [2024-02-19 15:28:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51353537] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779342624] [2024-02-19 15:28:59,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:28:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:59,420 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:59,436 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:59,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:28:59,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:59,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:59,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:59,535 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:59,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:59,588 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:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779342624] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:59,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2024-02-19 15:28:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209638575] [2024-02-19 15:28:59,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:59,589 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 15:28:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 15:28:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 15:28:59,594 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:59,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 123 transitions, 1963 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:59,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:59,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:59,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:59,774 INFO L124 PetriNetUnfolderBase]: 156/300 cut-off events. [2024-02-19 15:28:59,775 INFO L125 PetriNetUnfolderBase]: For 301/301 co-relation queries the response was YES. [2024-02-19 15:28:59,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 300 events. 156/300 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1132 event pairs, 4 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 2294. Up to 270 conditions per place. [2024-02-19 15:28:59,778 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 74 selfloop transitions, 22 changer transitions 41/138 dead transitions. [2024-02-19 15:28:59,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 138 transitions, 2483 flow [2024-02-19 15:28:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:28:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:28:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-02-19 15:28:59,779 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-02-19 15:28:59,780 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 30 predicate places. [2024-02-19 15:28:59,780 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 138 transitions, 2483 flow [2024-02-19 15:28:59,780 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:59,780 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:59,781 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:59,804 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:59,995 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:59,996 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:59,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 517332766, now seen corresponding path program 5 times [2024-02-19 15:28:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223419998] [2024-02-19 15:28:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:29:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:29:00,087 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:29:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:29:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223419998] [2024-02-19 15:29:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223419998] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:29:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354694867] [2024-02-19 15:29:00,088 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:29:00,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:29:00,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:29:00,089 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:29:00,106 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:29:00,173 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:29:00,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:29:00,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:29:00,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:29:00,226 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:29:00,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:29:00,276 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:29:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354694867] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:29:00,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:29:00,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-02-19 15:29:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096111661] [2024-02-19 15:29:00,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:29:00,277 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:29:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:29:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:29:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:29:00,281 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:29:00,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 138 transitions, 2483 flow. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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:29:00,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:29:00,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:29:00,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:29:00,406 INFO L124 PetriNetUnfolderBase]: 149/282 cut-off events. [2024-02-19 15:29:00,406 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2024-02-19 15:29:00,407 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 1053 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:29:00,410 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 70 selfloop transitions, 19 changer transitions 39/129 dead transitions. [2024-02-19 15:29:00,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 129 transitions, 2571 flow [2024-02-19 15:29:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:29:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:29:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-02-19 15:29:00,411 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-19 15:29:00,412 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 34 predicate places. [2024-02-19 15:29:00,412 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 129 transitions, 2571 flow [2024-02-19 15:29:00,412 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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:29:00,413 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:29:00,413 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:29:00,431 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:29:00,627 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:29:00,628 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:29:00,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:29:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1830757515, now seen corresponding path program 1 times [2024-02-19 15:29:00,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:29:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374453501] [2024-02-19 15:29:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:29:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:29:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:29:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:29:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:29:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374453501] [2024-02-19 15:29:00,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374453501] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:29:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980252582] [2024-02-19 15:29:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:29:00,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:29:00,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:29:00,808 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:29:00,827 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:29:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:29:00,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2024-02-19 15:29:00,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:29:00,950 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:29:01,133 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:29:01,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:29:01,564 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 268 treesize of output 236 [2024-02-19 15:29:02,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:29:02,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 3557 treesize of output 2483 [2024-02-19 15:30:43,518 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:30:59,771 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:31:15,225 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:15,530 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:28,017 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:36,136 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:46,667 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:53,085 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:31:55,604 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:24,653 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:40,444 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:49,950 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:32:56,748 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-02-19 15:33:35,144 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 15:33:44,099 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:33:44,099 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:33:44,101 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:33:44,112 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:33:44,301 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:33:44,302 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:140) 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:33:44,308 INFO L158 Benchmark]: Toolchain (without parser) took 290139.64ms. Allocated memory was 62.9MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 38.9MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-02-19 15:33:44,309 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 39.1MB in the beginning and 39.1MB in the end (delta: 67.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:33:44,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.84ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 26.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-02-19 15:33:44,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.04ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 26.4MB in the beginning and 56.9MB in the end (delta: -30.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-02-19 15:33:44,310 INFO L158 Benchmark]: Boogie Preprocessor took 76.98ms. Allocated memory is still 77.6MB. Free memory was 56.9MB in the beginning and 54.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:33:44,311 INFO L158 Benchmark]: RCFGBuilder took 849.17ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 53.9MB in the end (delta: 564.8kB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-19 15:33:44,311 INFO L158 Benchmark]: TraceAbstraction took 288838.50ms. Allocated memory was 77.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 53.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-02-19 15:33:44,313 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.18ms. Allocated memory is still 62.9MB. Free memory was 39.1MB in the beginning and 39.1MB in the end (delta: 67.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.84ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 26.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.04ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 26.4MB in the beginning and 56.9MB in the end (delta: -30.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.98ms. Allocated memory is still 77.6MB. Free memory was 56.9MB in the beginning and 54.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 849.17ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 53.9MB in the end (delta: 564.8kB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 288838.50ms. Allocated memory was 77.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 53.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7071c3ff0bb3d9f81f254bc51d27ce3551a85cc081b1b878560a7d4c8f67639e --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:33:46,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:33:46,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:33:46,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:33:46,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:33:46,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:33:46,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:33:46,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:33:46,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:33:46,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:33:46,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:33:46,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:33:46,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:33:46,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:33:46,656 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:33:46,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:33:46,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:33:46,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:33:46,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:33:46,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:33:46,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:33:46,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:33:46,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:33:46,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:33:46,663 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:33:46,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:33:46,663 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:33:46,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:33:46,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:33:46,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:33:46,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:33:46,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:33:46,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:33:46,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:33:46,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:33:46,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:33:46,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:33:46,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:33:46,668 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:33:46,668 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:33:46,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:33:46,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:33:46,669 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:33:46,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:33:46,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:33:46,670 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:33:46,670 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 -> 7071c3ff0bb3d9f81f254bc51d27ce3551a85cc081b1b878560a7d4c8f67639e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:33:47,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:33:47,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:33:47,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:33:47,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:33:47,037 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:33:47,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-02-19 15:33:48,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:33:48,555 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:33:48,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2024-02-19 15:33:48,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966cf90da/8ba2f9f416e6433eb7785da2fe7706ec/FLAGa909b16f0 [2024-02-19 15:33:48,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966cf90da/8ba2f9f416e6433eb7785da2fe7706ec [2024-02-19 15:33:48,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:33:48,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:33:48,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:33:48,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:33:48,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:33:48,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:48,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fa1ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48, skipping insertion in model container [2024-02-19 15:33:48,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:48,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:33:48,810 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-4.wvr.c[2572,2585] [2024-02-19 15:33:48,832 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:33:48,859 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:33:48,863 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:33:48,887 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-4.wvr.c[2572,2585] [2024-02-19 15:33:48,897 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:33:48,904 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:33:48,937 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-4.wvr.c[2572,2585] [2024-02-19 15:33:48,944 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:33:48,963 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:33:48,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48 WrapperNode [2024-02-19 15:33:48,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:33:48,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:33:48,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:33:48,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:33:48,973 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:33:48" (1/1) ... [2024-02-19 15:33:48,992 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:33:48" (1/1) ... [2024-02-19 15:33:49,027 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 155 [2024-02-19 15:33:49,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:33:49,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:33:49,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:33:49,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:33:49,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,078 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 2, 6]. 50 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:33:49,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:33:49,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:33:49,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:33:49,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:33:49,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (1/1) ... [2024-02-19 15:33:49,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:33:49,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:33:49,149 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:33:49,166 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:33:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:33:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:33:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:33:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:33:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:33:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:33:49,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:33:49,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:33:49,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:33:49,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:33:49,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:33:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:33:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:33:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:33:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:33:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:33:49,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:33:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:33:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:33:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:33:49,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:33:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:33:49,197 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:33:49,303 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:33:49,305 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:33:49,551 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:33:49,551 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:33:49,861 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:33:49,862 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-19 15:33:49,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:33:49 BoogieIcfgContainer [2024-02-19 15:33:49,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:33:49,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:33:49,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:33:49,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:33:49,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:33:48" (1/3) ... [2024-02-19 15:33:49,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7622fffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:33:49, skipping insertion in model container [2024-02-19 15:33:49,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:33:48" (2/3) ... [2024-02-19 15:33:49,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7622fffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:33:49, skipping insertion in model container [2024-02-19 15:33:49,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:33:49" (3/3) ... [2024-02-19 15:33:49,880 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2024-02-19 15:33:49,896 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:33:49,897 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:33:49,897 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:33:49,938 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:33:49,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:33:50,001 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-02-19 15:33:50,001 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:33:50,004 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:33:50,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:33:50,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-02-19 15:33:50,028 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:33:50,036 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;@60c2e0ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:33:50,036 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:33:50,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:33:50,048 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-02-19 15:33:50,048 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:33:50,048 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:50,049 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:50,049 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:33:50,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 32672093, now seen corresponding path program 1 times [2024-02-19 15:33:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000625005] [2024-02-19 15:33:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:33:50,069 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:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:50,070 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:33:50,071 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:33:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:33:50,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:33:50,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:50,327 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:33:50,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:33:50,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:50,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000625005] [2024-02-19 15:33:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000625005] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:33:50,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:33:50,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:33:50,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315049737] [2024-02-19 15:33:50,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:50,339 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:33:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:33:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:33:50,371 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:33:50,373 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:33:50,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:50,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:33:50,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:50,505 INFO L124 PetriNetUnfolderBase]: 66/117 cut-off events. [2024-02-19 15:33:50,505 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-19 15:33:50,507 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 320 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2024-02-19 15:33:50,511 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-02-19 15:33:50,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2024-02-19 15:33:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:33:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:33:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-02-19 15:33:50,522 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-02-19 15:33:50,526 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-02-19 15:33:50,527 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 28 transitions, 127 flow [2024-02-19 15:33:50,527 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:33:50,527 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:50,528 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:33:50,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-02-19 15:33:50,731 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:33:50,731 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:33:50,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash 17211256, now seen corresponding path program 1 times [2024-02-19 15:33:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:50,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701964375] [2024-02-19 15:33:50,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:33:50,734 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:50,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:50,735 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:33:50,736 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:33:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:33:50,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:33:50,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:50,863 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:33:50,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:33:50,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701964375] [2024-02-19 15:33:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701964375] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:33:50,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:33:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:33:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159012335] [2024-02-19 15:33:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:50,866 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:33:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:50,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:33:50,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:33:50,868 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:33:50,868 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:33:50,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:50,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:33:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:50,981 INFO L124 PetriNetUnfolderBase]: 66/118 cut-off events. [2024-02-19 15:33:50,981 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-02-19 15:33:50,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 118 events. 66/118 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 313 event pairs, 9 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2024-02-19 15:33:50,983 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2024-02-19 15:33:50,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 183 flow [2024-02-19 15:33:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:33:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:33:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2024-02-19 15:33:50,987 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-19 15:33:50,988 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2024-02-19 15:33:50,988 INFO L507 AbstractCegarLoop]: Abstraction has has 26 places, 29 transitions, 183 flow [2024-02-19 15:33:50,989 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:33:50,989 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:50,992 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:33:50,996 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:33:51,196 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:33:51,197 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:33:51,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash -125500347, now seen corresponding path program 1 times [2024-02-19 15:33:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446127977] [2024-02-19 15:33:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:33:51,198 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:51,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:51,199 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:33:51,225 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:33:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:33:51,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:33:51,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:51,332 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:33:51,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:33:51,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446127977] [2024-02-19 15:33:51,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446127977] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:33:51,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:33:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:33:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121661183] [2024-02-19 15:33:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:51,334 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:33:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:51,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:33:51,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:33:51,335 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:51,336 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:33:51,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:51,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:51,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:51,484 INFO L124 PetriNetUnfolderBase]: 80/151 cut-off events. [2024-02-19 15:33:51,484 INFO L125 PetriNetUnfolderBase]: For 87/91 co-relation queries the response was YES. [2024-02-19 15:33:51,485 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 486 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:33:51,486 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 39 selfloop transitions, 4 changer transitions 6/51 dead transitions. [2024-02-19 15:33:51,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 51 transitions, 428 flow [2024-02-19 15:33:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:33:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:33:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-02-19 15:33:51,488 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-02-19 15:33:51,488 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2024-02-19 15:33:51,489 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 51 transitions, 428 flow [2024-02-19 15:33:51,489 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:33:51,489 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:51,489 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:33:51,499 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:33:51,692 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:33:51,693 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:33:51,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1617983867, now seen corresponding path program 2 times [2024-02-19 15:33:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857742056] [2024-02-19 15:33:51,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:33:51,694 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:51,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:51,695 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:33:51,697 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:33:51,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:33:51,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:51,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:33:51,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:51,819 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:33:51,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:51,871 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:33:51,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857742056] [2024-02-19 15:33:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857742056] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:33:51,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:33:51,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-02-19 15:33:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739605410] [2024-02-19 15:33:51,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:33:51,873 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:33:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:33:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:33:51,877 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:51,877 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:33:51,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:51,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:51,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:52,271 INFO L124 PetriNetUnfolderBase]: 161/304 cut-off events. [2024-02-19 15:33:52,271 INFO L125 PetriNetUnfolderBase]: For 315/317 co-relation queries the response was YES. [2024-02-19 15:33:52,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 304 events. 161/304 cut-off events. For 315/317 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1101 event pairs, 4 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 1204. Up to 272 conditions per place. [2024-02-19 15:33:52,277 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 79 selfloop transitions, 13 changer transitions 14/108 dead transitions. [2024-02-19 15:33:52,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 108 transitions, 1120 flow [2024-02-19 15:33:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:33:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:33:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-02-19 15:33:52,281 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5782312925170068 [2024-02-19 15:33:52,283 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 13 predicate places. [2024-02-19 15:33:52,283 INFO L507 AbstractCegarLoop]: Abstraction has has 35 places, 108 transitions, 1120 flow [2024-02-19 15:33:52,283 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:33:52,284 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:52,284 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:33:52,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-02-19 15:33:52,487 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:33:52,487 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:33:52,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash 870867505, now seen corresponding path program 1 times [2024-02-19 15:33:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587425970] [2024-02-19 15:33:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:33:52,488 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:52,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:52,489 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:33:52,491 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:33:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:33:52,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:33:52,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:52,623 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:33:52,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:33:52,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587425970] [2024-02-19 15:33:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587425970] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:33:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:33:52,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:33:52,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807317301] [2024-02-19 15:33:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:52,628 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:33:52,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:33:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:33:52,629 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:52,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 108 transitions, 1120 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:33:52,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:52,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:52,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:52,821 INFO L124 PetriNetUnfolderBase]: 147/279 cut-off events. [2024-02-19 15:33:52,821 INFO L125 PetriNetUnfolderBase]: For 454/462 co-relation queries the response was YES. [2024-02-19 15:33:52,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 279 events. 147/279 cut-off events. For 454/462 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 992 event pairs, 4 based on Foata normal form. 8/230 useless extension candidates. Maximal degree in co-relation 1306. Up to 248 conditions per place. [2024-02-19 15:33:52,824 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 78 selfloop transitions, 6 changer transitions 26/112 dead transitions. [2024-02-19 15:33:52,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 112 transitions, 1377 flow [2024-02-19 15:33:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:33:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:33:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:33:52,825 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:33:52,826 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 16 predicate places. [2024-02-19 15:33:52,826 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 112 transitions, 1377 flow [2024-02-19 15:33:52,826 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:33:52,827 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:52,827 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:33:52,837 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:33:53,030 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:33:53,030 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:33:53,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:53,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1849653341, now seen corresponding path program 2 times [2024-02-19 15:33:53,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216908497] [2024-02-19 15:33:53,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:33:53,032 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:53,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:53,033 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:33:53,034 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:33:53,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:33:53,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:53,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:33:53,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:53,212 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:33:53,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:53,244 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:33:53,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:53,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216908497] [2024-02-19 15:33:53,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216908497] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:33:53,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:33:53,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-02-19 15:33:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027313068] [2024-02-19 15:33:53,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:53,245 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:33:53,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:33:53,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:33:53,246 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:53,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 112 transitions, 1377 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:33:53,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:53,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:53,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:53,420 INFO L124 PetriNetUnfolderBase]: 147/272 cut-off events. [2024-02-19 15:33:53,420 INFO L125 PetriNetUnfolderBase]: For 657/665 co-relation queries the response was YES. [2024-02-19 15:33:53,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 272 events. 147/272 cut-off events. For 657/665 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 954 event pairs, 4 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 1526. Up to 242 conditions per place. [2024-02-19 15:33:53,423 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 75 selfloop transitions, 7 changer transitions 26/110 dead transitions. [2024-02-19 15:33:53,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 110 transitions, 1557 flow [2024-02-19 15:33:53,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:33:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:33:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:33:53,424 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:33:53,425 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2024-02-19 15:33:53,425 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 110 transitions, 1557 flow [2024-02-19 15:33:53,425 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:33:53,425 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:53,425 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:53,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-02-19 15:33:53,629 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:33:53,629 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:33:53,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -23620560, now seen corresponding path program 3 times [2024-02-19 15:33:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581073390] [2024-02-19 15:33:53,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:33:53,630 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:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:53,632 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:33:53,636 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:33:53,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:33:53,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:53,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:33:53,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:33:53,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:33:53,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581073390] [2024-02-19 15:33:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581073390] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:33:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:33:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:33:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739450434] [2024-02-19 15:33:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:53,783 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:33:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:33:53,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:33:53,786 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:53,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 110 transitions, 1557 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:33:53,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:53,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:53,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:53,981 INFO L124 PetriNetUnfolderBase]: 164/301 cut-off events. [2024-02-19 15:33:53,981 INFO L125 PetriNetUnfolderBase]: For 699/707 co-relation queries the response was YES. [2024-02-19 15:33:53,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2304 conditions, 301 events. 164/301 cut-off events. For 699/707 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1046 event pairs, 4 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 1946. Up to 271 conditions per place. [2024-02-19 15:33:53,984 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 88 selfloop transitions, 9 changer transitions 26/126 dead transitions. [2024-02-19 15:33:53,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 126 transitions, 2020 flow [2024-02-19 15:33:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:33:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:33:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2024-02-19 15:33:53,985 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-19 15:33:53,986 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 22 predicate places. [2024-02-19 15:33:53,986 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 126 transitions, 2020 flow [2024-02-19 15:33:53,986 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:33:53,986 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:53,987 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:53,995 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:33:54,190 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:33:54,190 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:33:54,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 292866264, now seen corresponding path program 4 times [2024-02-19 15:33:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:54,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169594486] [2024-02-19 15:33:54,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:33:54,192 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:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:54,193 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:33:54,194 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:33:54,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:33:54,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:54,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:33:54,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:33:54,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:33:54,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169594486] [2024-02-19 15:33:54,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169594486] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:33:54,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:33:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-02-19 15:33:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424044906] [2024-02-19 15:33:54,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:33:54,673 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:33:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:54,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:33:54,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:33:54,681 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:33:54,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 126 transitions, 2020 flow. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:33:54,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:54,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:33:54,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:59,452 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:34:03,616 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:34:07,640 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:34:08,407 INFO L124 PetriNetUnfolderBase]: 348/615 cut-off events. [2024-02-19 15:34:08,408 INFO L125 PetriNetUnfolderBase]: For 993/993 co-relation queries the response was YES. [2024-02-19 15:34:08,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5379 conditions, 615 events. 348/615 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2441 event pairs, 8 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 4592. Up to 573 conditions per place. [2024-02-19 15:34:08,414 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 135 selfloop transitions, 100 changer transitions 38/274 dead transitions. [2024-02-19 15:34:08,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 274 transitions, 4919 flow [2024-02-19 15:34:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-19 15:34:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-19 15:34:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 166 transitions. [2024-02-19 15:34:08,419 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4649859943977591 [2024-02-19 15:34:08,421 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 38 predicate places. [2024-02-19 15:34:08,422 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 274 transitions, 4919 flow [2024-02-19 15:34:08,422 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:34:08,422 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:34:08,422 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:34:08,433 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:34:08,633 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:34:08,633 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:34:08,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:34:08,634 INFO L85 PathProgramCache]: Analyzing trace with hash -974590914, now seen corresponding path program 5 times [2024-02-19 15:34:08,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:34:08,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005442914] [2024-02-19 15:34:08,635 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:34:08,635 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:34:08,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:34:08,637 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:34:08,639 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:34:08,749 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:34:08,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:34:08,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2024-02-19 15:34:08,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:34:09,800 INFO L349 Elim1Store]: treesize reduction 876, result has 4.1 percent of original size [2024-02-19 15:34:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 28 new quantified variables, introduced 120 case distinctions, treesize of input 2218 treesize of output 214 [2024-02-19 15:34:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:34:09,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:34:12,987 INFO L349 Elim1Store]: treesize reduction 891, result has 21.9 percent of original size [2024-02-19 15:34:12,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 28 new quantified variables, introduced 120 case distinctions, treesize of input 3997 treesize of output 476 [2024-02-19 15:37:35,125 WARN L293 SmtUtils]: Spent 13.77s on a formula simplification. DAG size of input: 4528 DAG size of output: 4529 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-19 15:40:50,224 WARN L293 SmtUtils]: Spent 32.76s on a formula simplification. DAG size of input: 7613 DAG size of output: 7614 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15