./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-3.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-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 199b95a7803e428766b942c5c5c486b02a8ea32baf687cdef6ce754bef283884 --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:02,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:28:02,725 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:02,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:28:02,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:28:02,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:28:02,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:28:02,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:28:02,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:28:02,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:28:02,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:28:02,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:28:02,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:28:02,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:28:02,783 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:28:02,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:28:02,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:28:02,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:28:02,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:28:02,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:28:02,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:28:02,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:28:02,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:28:02,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:28:02,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:28:02,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:28:02,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:28:02,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:28:02,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:28:02,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:28:02,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:28:02,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:28:02,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:28:02,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:28:02,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:28:02,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:28:02,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:28:02,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:28:02,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:28:02,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:28:02,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:28:02,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:28:02,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:28:02,793 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 -> 199b95a7803e428766b942c5c5c486b02a8ea32baf687cdef6ce754bef283884 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:03,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:28:03,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:28:03,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:28:03,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:28:03,195 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:28:03,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-02-19 15:28:04,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:28:04,676 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:28:04,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-02-19 15:28:04,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61fc5d5ab/1e8a4735a90f4edcb64c736eda5acdde/FLAG8d6e04519 [2024-02-19 15:28:04,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61fc5d5ab/1e8a4735a90f4edcb64c736eda5acdde [2024-02-19 15:28:04,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:28:04,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:28:04,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:28:04,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:28:04,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:28:04,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:28:04" (1/1) ... [2024-02-19 15:28:04,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8095b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:04, skipping insertion in model container [2024-02-19 15:28:04,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:28:04" (1/1) ... [2024-02-19 15:28:04,727 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:28:04,947 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-02-19 15:28:04,962 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:28:04,973 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:28:05,010 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-02-19 15:28:05,017 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:28:05,032 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:28:05,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:05 WrapperNode [2024-02-19 15:28:05,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:28:05,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:28:05,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:28:05,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:28:05,041 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:05" (1/1) ... [2024-02-19 15:28:05,057 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:05" (1/1) ... [2024-02-19 15:28:05,090 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 147 [2024-02-19 15:28:05,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:28:05,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:28:05,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:28:05,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:28:05,102 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:05" (1/1) ... [2024-02-19 15:28:05,103 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:05" (1/1) ... [2024-02-19 15:28:05,118 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:05" (1/1) ... [2024-02-19 15:28:05,141 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 2, 2, 5]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-19 15:28:05,143 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:05" (1/1) ... [2024-02-19 15:28:05,143 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:05" (1/1) ... [2024-02-19 15:28:05,155 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:05" (1/1) ... [2024-02-19 15:28:05,160 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:05" (1/1) ... [2024-02-19 15:28:05,165 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:05" (1/1) ... [2024-02-19 15:28:05,166 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:05" (1/1) ... [2024-02-19 15:28:05,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:28:05,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:28:05,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:28:05,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:28:05,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:05" (1/1) ... [2024-02-19 15:28:05,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:28:05,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:05,214 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:05,238 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:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:28:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:28:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:28:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:28:05,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:28:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:28:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:28:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:28:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:28:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:28:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:28:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:28:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:28:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:28:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:28:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:28:05,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:28:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:28:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:28:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:28:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:28:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:28:05,277 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:05,395 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:28:05,397 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:28:05,649 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:28:05,651 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:28:05,934 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:28:05,936 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-19 15:28:05,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:28:05 BoogieIcfgContainer [2024-02-19 15:28:05,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:28:05,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:28:05,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:28:05,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:28:05,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:28:04" (1/3) ... [2024-02-19 15:28:05,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e711145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:28:05, skipping insertion in model container [2024-02-19 15:28:05,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:28:05" (2/3) ... [2024-02-19 15:28:05,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e711145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:28:05, skipping insertion in model container [2024-02-19 15:28:05,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:28:05" (3/3) ... [2024-02-19 15:28:05,946 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-02-19 15:28:05,965 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:28:05,965 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:28:05,965 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:28:06,011 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:28:06,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:28:06,090 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-02-19 15:28:06,091 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:28:06,094 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:06,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:28:06,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-02-19 15:28:06,124 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:28:06,131 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;@1b21c08b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:28:06,132 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:28:06,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:28:06,144 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-02-19 15:28:06,144 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:28:06,145 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:06,145 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:06,146 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:06,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash -551342263, now seen corresponding path program 1 times [2024-02-19 15:28:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804201085] [2024-02-19 15:28:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:06,500 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:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804201085] [2024-02-19 15:28:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804201085] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:06,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:28:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177437947] [2024-02-19 15:28:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:06,514 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:28:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:28:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:28:06,554 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:28:06,556 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:06,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:06,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:28:06,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:06,704 INFO L124 PetriNetUnfolderBase]: 66/117 cut-off events. [2024-02-19 15:28:06,705 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-19 15:28:06,707 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 311 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:06,712 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-02-19 15:28:06,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2024-02-19 15:28:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:28:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:28:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-02-19 15:28:06,724 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-02-19 15:28:06,728 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-02-19 15:28:06,729 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 28 transitions, 127 flow [2024-02-19 15:28:06,729 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:06,729 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:06,730 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:06,730 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:28:06,730 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:06,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1002373346, now seen corresponding path program 1 times [2024-02-19 15:28:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245607103] [2024-02-19 15:28:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:06,943 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:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245607103] [2024-02-19 15:28:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245607103] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:28:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135492348] [2024-02-19 15:28:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:06,946 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:28:06,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:06,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:28:06,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:28:06,949 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:28:06,949 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:06,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:06,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:28:06,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:07,056 INFO L124 PetriNetUnfolderBase]: 66/118 cut-off events. [2024-02-19 15:28:07,057 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-02-19 15:28:07,057 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:28:07,059 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2024-02-19 15:28:07,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 183 flow [2024-02-19 15:28:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:28:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:28:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2024-02-19 15:28:07,062 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-19 15:28:07,062 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2024-02-19 15:28:07,063 INFO L507 AbstractCegarLoop]: Abstraction has has 26 places, 29 transitions, 183 flow [2024-02-19 15:28:07,064 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:07,064 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:07,065 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:07,065 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:28:07,065 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:07,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash 962202175, now seen corresponding path program 1 times [2024-02-19 15:28:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:07,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793241276] [2024-02-19 15:28:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:07,314 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:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:07,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793241276] [2024-02-19 15:28:07,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793241276] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:07,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:07,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:28:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66573911] [2024-02-19 15:28:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:07,318 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:28:07,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:07,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:28:07,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:28:07,328 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:07,329 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:07,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:07,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:07,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:07,491 INFO L124 PetriNetUnfolderBase]: 87/172 cut-off events. [2024-02-19 15:28:07,491 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-02-19 15:28:07,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 172 events. 87/172 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 530 event pairs, 10 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 466. Up to 144 conditions per place. [2024-02-19 15:28:07,494 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 41 selfloop transitions, 4 changer transitions 12/58 dead transitions. [2024-02-19 15:28:07,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 58 transitions, 484 flow [2024-02-19 15:28:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:28:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:28:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-02-19 15:28:07,498 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-02-19 15:28:07,499 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2024-02-19 15:28:07,499 INFO L507 AbstractCegarLoop]: Abstraction has has 30 places, 58 transitions, 484 flow [2024-02-19 15:28:07,504 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:07,504 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:07,504 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:07,505 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:28:07,505 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:07,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1352711543, now seen corresponding path program 2 times [2024-02-19 15:28:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:07,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590271796] [2024-02-19 15:28:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:07,673 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:07,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:07,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590271796] [2024-02-19 15:28:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590271796] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836307831] [2024-02-19 15:28:07,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:28:07,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:07,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:07,684 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:07,703 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:07,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:28:07,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:07,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:07,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:07,863 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:07,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:07,926 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:07,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836307831] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:07,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:28:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-02-19 15:28:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648197659] [2024-02-19 15:28:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:07,928 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:28:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:07,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:28:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-19 15:28:07,931 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:28:07,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 58 transitions, 484 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:07,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:07,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:28:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:08,027 INFO L124 PetriNetUnfolderBase]: 95/186 cut-off events. [2024-02-19 15:28:08,027 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-02-19 15:28:08,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 186 events. 95/186 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 584 event pairs, 10 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 629. Up to 158 conditions per place. [2024-02-19 15:28:08,033 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 45 selfloop transitions, 5 changer transitions 12/65 dead transitions. [2024-02-19 15:28:08,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 65 transitions, 661 flow [2024-02-19 15:28:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:28:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:28:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2024-02-19 15:28:08,037 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-19 15:28:08,039 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2024-02-19 15:28:08,039 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 65 transitions, 661 flow [2024-02-19 15:28:08,039 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:08,040 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:08,040 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:08,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:28:08,255 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:08,255 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:08,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2021726574, now seen corresponding path program 1 times [2024-02-19 15:28:08,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:08,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548275863] [2024-02-19 15:28:08,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:08,379 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:08,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548275863] [2024-02-19 15:28:08,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548275863] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:08,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:08,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:28:08,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650566185] [2024-02-19 15:28:08,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:08,382 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:28:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:28:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:28:08,384 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:08,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 65 transitions, 661 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:08,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:08,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:08,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:08,505 INFO L124 PetriNetUnfolderBase]: 105/220 cut-off events. [2024-02-19 15:28:08,505 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-02-19 15:28:08,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 220 events. 105/220 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 804 event pairs, 8 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 1054. Up to 191 conditions per place. [2024-02-19 15:28:08,508 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 57 selfloop transitions, 6 changer transitions 36/100 dead transitions. [2024-02-19 15:28:08,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 100 transitions, 1222 flow [2024-02-19 15:28:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:28:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:28:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-02-19 15:28:08,510 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-19 15:28:08,511 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2024-02-19 15:28:08,512 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 100 transitions, 1222 flow [2024-02-19 15:28:08,512 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:08,512 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:08,512 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:08,512 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 15:28:08,513 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:08,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1383661540, now seen corresponding path program 2 times [2024-02-19 15:28:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:08,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586828717] [2024-02-19 15:28:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:08,595 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:08,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:08,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586828717] [2024-02-19 15:28:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586828717] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:08,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:28:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105324213] [2024-02-19 15:28:08,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:08,596 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:28:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:08,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:28:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:28:08,597 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:28:08,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 100 transitions, 1222 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:08,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:08,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:28:08,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:08,682 INFO L124 PetriNetUnfolderBase]: 111/230 cut-off events. [2024-02-19 15:28:08,682 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2024-02-19 15:28:08,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 230 events. 111/230 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 840 event pairs, 8 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 1293. Up to 201 conditions per place. [2024-02-19 15:28:08,684 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 59 selfloop transitions, 6 changer transitions 36/105 dead transitions. [2024-02-19 15:28:08,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 105 transitions, 1476 flow [2024-02-19 15:28:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:28:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:28:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:28:08,686 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:28:08,686 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 18 predicate places. [2024-02-19 15:28:08,687 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 105 transitions, 1476 flow [2024-02-19 15:28:08,687 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:08,687 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:08,687 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:08,687 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 15:28:08,687 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:08,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash 315032839, now seen corresponding path program 3 times [2024-02-19 15:28:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384158143] [2024-02-19 15:28:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:08,800 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:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384158143] [2024-02-19 15:28:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384158143] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185840843] [2024-02-19 15:28:08,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:28:08,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:08,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:08,802 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:08,818 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:08,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:28:08,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:08,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:08,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:08,939 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:08,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:08,981 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:08,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185840843] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:08,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:08,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2024-02-19 15:28:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137895942] [2024-02-19 15:28:08,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:08,982 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 15:28:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:08,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 15:28:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-02-19 15:28:08,988 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:08,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 105 transitions, 1476 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:08,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:08,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:08,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:09,181 INFO L124 PetriNetUnfolderBase]: 137/281 cut-off events. [2024-02-19 15:28:09,181 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2024-02-19 15:28:09,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 281 events. 137/281 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1121 event pairs, 8 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 1890. Up to 252 conditions per place. [2024-02-19 15:28:09,185 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 66 selfloop transitions, 17 changer transitions 48/132 dead transitions. [2024-02-19 15:28:09,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 132 transitions, 2131 flow [2024-02-19 15:28:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:28:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:28:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-02-19 15:28:09,186 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2024-02-19 15:28:09,186 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2024-02-19 15:28:09,187 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 132 transitions, 2131 flow [2024-02-19 15:28:09,187 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:09,190 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:09,190 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:09,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-19 15:28:09,405 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,SelfDestructingSolverStorable6 [2024-02-19 15:28:09,406 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:09,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -586925788, now seen corresponding path program 3 times [2024-02-19 15:28:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:09,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552450134] [2024-02-19 15:28:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:09,475 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:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552450134] [2024-02-19 15:28:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552450134] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:28:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:28:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:28:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225631595] [2024-02-19 15:28:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:28:09,477 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:28:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:28:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:28:09,479 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:28:09,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 132 transitions, 2131 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:09,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:09,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:28:09,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:09,559 INFO L124 PetriNetUnfolderBase]: 137/274 cut-off events. [2024-02-19 15:28:09,560 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-02-19 15:28:09,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2403 conditions, 274 events. 137/274 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1075 event pairs, 8 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 2081. Up to 246 conditions per place. [2024-02-19 15:28:09,563 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 65 selfloop transitions, 12 changer transitions 48/129 dead transitions. [2024-02-19 15:28:09,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 129 transitions, 2325 flow [2024-02-19 15:28:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:28:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:28:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2024-02-19 15:28:09,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-02-19 15:28:09,565 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 27 predicate places. [2024-02-19 15:28:09,565 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 129 transitions, 2325 flow [2024-02-19 15:28:09,566 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:09,566 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:09,566 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:09,566 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 15:28:09,566 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:09,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash 852888417, now seen corresponding path program 4 times [2024-02-19 15:28:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:09,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202582986] [2024-02-19 15:28:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:09,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:09,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202582986] [2024-02-19 15:28:09,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202582986] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:09,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261362941] [2024-02-19 15:28:09,664 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:28:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:09,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:09,665 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:09,686 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:09,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:28:09,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:09,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:28:09,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:09,799 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:09,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:09,849 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:09,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261362941] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:09,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:09,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-02-19 15:28:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259823391] [2024-02-19 15:28:09,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:09,855 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:28:09,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:09,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:28:09,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:28:09,859 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:09,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 129 transitions, 2325 flow. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:09,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:09,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:09,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:09,982 INFO L124 PetriNetUnfolderBase]: 131/259 cut-off events. [2024-02-19 15:28:09,982 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-02-19 15:28:09,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 259 events. 131/259 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 981 event pairs, 8 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 2199. Up to 232 conditions per place. [2024-02-19 15:28:09,986 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 59 selfloop transitions, 14 changer transitions 48/122 dead transitions. [2024-02-19 15:28:09,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 122 transitions, 2435 flow [2024-02-19 15:28:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:28:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:28:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-02-19 15:28:09,987 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-19 15:28:09,988 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 31 predicate places. [2024-02-19 15:28:09,988 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 122 transitions, 2435 flow [2024-02-19 15:28:09,988 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:09,988 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:09,989 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:10,007 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:10,204 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:10,205 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:10,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1165251141, now seen corresponding path program 1 times [2024-02-19 15:28:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:10,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319492852] [2024-02-19 15:28:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:28:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:10,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319492852] [2024-02-19 15:28:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319492852] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:10,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405770941] [2024-02-19 15:28:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:10,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:10,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:10,497 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:10,514 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:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:10,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjunts are in the unsatisfiable core [2024-02-19 15:28:10,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:10,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:28:10,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:28:10,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2024-02-19 15:28:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:10,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:11,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 116 [2024-02-19 15:28:11,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:28:11,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 601 treesize of output 541 [2024-02-19 15:28:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:40,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405770941] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:28:40,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:28:40,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2024-02-19 15:28:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852302510] [2024-02-19 15:28:40,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:28:40,512 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 15:28:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:28:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 15:28:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-02-19 15:28:40,531 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:28:40,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 122 transitions, 2435 flow. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:40,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:28:40,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:28:40,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:28:42,505 INFO L124 PetriNetUnfolderBase]: 393/758 cut-off events. [2024-02-19 15:28:42,506 INFO L125 PetriNetUnfolderBase]: For 1000/1000 co-relation queries the response was YES. [2024-02-19 15:28:42,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8191 conditions, 758 events. 393/758 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3855 event pairs, 4 based on Foata normal form. 2/626 useless extension candidates. Maximal degree in co-relation 3643. Up to 692 conditions per place. [2024-02-19 15:28:42,513 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 99 selfloop transitions, 31 changer transitions 231/362 dead transitions. [2024-02-19 15:28:42,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 362 transitions, 8004 flow [2024-02-19 15:28:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-19 15:28:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-19 15:28:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 257 transitions. [2024-02-19 15:28:42,516 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4220032840722496 [2024-02-19 15:28:42,516 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 59 predicate places. [2024-02-19 15:28:42,516 INFO L507 AbstractCegarLoop]: Abstraction has has 81 places, 362 transitions, 8004 flow [2024-02-19 15:28:42,517 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:28:42,517 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:28:42,517 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:28:42,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-19 15:28:42,745 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:42,746 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:28:42,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:28:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash 73688682, now seen corresponding path program 2 times [2024-02-19 15:28:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:28:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359860563] [2024-02-19 15:28:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:28:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:28:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:28:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:28:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:28:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359860563] [2024-02-19 15:28:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359860563] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:28:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341261590] [2024-02-19 15:28:43,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:28:43,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:28:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:28:43,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:28:43,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-19 15:28:43,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:28:43,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:28:43,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 35 conjunts are in the unsatisfiable core [2024-02-19 15:28:43,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:28:43,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:28:43,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-19 15:28:43,546 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-02-19 15:28:43,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2024-02-19 15:28:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:28:43,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:28:43,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 230 [2024-02-19 15:28:44,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:28:44,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 35598 treesize of output 24470 [2024-02-19 15:32:50,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-02-19 15:32:50,820 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-02-19 15:32:50,821 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:32:50,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-02-19 15:32:51,021 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-02-19 15:32:51,022 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:527) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-02-19 15:32:51,035 INFO L158 Benchmark]: Toolchain (without parser) took 286334.74ms. Allocated memory was 60.8MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 32.6MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-02-19 15:32:51,035 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:32:51,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.28ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 32.3MB in the beginning and 55.1MB in the end (delta: -22.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-02-19 15:32:51,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 53.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:32:51,036 INFO L158 Benchmark]: Boogie Preprocessor took 81.96ms. Allocated memory is still 79.7MB. Free memory was 53.0MB in the beginning and 50.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:32:51,037 INFO L158 Benchmark]: RCFGBuilder took 761.65ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 55.8MB in the end (delta: -5.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-02-19 15:32:51,037 INFO L158 Benchmark]: TraceAbstraction took 285096.10ms. Allocated memory was 79.7MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 55.3MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-02-19 15:32:51,038 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.20ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.28ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 32.3MB in the beginning and 55.1MB in the end (delta: -22.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 53.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.96ms. Allocated memory is still 79.7MB. Free memory was 53.0MB in the beginning and 50.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 761.65ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 55.8MB in the end (delta: -5.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 285096.10ms. Allocated memory was 79.7MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 55.3MB in the beginning and 2.7GB in the end (delta: -2.7GB). 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-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 199b95a7803e428766b942c5c5c486b02a8ea32baf687cdef6ce754bef283884 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:32:53,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:32:53,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:32:53,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:32:53,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:32:53,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:32:53,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:32:53,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:32:53,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:32:53,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:32:53,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:32:53,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:32:53,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:32:53,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:32:53,392 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:32:53,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:32:53,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:32:53,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:32:53,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:32:53,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:32:53,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:32:53,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:32:53,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:32:53,398 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:32:53,398 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:32:53,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:32:53,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:32:53,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:32:53,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:32:53,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:32:53,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:32:53,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:32:53,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:32:53,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:32:53,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:32:53,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:32:53,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:32:53,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:32:53,401 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:32:53,402 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:32:53,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:32:53,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:32:53,403 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:32:53,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:32:53,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:32:53,403 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:32:53,404 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 -> 199b95a7803e428766b942c5c5c486b02a8ea32baf687cdef6ce754bef283884 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:32:53,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:32:53,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:32:53,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:32:53,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:32:53,749 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:32:53,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-02-19 15:32:55,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:32:55,202 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:32:55,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-02-19 15:32:55,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6c78706/9e6ece5d8e774958b40d48a0a6a63f24/FLAG969007c3d [2024-02-19 15:32:55,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6c78706/9e6ece5d8e774958b40d48a0a6a63f24 [2024-02-19 15:32:55,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:32:55,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:32:55,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:32:55,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:32:55,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:32:55,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a881572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55, skipping insertion in model container [2024-02-19 15:32:55,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,266 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:32:55,483 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-02-19 15:32:55,496 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:32:55,511 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:32:55,518 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:32:55,544 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-02-19 15:32:55,551 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:32:55,557 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:32:55,590 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-02-19 15:32:55,596 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:32:55,613 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:32:55,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55 WrapperNode [2024-02-19 15:32:55,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:32:55,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:32:55,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:32:55,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:32:55,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,672 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 145 [2024-02-19 15:32:55,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:32:55,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:32:55,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:32:55,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:32:55,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,721 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 5, 2, 2]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-19 15:32:55,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:32:55,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:32:55,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:32:55,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:32:55,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (1/1) ... [2024-02-19 15:32:55,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:32:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:32:55,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 15:32:55,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 15:32:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:32:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:32:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:32:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:32:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:32:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:32:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:32:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:32:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:32:55,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:32:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:32:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:32:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:32:55,838 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:32:55,976 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:32:55,978 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:32:56,358 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:32:56,358 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:32:56,681 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:32:56,682 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-19 15:32:56,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:32:56 BoogieIcfgContainer [2024-02-19 15:32:56,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:32:56,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:32:56,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:32:56,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:32:56,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:32:55" (1/3) ... [2024-02-19 15:32:56,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcebecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:32:56, skipping insertion in model container [2024-02-19 15:32:56,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:32:55" (2/3) ... [2024-02-19 15:32:56,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcebecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:32:56, skipping insertion in model container [2024-02-19 15:32:56,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:32:56" (3/3) ... [2024-02-19 15:32:56,692 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-02-19 15:32:56,707 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:32:56,707 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:32:56,707 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:32:56,744 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:32:56,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:32:56,796 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-02-19 15:32:56,796 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:32:56,799 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:32:56,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-02-19 15:32:56,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-02-19 15:32:56,815 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:32:56,822 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;@49e35591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:32:56,822 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:32:56,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:32:56,833 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-02-19 15:32:56,833 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:32:56,833 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:56,834 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:56,834 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:56,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash 662053573, now seen corresponding path program 1 times [2024-02-19 15:32:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:56,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902846584] [2024-02-19 15:32:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:56,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:56,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:56,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:32:56,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-02-19 15:32:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:56,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:32:56,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:32:57,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:57,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:57,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902846584] [2024-02-19 15:32:57,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902846584] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:57,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:57,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:32:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704443999] [2024-02-19 15:32:57,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:57,068 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:32:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:32:57,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:32:57,095 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:32:57,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:57,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:57,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:32:57,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:57,250 INFO L124 PetriNetUnfolderBase]: 66/117 cut-off events. [2024-02-19 15:32:57,250 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-19 15:32:57,254 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 311 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:32:57,256 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-02-19 15:32:57,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2024-02-19 15:32:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:32:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:32:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-02-19 15:32:57,271 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-02-19 15:32:57,276 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-02-19 15:32:57,276 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 28 transitions, 127 flow [2024-02-19 15:32:57,277 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:57,277 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:57,277 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:57,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:32:57,480 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:57,480 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:57,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2041808098, now seen corresponding path program 1 times [2024-02-19 15:32:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910155158] [2024-02-19 15:32:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:57,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:57,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:57,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:32:57,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-02-19 15:32:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:57,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:32:57,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:57,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:57,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910155158] [2024-02-19 15:32:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910155158] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:57,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:32:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578223875] [2024-02-19 15:32:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:57,611 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:32:57,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:57,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:32:57,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:32:57,612 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:32:57,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 28 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:57,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:57,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:32:57,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:57,735 INFO L124 PetriNetUnfolderBase]: 66/118 cut-off events. [2024-02-19 15:32:57,736 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-19 15:32:57,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 118 events. 66/118 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 9 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2024-02-19 15:32:57,740 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2024-02-19 15:32:57,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 29 transitions, 183 flow [2024-02-19 15:32:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:32:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:32:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2024-02-19 15:32:57,745 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-19 15:32:57,746 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2024-02-19 15:32:57,746 INFO L507 AbstractCegarLoop]: Abstraction has has 26 places, 29 transitions, 183 flow [2024-02-19 15:32:57,747 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:57,748 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:57,748 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:57,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-02-19 15:32:57,951 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:57,952 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:57,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1752081993, now seen corresponding path program 1 times [2024-02-19 15:32:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:57,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310336556] [2024-02-19 15:32:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:57,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:57,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:32:57,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-02-19 15:32:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:58,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:32:58,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:58,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:58,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:58,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310336556] [2024-02-19 15:32:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310336556] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:32:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666686446] [2024-02-19 15:32:58,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:58,190 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:32:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:32:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:32:58,192 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:58,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 29 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:58,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:58,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:58,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:58,374 INFO L124 PetriNetUnfolderBase]: 80/151 cut-off events. [2024-02-19 15:32:58,375 INFO L125 PetriNetUnfolderBase]: For 87/91 co-relation queries the response was YES. [2024-02-19 15:32:58,375 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 481 event pairs, 3 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 417. Up to 136 conditions per place. [2024-02-19 15:32:58,377 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 38 selfloop transitions, 5 changer transitions 6/51 dead transitions. [2024-02-19 15:32:58,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 51 transitions, 428 flow [2024-02-19 15:32:58,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:32:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:32:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-02-19 15:32:58,378 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-02-19 15:32:58,379 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2024-02-19 15:32:58,379 INFO L507 AbstractCegarLoop]: Abstraction has has 30 places, 51 transitions, 428 flow [2024-02-19 15:32:58,380 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:58,380 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:58,380 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:58,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-02-19 15:32:58,594 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:58,600 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:58,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1884357173, now seen corresponding path program 2 times [2024-02-19 15:32:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644993717] [2024-02-19 15:32:58,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:32:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:58,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:32:58,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-02-19 15:32:58,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:32:58,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:32:58,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 15:32:58,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:58,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:32:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:58,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644993717] [2024-02-19 15:32:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644993717] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:32:58,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:32:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-02-19 15:32:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315125674] [2024-02-19 15:32:58,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:32:58,887 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:32:58,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:32:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:32:58,895 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:58,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 51 transitions, 428 flow. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:58,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:58,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:58,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:59,388 INFO L124 PetriNetUnfolderBase]: 146/277 cut-off events. [2024-02-19 15:32:59,388 INFO L125 PetriNetUnfolderBase]: For 290/292 co-relation queries the response was YES. [2024-02-19 15:32:59,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 277 events. 146/277 cut-off events. For 290/292 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 994 event pairs, 0 based on Foata normal form. 6/218 useless extension candidates. Maximal degree in co-relation 1095. Up to 247 conditions per place. [2024-02-19 15:32:59,394 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 77 selfloop transitions, 15 changer transitions 12/106 dead transitions. [2024-02-19 15:32:59,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 106 transitions, 1100 flow [2024-02-19 15:32:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:32:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:32:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-02-19 15:32:59,396 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-02-19 15:32:59,397 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2024-02-19 15:32:59,397 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 106 transitions, 1100 flow [2024-02-19 15:32:59,397 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:59,397 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:32:59,397 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:32:59,402 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:32:59,601 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:59,601 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:32:59,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:32:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1128300994, now seen corresponding path program 1 times [2024-02-19 15:32:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:32:59,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337712918] [2024-02-19 15:32:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:32:59,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:32:59,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:32:59,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:32:59,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-02-19 15:32:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:32:59,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:32:59,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:32:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:32:59,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:32:59,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:32:59,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337712918] [2024-02-19 15:32:59,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337712918] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:32:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:32:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:32:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422665273] [2024-02-19 15:32:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:32:59,794 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:32:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:32:59,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:32:59,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:32:59,796 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:32:59,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 106 transitions, 1100 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:32:59,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:32:59,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:32:59,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:32:59,996 INFO L124 PetriNetUnfolderBase]: 132/252 cut-off events. [2024-02-19 15:32:59,997 INFO L125 PetriNetUnfolderBase]: For 411/419 co-relation queries the response was YES. [2024-02-19 15:32:59,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 252 events. 132/252 cut-off events. For 411/419 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 879 event pairs, 0 based on Foata normal form. 8/207 useless extension candidates. Maximal degree in co-relation 1176. Up to 223 conditions per place. [2024-02-19 15:32:59,999 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 77 selfloop transitions, 7 changer transitions 24/110 dead transitions. [2024-02-19 15:32:59,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 110 transitions, 1353 flow [2024-02-19 15:33:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:33:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:33:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-02-19 15:33:00,001 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-02-19 15:33:00,001 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2024-02-19 15:33:00,002 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 110 transitions, 1353 flow [2024-02-19 15:33:00,002 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:00,002 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:00,002 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:00,012 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:00,205 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:00,205 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:00,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:00,206 INFO L85 PathProgramCache]: Analyzing trace with hash 753599512, now seen corresponding path program 2 times [2024-02-19 15:33:00,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677290324] [2024-02-19 15:33:00,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:33:00,207 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:00,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:00,209 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:00,252 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:00,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:33:00,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:00,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:33:00,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:00,458 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:00,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:00,490 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:00,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677290324] [2024-02-19 15:33:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677290324] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:33:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:33:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-02-19 15:33:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051662227] [2024-02-19 15:33:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:00,491 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:33:00,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:33:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:33:00,492 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:00,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 110 transitions, 1353 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:00,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:00,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:00,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:00,646 INFO L124 PetriNetUnfolderBase]: 132/245 cut-off events. [2024-02-19 15:33:00,646 INFO L125 PetriNetUnfolderBase]: For 591/599 co-relation queries the response was YES. [2024-02-19 15:33:00,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 245 events. 132/245 cut-off events. For 591/599 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 843 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 1345. Up to 217 conditions per place. [2024-02-19 15:33:00,649 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 75 selfloop transitions, 7 changer transitions 24/108 dead transitions. [2024-02-19 15:33:00,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 108 transitions, 1529 flow [2024-02-19 15:33:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:33:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:33:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2024-02-19 15:33:00,650 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:33:00,650 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 22 predicate places. [2024-02-19 15:33:00,651 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 108 transitions, 1529 flow [2024-02-19 15:33:00,651 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:00,651 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:00,651 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:00,659 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:00,854 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:00,855 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:00,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1960154597, now seen corresponding path program 3 times [2024-02-19 15:33:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049072683] [2024-02-19 15:33:00,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:33:00,856 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:00,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:00,857 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:00,858 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:00,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:33:00,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:00,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:33:00,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:33:01,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:33:01,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049072683] [2024-02-19 15:33:01,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049072683] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:33:01,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:33:01,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:33:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171562756] [2024-02-19 15:33:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:01,029 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:33:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:33:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:33:01,032 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:01,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 108 transitions, 1529 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:01,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:01,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:01,211 INFO L124 PetriNetUnfolderBase]: 146/269 cut-off events. [2024-02-19 15:33:01,211 INFO L125 PetriNetUnfolderBase]: For 633/641 co-relation queries the response was YES. [2024-02-19 15:33:01,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 269 events. 146/269 cut-off events. For 633/641 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 916 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 1729. Up to 241 conditions per place. [2024-02-19 15:33:01,216 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 86 selfloop transitions, 10 changer transitions 24/123 dead transitions. [2024-02-19 15:33:01,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 123 transitions, 1972 flow [2024-02-19 15:33:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:33:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:33:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-02-19 15:33:01,218 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-02-19 15:33:01,218 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 26 predicate places. [2024-02-19 15:33:01,218 INFO L507 AbstractCegarLoop]: Abstraction has has 48 places, 123 transitions, 1972 flow [2024-02-19 15:33:01,219 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:01,219 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:01,219 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:01,225 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:01,422 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:01,423 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:01,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash -702067293, now seen corresponding path program 4 times [2024-02-19 15:33:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498878022] [2024-02-19 15:33:01,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:33:01,424 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:01,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:01,425 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:01,426 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:01,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:33:01,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:01,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:33:01,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:33:01,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:33:01,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498878022] [2024-02-19 15:33:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498878022] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:33:01,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:33:01,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2024-02-19 15:33:01,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017940824] [2024-02-19 15:33:01,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:33:01,917 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:33:01,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:33:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:33:01,931 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-19 15:33:01,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 123 transitions, 1972 flow. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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:01,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:01,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-19 15:33:01,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:03,159 INFO L124 PetriNetUnfolderBase]: 286/517 cut-off events. [2024-02-19 15:33:03,159 INFO L125 PetriNetUnfolderBase]: For 764/764 co-relation queries the response was YES. [2024-02-19 15:33:03,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4476 conditions, 517 events. 286/517 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2027 event pairs, 2 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 3672. Up to 471 conditions per place. [2024-02-19 15:33:03,165 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 122 selfloop transitions, 80 changer transitions 40/243 dead transitions. [2024-02-19 15:33:03,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 243 transitions, 4351 flow [2024-02-19 15:33:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-19 15:33:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-19 15:33:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 156 transitions. [2024-02-19 15:33:03,168 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-02-19 15:33:03,169 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 41 predicate places. [2024-02-19 15:33:03,169 INFO L507 AbstractCegarLoop]: Abstraction has has 63 places, 243 transitions, 4351 flow [2024-02-19 15:33:03,169 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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:03,169 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:03,169 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:03,180 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:33:03,373 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:33:03,374 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:33:03,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1054354691, now seen corresponding path program 5 times [2024-02-19 15:33:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495847888] [2024-02-19 15:33:03,375 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:33:03,375 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:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:03,376 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:33:03,380 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:33:03,476 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:33:03,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:03,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjunts are in the unsatisfiable core [2024-02-19 15:33:03,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:03,789 INFO L349 Elim1Store]: treesize reduction 220, result has 5.6 percent of original size [2024-02-19 15:33:03,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 262 treesize of output 90 [2024-02-19 15:33:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:33:03,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:33:04,269 INFO L349 Elim1Store]: treesize reduction 201, result has 20.6 percent of original size [2024-02-19 15:33:04,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 299 treesize of output 140 [2024-02-19 15:33:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:33:10,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495847888] [2024-02-19 15:33:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495847888] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:33:10,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:33:10,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-02-19 15:33:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095210004] [2024-02-19 15:33:10,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:33:10,974 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 15:33:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:10,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 15:33:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:33:10,975 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-19 15:33:10,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 243 transitions, 4351 flow. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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:10,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:10,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-19 15:33:10,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:12,406 INFO L124 PetriNetUnfolderBase]: 571/1024 cut-off events. [2024-02-19 15:33:12,406 INFO L125 PetriNetUnfolderBase]: For 2188/2188 co-relation queries the response was YES. [2024-02-19 15:33:12,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9820 conditions, 1024 events. 571/1024 cut-off events. For 2188/2188 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4860 event pairs, 4 based on Foata normal form. 4/826 useless extension candidates. Maximal degree in co-relation 4062. Up to 936 conditions per place. [2024-02-19 15:33:12,414 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 185 selfloop transitions, 9 changer transitions 269/473 dead transitions. [2024-02-19 15:33:12,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 473 transitions, 9502 flow [2024-02-19 15:33:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:33:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:33:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-02-19 15:33:12,416 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-02-19 15:33:12,417 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2024-02-19 15:33:12,417 INFO L507 AbstractCegarLoop]: Abstraction has has 70 places, 473 transitions, 9502 flow [2024-02-19 15:33:12,417 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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:12,417 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:12,417 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:12,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-02-19 15:33:12,621 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:33:12,621 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:33:12,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1566368064, now seen corresponding path program 6 times [2024-02-19 15:33:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412936196] [2024-02-19 15:33:12,623 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:33:12,623 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:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:12,624 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:33:12,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-02-19 15:33:12,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-19 15:33:12,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:33:12,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:33:12,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:33:12,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:33:12,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:33:12,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412936196] [2024-02-19 15:33:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412936196] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:33:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:33:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:33:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472006328] [2024-02-19 15:33:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:33:12,800 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:33:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:33:12,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:33:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:33:12,803 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2024-02-19 15:33:12,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 473 transitions, 9502 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:33:12,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:33:12,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2024-02-19 15:33:12,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:33:13,145 INFO L124 PetriNetUnfolderBase]: 567/1008 cut-off events. [2024-02-19 15:33:13,145 INFO L125 PetriNetUnfolderBase]: For 2448/2448 co-relation queries the response was YES. [2024-02-19 15:33:13,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10649 conditions, 1008 events. 567/1008 cut-off events. For 2448/2448 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4704 event pairs, 4 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 4408. Up to 921 conditions per place. [2024-02-19 15:33:13,153 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 156 selfloop transitions, 42 changer transitions 260/462 dead transitions. [2024-02-19 15:33:13,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 462 transitions, 10192 flow [2024-02-19 15:33:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:33:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:33:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2024-02-19 15:33:13,155 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-02-19 15:33:13,156 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 52 predicate places. [2024-02-19 15:33:13,156 INFO L507 AbstractCegarLoop]: Abstraction has has 74 places, 462 transitions, 10192 flow [2024-02-19 15:33:13,156 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:33:13,156 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:33:13,156 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:33:13,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-02-19 15:33:13,359 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:33:13,359 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:33:13,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:33:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1639793018, now seen corresponding path program 1 times [2024-02-19 15:33:13,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:33:13,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647023197] [2024-02-19 15:33:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:33:13,361 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:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:33:13,362 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:33:13,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-02-19 15:33:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:33:13,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:33:13,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:33:14,294 INFO L349 Elim1Store]: treesize reduction 420, result has 20.6 percent of original size [2024-02-19 15:33:14,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 20 new quantified variables, introduced 66 case distinctions, treesize of input 1313 treesize of output 237 [2024-02-19 15:34:23,331 WARN L293 SmtUtils]: Spent 19.92s on a formula simplification that was a NOOP. DAG size: 2097 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:40:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:40:05,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:40:37,510 WARN L293 SmtUtils]: Spent 11.46s on a formula simplification. DAG size of input: 1111 DAG size of output: 253 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-19 15:40:37,511 INFO L349 Elim1Store]: treesize reduction 2259, result has 19.6 percent of original size [2024-02-19 15:40:37,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 40 new quantified variables, introduced 276 case distinctions, treesize of input 1725 treesize of output 801 Killed by 15