./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.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/popl20-more-dec-subseq.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 ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --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:01:10,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:01:11,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:01:11,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:01:11,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:01:11,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:01:11,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:01:11,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:01:11,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:01:11,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:01:11,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:01:11,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:01:11,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:01:11,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:01:11,072 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:01:11,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:01:11,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:01:11,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:01:11,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:01:11,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:01:11,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:01:11,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:01:11,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:01:11,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:01:11,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:01:11,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:01:11,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:01:11,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:01:11,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:01:11,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:01:11,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:01:11,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:01:11,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:01:11,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:01:11,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:01:11,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:01:11,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:01:11,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:01:11,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:01:11,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:01:11,080 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:01:11,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:01:11,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:01:11,080 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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:01:11,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:01:11,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:01:11,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:01:11,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:01:11,334 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:01:11,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-19 15:01:12,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:01:12,481 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:01:12,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-19 15:01:12,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d24d62f9/17e47e97591d469584adff2947b7acf8/FLAG346dd42f3 [2024-02-19 15:01:12,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d24d62f9/17e47e97591d469584adff2947b7acf8 [2024-02-19 15:01:12,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:01:12,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:01:12,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:01:12,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:01:12,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:01:12,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0dbd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12, skipping insertion in model container [2024-02-19 15:01:12,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,528 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:01:12,652 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/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-19 15:01:12,659 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:01:12,665 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:01:12,688 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/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-19 15:01:12,691 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:01:12,715 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:01:12,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12 WrapperNode [2024-02-19 15:01:12,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:01:12,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:01:12,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:01:12,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:01:12,721 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:01:12" (1/1) ... [2024-02-19 15:01:12,727 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:01:12" (1/1) ... [2024-02-19 15:01:12,749 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 197 [2024-02-19 15:01:12,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:01:12,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:01:12,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:01:12,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:01:12,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,772 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 2, 8]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-02-19 15:01:12,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:01:12,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:01:12,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:01:12,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:01:12,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (1/1) ... [2024-02-19 15:01:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:01:12,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:12,826 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:01:12,834 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:01:12,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:01:12,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:01:12,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:01:12,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:01:12,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:01:12,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:01:12,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:01:12,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:01:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:01:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:01:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:01:12,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:01:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:01:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:01:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:01:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:01:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:01:12,873 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:01:12,957 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:01:12,960 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:01:13,263 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:01:13,265 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:01:13,527 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:01:13,527 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:01:13,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:01:13 BoogieIcfgContainer [2024-02-19 15:01:13,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:01:13,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:01:13,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:01:13,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:01:13,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:01:12" (1/3) ... [2024-02-19 15:01:13,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2a8a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:01:13, skipping insertion in model container [2024-02-19 15:01:13,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:12" (2/3) ... [2024-02-19 15:01:13,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2a8a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:01:13, skipping insertion in model container [2024-02-19 15:01:13,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:01:13" (3/3) ... [2024-02-19 15:01:13,537 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-02-19 15:01:13,552 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:01:13,552 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:01:13,553 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:01:13,594 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:01:13,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:01:13,662 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-02-19 15:01:13,662 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:01:13,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 5/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-02-19 15:01:13,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:01:13,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 27 transitions, 66 flow [2024-02-19 15:01:13,683 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:01:13,689 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;@1daf1b92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:01:13,689 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:01:13,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:01:13,701 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-02-19 15:01:13,701 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:01:13,701 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:13,702 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:13,703 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:01:13,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash 623822489, now seen corresponding path program 1 times [2024-02-19 15:01:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762365533] [2024-02-19 15:01:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:14,094 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:01:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762365533] [2024-02-19 15:01:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762365533] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:01:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783569416] [2024-02-19 15:01:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:14,104 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:01:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:14,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:01:14,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:01:14,196 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:14,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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:01:14,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:14,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:14,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:14,298 INFO L124 PetriNetUnfolderBase]: 193/337 cut-off events. [2024-02-19 15:01:14,298 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-19 15:01:14,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 337 events. 193/337 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1328 event pairs, 51 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 618. Up to 185 conditions per place. [2024-02-19 15:01:14,302 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-02-19 15:01:14,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-02-19 15:01:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:01:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:01:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-02-19 15:01:14,310 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-19 15:01:14,313 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-02-19 15:01:14,313 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 39 transitions, 163 flow [2024-02-19 15:01:14,313 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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:01:14,314 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:14,314 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:01:14,314 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:01:14,314 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:01:14,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1096153256, now seen corresponding path program 1 times [2024-02-19 15:01:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244166097] [2024-02-19 15:01:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:14,405 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:01:14,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:14,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244166097] [2024-02-19 15:01:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244166097] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:14,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:14,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:01:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474518214] [2024-02-19 15:01:14,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:14,407 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:01:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:14,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:01:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:01:14,413 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:14,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 39 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:01:14,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:14,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:14,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:14,477 INFO L124 PetriNetUnfolderBase]: 193/338 cut-off events. [2024-02-19 15:01:14,478 INFO L125 PetriNetUnfolderBase]: For 54/130 co-relation queries the response was YES. [2024-02-19 15:01:14,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 338 events. 193/338 cut-off events. For 54/130 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1323 event pairs, 51 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 904. Up to 313 conditions per place. [2024-02-19 15:01:14,481 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 34 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-02-19 15:01:14,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 239 flow [2024-02-19 15:01:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:01:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:01:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2024-02-19 15:01:14,482 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-02-19 15:01:14,483 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-02-19 15:01:14,483 INFO L507 AbstractCegarLoop]: Abstraction has has 34 places, 40 transitions, 239 flow [2024-02-19 15:01:14,483 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:01:14,483 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:14,483 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:14,483 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:01:14,484 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:01:14,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1576562806, now seen corresponding path program 1 times [2024-02-19 15:01:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292636382] [2024-02-19 15:01:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292636382] [2024-02-19 15:01:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292636382] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:14,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:14,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:01:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107523103] [2024-02-19 15:01:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:14,629 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:01:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:01:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:01:14,631 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:14,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 40 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:01:14,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:14,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:14,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:14,744 INFO L124 PetriNetUnfolderBase]: 263/493 cut-off events. [2024-02-19 15:01:14,744 INFO L125 PetriNetUnfolderBase]: For 248/408 co-relation queries the response was YES. [2024-02-19 15:01:14,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 493 events. 263/493 cut-off events. For 248/408 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2096 event pairs, 38 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1682. Up to 436 conditions per place. [2024-02-19 15:01:14,750 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 54 selfloop transitions, 3 changer transitions 3/64 dead transitions. [2024-02-19 15:01:14,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 509 flow [2024-02-19 15:01:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:01:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:01:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-19 15:01:14,752 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-02-19 15:01:14,754 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2024-02-19 15:01:14,754 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 64 transitions, 509 flow [2024-02-19 15:01:14,754 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:01:14,754 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:14,755 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:14,755 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:01:14,755 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:01:14,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash 787309211, now seen corresponding path program 1 times [2024-02-19 15:01:14,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:14,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116642776] [2024-02-19 15:01:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:14,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116642776] [2024-02-19 15:01:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116642776] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:14,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:14,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:01:14,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811705814] [2024-02-19 15:01:14,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:14,816 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:01:14,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:14,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:01:14,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:01:14,833 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:14,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 64 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:01:14,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:14,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:14,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:14,912 INFO L124 PetriNetUnfolderBase]: 257/492 cut-off events. [2024-02-19 15:01:14,912 INFO L125 PetriNetUnfolderBase]: For 425/707 co-relation queries the response was YES. [2024-02-19 15:01:14,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 492 events. 257/492 cut-off events. For 425/707 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2096 event pairs, 21 based on Foata normal form. 13/451 useless extension candidates. Maximal degree in co-relation 2104. Up to 447 conditions per place. [2024-02-19 15:01:14,915 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 62 selfloop transitions, 3 changer transitions 9/78 dead transitions. [2024-02-19 15:01:14,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 78 transitions, 781 flow [2024-02-19 15:01:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:01:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:01:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-02-19 15:01:14,916 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-02-19 15:01:14,916 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-02-19 15:01:14,917 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 78 transitions, 781 flow [2024-02-19 15:01:14,917 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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:01:14,917 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:14,917 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:14,917 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:01:14,917 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:01:14,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1843767890, now seen corresponding path program 1 times [2024-02-19 15:01:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894553870] [2024-02-19 15:01:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894553870] [2024-02-19 15:01:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894553870] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:15,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:15,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:01:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111198081] [2024-02-19 15:01:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:15,013 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:01:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:01:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:01:15,014 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:15,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 78 transitions, 781 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:01:15,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:15,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:15,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:15,110 INFO L124 PetriNetUnfolderBase]: 315/621 cut-off events. [2024-02-19 15:01:15,110 INFO L125 PetriNetUnfolderBase]: For 560/634 co-relation queries the response was YES. [2024-02-19 15:01:15,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 621 events. 315/621 cut-off events. For 560/634 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2874 event pairs, 40 based on Foata normal form. 12/561 useless extension candidates. Maximal degree in co-relation 2510. Up to 567 conditions per place. [2024-02-19 15:01:15,114 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 64 selfloop transitions, 2 changer transitions 34/104 dead transitions. [2024-02-19 15:01:15,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 104 transitions, 1256 flow [2024-02-19 15:01:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:01:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:01:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-19 15:01:15,115 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-19 15:01:15,115 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2024-02-19 15:01:15,116 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 104 transitions, 1256 flow [2024-02-19 15:01:15,116 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:01:15,116 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:15,116 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:15,116 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 15:01:15,116 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:01:15,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash 426916302, now seen corresponding path program 1 times [2024-02-19 15:01:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448978277] [2024-02-19 15:01:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:15,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:15,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448978277] [2024-02-19 15:01:15,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448978277] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:01:15,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177323215] [2024-02-19 15:01:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:15,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:15,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:15,915 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:01:15,952 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:01:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:16,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2024-02-19 15:01:16,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:01:16,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-02-19 15:01:16,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:16,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:01:16,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:16,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:01:16,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:16,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:01:16,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:01:16,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:01:16,120 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 23 treesize of output 1 [2024-02-19 15:01:16,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-19 15:01:16,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-19 15:01:16,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-19 15:01:16,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-02-19 15:01:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:16,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:01:17,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:17,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2024-02-19 15:01:17,214 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-02-19 15:01:17,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2024-02-19 15:01:17,240 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2024-02-19 15:01:17,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 66 [2024-02-19 15:01:17,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:17,272 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-02-19 15:01:17,275 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 44 treesize of output 36 [2024-02-19 15:01:17,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:17,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-02-19 15:01:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:01:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177323215] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:01:17,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:01:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2024-02-19 15:01:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213831924] [2024-02-19 15:01:17,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:01:17,334 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-02-19 15:01:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-02-19 15:01:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=887, Unknown=2, NotChecked=0, Total=1056 [2024-02-19 15:01:17,435 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:01:17,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 104 transitions, 1256 flow. Second operand has 33 states, 33 states have (on average 5.2727272727272725) internal successors, (174), 33 states have internal predecessors, (174), 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:01:17,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:17,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:01:17,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:19,258 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int#3| c_~queue~0.base)) (.cse18 (* c_~i~0 4)) (.cse7 (= c_~start~0 0))) (let ((.cse13 (not (= (mod c_~ok~0 256) 0))) (.cse14 (< c_~end~0 0)) (.cse15 (< c_~n~0 (+ c_~end~0 1))) (.cse2 (<= c_~start~0 0)) (.cse4 (not .cse7)) (.cse3 (<= 1 c_~ok~0)) (.cse5 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset .cse18))) (.cse8 (<= (div c_~ok~0 256) 0)) (.cse6 (not (= c_~end~0 0))) (.cse1 (select .cse9 c_~queue~0.offset))) (and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse0 (select (select |c_#memory_int#3| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= .cse0 c_~v_old~0) (not (= c_~queue~0.base ~A~0.base)) (= .cse1 .cse0)))) .cse2 .cse3 (or (and .cse2 (or .cse4 (= |c_thread1Thread1of1ForFork1_#t~mem1#1| .cse5))) .cse6) .cse7 (or (and .cse3 .cse8 (<= (select .cse9 0) c_~v_old~0)) .cse4) (= |c_thread2Thread1of1ForFork0_~cond~0#1| 1) (or (let ((.cse12 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse11 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< (select .cse10 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ .cse11 1)) (not (= (select .cse10 .cse12) .cse11))))) (or .cse13 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse12) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))))))) .cse14 .cse15) (= c_~ok~0 1) .cse8 (= c_~n~0 1) (= c_~queue~0.offset 0) (<= (+ c_~i~0 1) c_~N~0) (= c_~v_old~0 c_~last~0) (or (let ((.cse16 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse16) (or .cse13 .cse16))) .cse14 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (or (and .cse2 (or .cse4 (and .cse3 (<= .cse5 c_~v_old~0) .cse8))) .cse6) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse17 (select (select |c_#memory_int#3| ~A~0.base) (+ ~A~0.offset .cse18)))) (and (<= .cse17 c_~v_old~0) (= .cse17 .cse1) (not (= c_~queue~0.base ~A~0.base)))))))) is different from false [2024-02-19 15:01:23,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-02-19 15:01:28,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-02-19 15:01:31,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= (mod c_~ok~0 256) 0))) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse12 (select |c_#memory_int#3| c_~queue~0.base)) (.cse9 (+ (* c_~end~0 4) c_~queue~0.offset))) (let ((.cse5 (select |c_#memory_int#3| c_~A~0.base)) (.cse4 (select .cse12 .cse9)) (.cse1 (and .cse10 (<= (select .cse12 .cse7) c_~v_old~0))) (.cse0 (< c_~end~0 0)) (.cse2 (< c_~n~0 (+ c_~end~0 1)))) (and (or .cse0 .cse1 .cse2 (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse3 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (< c_~last~0 .cse3) (not (= .cse3 .cse4)))))) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse8 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< (select .cse6 .cse7) (+ .cse8 1)) (not (= (select .cse6 .cse9) .cse8))))) (or .cse10 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse9) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse0 .cse2) (or (not (= (select .cse5 (+ c_~A~0.offset (* c_~i~0 4))) .cse4)) .cse0 .cse1 .cse2 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (or (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse11) (or .cse10 .cse11))) .cse0 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2)))) is different from false [2024-02-19 15:01:34,191 INFO L124 PetriNetUnfolderBase]: 2007/3432 cut-off events. [2024-02-19 15:01:34,191 INFO L125 PetriNetUnfolderBase]: For 6577/6577 co-relation queries the response was YES. [2024-02-19 15:01:34,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21765 conditions, 3432 events. 2007/3432 cut-off events. For 6577/6577 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19180 event pairs, 224 based on Foata normal form. 24/3111 useless extension candidates. Maximal degree in co-relation 10519. Up to 2931 conditions per place. [2024-02-19 15:01:34,212 INFO L140 encePairwiseOnDemand]: 12/30 looper letters, 399 selfloop transitions, 160 changer transitions 258/818 dead transitions. [2024-02-19 15:01:34,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 818 transitions, 11198 flow [2024-02-19 15:01:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-02-19 15:01:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2024-02-19 15:01:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 777 transitions. [2024-02-19 15:01:34,217 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.33205128205128204 [2024-02-19 15:01:34,218 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-02-19 15:01:34,218 INFO L507 AbstractCegarLoop]: Abstraction has has 118 places, 818 transitions, 11198 flow [2024-02-19 15:01:34,218 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.2727272727272725) internal successors, (174), 33 states have internal predecessors, (174), 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:01:34,218 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:34,218 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:34,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 15:01:34,431 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-19 15:01:34,432 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:01:34,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1540360634, now seen corresponding path program 2 times [2024-02-19 15:01:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953104006] [2024-02-19 15:01:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953104006] [2024-02-19 15:01:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953104006] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:01:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18900069] [2024-02-19 15:01:34,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:01:34,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:34,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:34,599 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:01:34,601 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:01:34,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:01:34,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:01:34,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:01:34,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:01:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:34,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:01:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18900069] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:01:34,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:01:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-02-19 15:01:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663053418] [2024-02-19 15:01:34,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:01:34,811 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-19 15:01:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-19 15:01:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-02-19 15:01:34,819 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:01:34,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 818 transitions, 11198 flow. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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:01:34,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:34,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:01:34,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:35,619 INFO L124 PetriNetUnfolderBase]: 2740/4721 cut-off events. [2024-02-19 15:01:35,619 INFO L125 PetriNetUnfolderBase]: For 12606/12606 co-relation queries the response was YES. [2024-02-19 15:01:35,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34383 conditions, 4721 events. 2740/4721 cut-off events. For 12606/12606 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 28358 event pairs, 75 based on Foata normal form. 248/4450 useless extension candidates. Maximal degree in co-relation 16654. Up to 3983 conditions per place. [2024-02-19 15:01:35,664 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 922 selfloop transitions, 243 changer transitions 324/1490 dead transitions. [2024-02-19 15:01:35,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 1490 transitions, 22710 flow [2024-02-19 15:01:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:01:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:01:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-02-19 15:01:35,666 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2024-02-19 15:01:35,666 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 98 predicate places. [2024-02-19 15:01:35,666 INFO L507 AbstractCegarLoop]: Abstraction has has 127 places, 1490 transitions, 22710 flow [2024-02-19 15:01:35,667 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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:01:35,667 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:35,667 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:35,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 15:01:35,878 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:01:35,878 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:01:35,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 518921884, now seen corresponding path program 3 times [2024-02-19 15:01:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046660708] [2024-02-19 15:01:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:36,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046660708] [2024-02-19 15:01:36,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046660708] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:01:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638885552] [2024-02-19 15:01:36,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:01:36,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:36,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:36,521 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:01:36,544 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:01:36,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:01:36,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:01:36,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjunts are in the unsatisfiable core [2024-02-19 15:01:36,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:01:36,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-02-19 15:01:36,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:36,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:01:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:36,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:01:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:36,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:01:36,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:36,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:01:36,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:36,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:01:36,692 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 23 treesize of output 1 [2024-02-19 15:01:36,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-19 15:01:36,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-19 15:01:36,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-19 15:01:37,020 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-02-19 15:01:37,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-02-19 15:01:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:01:37,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:01:37,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:37,480 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 60 [2024-02-19 15:01:37,531 INFO L349 Elim1Store]: treesize reduction 4, result has 95.1 percent of original size [2024-02-19 15:01:37,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 208 [2024-02-19 15:01:37,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:37,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 156 [2024-02-19 15:01:38,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:38,668 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2024-02-19 15:01:38,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:38,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2024-02-19 15:01:38,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:38,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2024-02-19 15:01:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:01:38,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638885552] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:01:38,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:01:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 29 [2024-02-19 15:01:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035113037] [2024-02-19 15:01:38,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:01:38,743 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-19 15:01:38,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-19 15:01:38,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=711, Unknown=3, NotChecked=0, Total=870 [2024-02-19 15:01:38,804 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:01:38,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 1490 transitions, 22710 flow. Second operand has 30 states, 30 states have (on average 5.5) internal successors, (165), 30 states have internal predecessors, (165), 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:01:38,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:38,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:01:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:41,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~end~0 1)) (.cse10 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse17 (select |c_#memory_int#3| c_~queue~0.base)) (.cse13 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse7 (div c_~ok~0 256)) (.cse18 (* c_~i~0 4))) (let ((.cse1 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset .cse18))) (.cse3 (< c_~end~0 0)) (.cse5 (not (= (* 256 .cse7) c_~ok~0))) (.cse6 (select .cse17 .cse13)) (.cse12 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse17 .cse10)) (.cse4 (< c_~n~0 .cse0))) (and (<= 1 c_~ok~0) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (not (= .cse1 .cse2)) .cse3 .cse4 (and .cse5 (<= .cse6 c_~v_old~0))) (or (< c_~end~0 1) (< c_~n~0 2)) (= c_~ok~0 1) (<= .cse7 0) (= c_~queue~0.offset 0) (or .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 (let ((.cse8 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163|) 0))))) (and (or .cse8 .cse5) (or .cse8 (and (= c_~i~0 0) (= c_~start~0 c_~end~0)))))) (or (and (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1)) (or (not (= c_~start~0 0)) (< .cse1 (+ c_~v_old~0 1)))) (not (= c_~end~0 0))) (or .cse3 (and (forall ((v_~A~0.base_88 Int) (v_ArrVal_174 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_174))) (let ((.cse9 (select .cse14 c_~queue~0.base)) (.cse11 (select .cse14 v_~A~0.base_88))) (or (not (= (select .cse9 .cse10) (select .cse11 .cse12))) (< (select .cse9 .cse13) (+ (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (or (forall ((v_~A~0.base_88 Int) (v_ArrVal_174 (Array Int Int))) (not (let ((.cse15 (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_174))) (= (select (select .cse15 c_~queue~0.base) .cse10) (select (select .cse15 v_~A~0.base_88) .cse12))))) .cse5)) .cse4) (or .cse3 (and (or .cse5 (forall ((v_~A~0.base_88 Int)) (not (= (select (select |c_#memory_int#3| v_~A~0.base_88) .cse12) .cse2)))) (forall ((v_~A~0.base_88 Int)) (let ((.cse16 (select |c_#memory_int#3| v_~A~0.base_88))) (or (< .cse6 (+ (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse16 .cse12) .cse2)))))) .cse4)))) is different from false [2024-02-19 15:01:43,826 INFO L124 PetriNetUnfolderBase]: 4949/8485 cut-off events. [2024-02-19 15:01:43,827 INFO L125 PetriNetUnfolderBase]: For 20164/20164 co-relation queries the response was YES. [2024-02-19 15:01:43,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70538 conditions, 8485 events. 4949/8485 cut-off events. For 20164/20164 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 56236 event pairs, 78 based on Foata normal form. 5/7532 useless extension candidates. Maximal degree in co-relation 43252. Up to 7220 conditions per place. [2024-02-19 15:01:43,887 INFO L140 encePairwiseOnDemand]: 10/30 looper letters, 1953 selfloop transitions, 359 changer transitions 520/2833 dead transitions. [2024-02-19 15:01:43,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 2833 transitions, 49162 flow [2024-02-19 15:01:43,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-02-19 15:01:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-02-19 15:01:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 548 transitions. [2024-02-19 15:01:43,889 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38865248226950355 [2024-02-19 15:01:43,890 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 144 predicate places. [2024-02-19 15:01:43,890 INFO L507 AbstractCegarLoop]: Abstraction has has 173 places, 2833 transitions, 49162 flow [2024-02-19 15:01:43,890 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.5) internal successors, (165), 30 states have internal predecessors, (165), 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:01:43,890 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:43,890 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:43,904 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:01:44,103 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:44,106 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:01:44,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash 877373778, now seen corresponding path program 4 times [2024-02-19 15:01:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472559666] [2024-02-19 15:01:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472559666] [2024-02-19 15:01:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472559666] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:01:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560433972] [2024-02-19 15:01:45,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:01:45,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:45,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:45,588 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:01:45,609 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:01:45,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:01:45,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:01:45,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 32 conjunts are in the unsatisfiable core [2024-02-19 15:01:45,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:01:46,043 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-02-19 15:01:46,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-02-19 15:01:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:46,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:01:50,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:50,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 174 [2024-02-19 15:01:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-02-19 15:01:50,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560433972] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:01:50,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:01:50,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 7] total 31 [2024-02-19 15:01:50,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046171666] [2024-02-19 15:01:50,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:01:50,761 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-02-19 15:01:50,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:50,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-02-19 15:01:50,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=842, Unknown=1, NotChecked=0, Total=992 [2024-02-19 15:01:50,973 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:01:50,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 2833 transitions, 49162 flow. Second operand has 32 states, 32 states have (on average 5.53125) internal successors, (177), 32 states have internal predecessors, (177), 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:01:50,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:50,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:01:50,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:55,994 INFO L124 PetriNetUnfolderBase]: 5644/9653 cut-off events. [2024-02-19 15:01:55,995 INFO L125 PetriNetUnfolderBase]: For 23474/23474 co-relation queries the response was YES. [2024-02-19 15:01:56,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89752 conditions, 9653 events. 5644/9653 cut-off events. For 23474/23474 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 65355 event pairs, 58 based on Foata normal form. 2/8568 useless extension candidates. Maximal degree in co-relation 51863. Up to 8185 conditions per place. [2024-02-19 15:01:56,060 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 2262 selfloop transitions, 364 changer transitions 586/3213 dead transitions. [2024-02-19 15:01:56,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 3213 transitions, 62027 flow [2024-02-19 15:01:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-02-19 15:01:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-02-19 15:01:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 299 transitions. [2024-02-19 15:01:56,062 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3322222222222222 [2024-02-19 15:01:56,062 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 173 predicate places. [2024-02-19 15:01:56,062 INFO L507 AbstractCegarLoop]: Abstraction has has 202 places, 3213 transitions, 62027 flow [2024-02-19 15:01:56,063 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.53125) internal successors, (177), 32 states have internal predecessors, (177), 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:01:56,063 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:56,063 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:56,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-19 15:01:56,270 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:56,270 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:01:56,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1750091803, now seen corresponding path program 5 times [2024-02-19 15:01:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506728184] [2024-02-19 15:01:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506728184] [2024-02-19 15:01:56,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506728184] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:01:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728355700] [2024-02-19 15:01:56,328 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:01:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:56,329 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:01:56,331 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:01:56,414 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:01:56,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:01:56,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:01:56,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:01:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:56,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:01:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:56,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728355700] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:01:56,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:01:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-02-19 15:01:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674432058] [2024-02-19 15:01:56,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:01:56,505 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 15:01:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 15:01:56,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-19 15:01:56,515 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:56,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 3213 transitions, 62027 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:01:56,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:56,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:56,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:02,630 INFO L124 PetriNetUnfolderBase]: 9265/15982 cut-off events. [2024-02-19 15:02:02,630 INFO L125 PetriNetUnfolderBase]: For 51768/51768 co-relation queries the response was YES. [2024-02-19 15:02:02,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161355 conditions, 15982 events. 9265/15982 cut-off events. For 51768/51768 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 114991 event pairs, 162 based on Foata normal form. 329/14412 useless extension candidates. Maximal degree in co-relation 82909. Up to 13428 conditions per place. [2024-02-19 15:02:02,739 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 3067 selfloop transitions, 281 changer transitions 1238/4881 dead transitions. [2024-02-19 15:02:02,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 4881 transitions, 105154 flow [2024-02-19 15:02:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:02:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:02:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-02-19 15:02:02,740 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-02-19 15:02:02,741 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 172 predicate places. [2024-02-19 15:02:02,741 INFO L507 AbstractCegarLoop]: Abstraction has has 201 places, 4881 transitions, 105154 flow [2024-02-19 15:02:02,741 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:02:02,741 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:02,741 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:02,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-19 15:02:02,956 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,SelfDestructingSolverStorable9 [2024-02-19 15:02:02,956 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:02:02,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 422035683, now seen corresponding path program 6 times [2024-02-19 15:02:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910148287] [2024-02-19 15:02:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:02:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910148287] [2024-02-19 15:02:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910148287] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378489449] [2024-02-19 15:02:03,074 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:02:03,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:03,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:03,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:02:03,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-19 15:02:03,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-19 15:02:03,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:03,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:02:03,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:02:03,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:02:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378489449] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:03,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-02-19 15:02:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444683536] [2024-02-19 15:02:03,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:03,432 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:02:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:03,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:02:03,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:02:03,483 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:02:03,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 4881 transitions, 105154 flow. Second operand has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 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:02:03,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:03,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:02:03,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:11,175 INFO L124 PetriNetUnfolderBase]: 6618/11631 cut-off events. [2024-02-19 15:02:11,175 INFO L125 PetriNetUnfolderBase]: For 53887/53887 co-relation queries the response was YES. [2024-02-19 15:02:11,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126261 conditions, 11631 events. 6618/11631 cut-off events. For 53887/53887 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 80398 event pairs, 130 based on Foata normal form. 189/10379 useless extension candidates. Maximal degree in co-relation 37535. Up to 9629 conditions per place. [2024-02-19 15:02:11,246 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1570 selfloop transitions, 3 changer transitions 1750/3451 dead transitions. [2024-02-19 15:02:11,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 3451 transitions, 79994 flow [2024-02-19 15:02:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-19 15:02:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-19 15:02:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-02-19 15:02:11,247 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2024-02-19 15:02:11,248 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 163 predicate places. [2024-02-19 15:02:11,248 INFO L507 AbstractCegarLoop]: Abstraction has has 192 places, 3451 transitions, 79994 flow [2024-02-19 15:02:11,248 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 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:02:11,248 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:11,248 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:11,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-19 15:02:11,459 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:11,460 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:11,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1302626029, now seen corresponding path program 7 times [2024-02-19 15:02:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488433534] [2024-02-19 15:02:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-19 15:02:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488433534] [2024-02-19 15:02:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488433534] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777220569] [2024-02-19 15:02:11,550 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:02:11,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:11,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:11,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:02:11,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-19 15:02:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:11,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:02:11,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-19 15:02:11,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-19 15:02:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777220569] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:11,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-19 15:02:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290793786] [2024-02-19 15:02:11,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:11,750 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:02:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:02:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:02:11,773 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:02:11,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 3451 transitions, 79994 flow. Second operand has 15 states, 15 states have (on average 9.6) internal successors, (144), 15 states have internal predecessors, (144), 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:02:11,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:11,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:02:11,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:17,069 INFO L124 PetriNetUnfolderBase]: 6348/11522 cut-off events. [2024-02-19 15:02:17,069 INFO L125 PetriNetUnfolderBase]: For 66869/66869 co-relation queries the response was YES. [2024-02-19 15:02:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133558 conditions, 11522 events. 6348/11522 cut-off events. For 66869/66869 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 82119 event pairs, 123 based on Foata normal form. 0/10271 useless extension candidates. Maximal degree in co-relation 40089. Up to 9392 conditions per place. [2024-02-19 15:02:17,152 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1222 selfloop transitions, 86 changer transitions 2444/3851 dead transitions. [2024-02-19 15:02:17,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 3851 transitions, 97083 flow [2024-02-19 15:02:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:02:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:02:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-02-19 15:02:17,153 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-19 15:02:17,153 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 171 predicate places. [2024-02-19 15:02:17,154 INFO L507 AbstractCegarLoop]: Abstraction has has 200 places, 3851 transitions, 97083 flow [2024-02-19 15:02:17,154 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.6) internal successors, (144), 15 states have internal predecessors, (144), 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:02:17,154 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:17,154 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-19 15:02:17,356 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:17,356 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:17,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash 696218693, now seen corresponding path program 8 times [2024-02-19 15:02:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49218551] [2024-02-19 15:02:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:02:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49218551] [2024-02-19 15:02:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49218551] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027727452] [2024-02-19 15:02:18,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:02:18,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:18,886 INFO L229 MonitoredProcess]: Starting monitored process 9 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:02:18,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-19 15:02:18,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:02:18,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:18,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 41 conjunts are in the unsatisfiable core [2024-02-19 15:02:18,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:19,681 INFO L349 Elim1Store]: treesize reduction 34, result has 57.0 percent of original size [2024-02-19 15:02:19,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2024-02-19 15:02:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:02:19,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:21,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:21,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 233 treesize of output 1432 [2024-02-19 15:04:57,383 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:04:57,383 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:04:57,384 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:04:57,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-19 15:04:57,585 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-02-19 15:04:57,585 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:04:57,590 INFO L158 Benchmark]: Toolchain (without parser) took 225083.73ms. Allocated memory was 71.3MB in the beginning and 3.9GB in the end (delta: 3.9GB). Free memory was 41.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-02-19 15:04:57,590 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 27.7MB in the beginning and 27.6MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:04:57,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.79ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 46.7MB in the end (delta: -5.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-02-19 15:04:57,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 71.3MB. Free memory was 46.7MB in the beginning and 44.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:04:57,590 INFO L158 Benchmark]: Boogie Preprocessor took 47.44ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 41.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-19 15:04:57,591 INFO L158 Benchmark]: RCFGBuilder took 730.03ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 41.7MB in the beginning and 60.8MB in the end (delta: -19.1MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-02-19 15:04:57,591 INFO L158 Benchmark]: TraceAbstraction took 224059.66ms. Allocated memory was 94.4MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 60.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-02-19 15:04:57,592 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 27.7MB in the beginning and 27.6MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.79ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 46.7MB in the end (delta: -5.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.72ms. Allocated memory is still 71.3MB. Free memory was 46.7MB in the beginning and 44.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.44ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 41.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 730.03ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 41.7MB in the beginning and 60.8MB in the end (delta: -19.1MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 224059.66ms. Allocated memory was 94.4MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 60.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.9GB. 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/popl20-more-dec-subseq.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 ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --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:04:59,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:04:59,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:04:59,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:04:59,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:04:59,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:04:59,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:04:59,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:04:59,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:04:59,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:04:59,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:04:59,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:04:59,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:04:59,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:04:59,601 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:04:59,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:04:59,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:04:59,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:04:59,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:04:59,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:04:59,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:04:59,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:04:59,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:04:59,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:04:59,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:04:59,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:04:59,604 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:04:59,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:04:59,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:04:59,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:04:59,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:04:59,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:04:59,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:04:59,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:04:59,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:04:59,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:04:59,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:04:59,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:04:59,607 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:04:59,607 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:04:59,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:04:59,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:04:59,608 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:04:59,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:04:59,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:04:59,608 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:04:59,609 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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:04:59,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:04:59,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:04:59,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:04:59,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:04:59,864 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:04:59,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-19 15:05:00,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:05:01,066 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:05:01,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-19 15:05:01,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0360c85ce/844b51d128914f8381e7f5ac2270eaee/FLAG6199e8a80 [2024-02-19 15:05:01,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0360c85ce/844b51d128914f8381e7f5ac2270eaee [2024-02-19 15:05:01,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:05:01,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:05:01,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:05:01,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:05:01,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:05:01,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669ea519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01, skipping insertion in model container [2024-02-19 15:05:01,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,106 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:05:01,282 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/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-19 15:05:01,297 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:01,312 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:05:01,319 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:05:01,342 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/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-19 15:05:01,348 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:01,353 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:05:01,378 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/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-19 15:05:01,382 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:01,400 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:05:01,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01 WrapperNode [2024-02-19 15:05:01,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:05:01,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:05:01,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:05:01,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:05:01,409 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:05:01" (1/1) ... [2024-02-19 15:05:01,426 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:05:01" (1/1) ... [2024-02-19 15:05:01,456 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 192 [2024-02-19 15:05:01,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:05:01,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:05:01,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:05:01,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:05:01,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,500 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 8, 2, 2]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2024-02-19 15:05:01,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:05:01,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:05:01,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:05:01,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:05:01,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (1/1) ... [2024-02-19 15:05:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:05:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:01,544 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:05:01,560 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:05:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:05:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:05:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:05:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:05:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:05:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:05:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:05:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:05:01,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:05:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:05:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:05:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:05:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:05:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:05:01,582 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:05:01,689 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:05:01,691 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:05:02,021 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:05:02,021 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:05:02,303 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:05:02,303 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:05:02,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:05:02 BoogieIcfgContainer [2024-02-19 15:05:02,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:05:02,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:05:02,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:05:02,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:05:02,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:05:01" (1/3) ... [2024-02-19 15:05:02,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411d6d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:05:02, skipping insertion in model container [2024-02-19 15:05:02,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:01" (2/3) ... [2024-02-19 15:05:02,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411d6d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:05:02, skipping insertion in model container [2024-02-19 15:05:02,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:05:02" (3/3) ... [2024-02-19 15:05:02,311 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-02-19 15:05:02,323 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:05:02,324 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:05:02,324 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:05:02,354 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:05:02,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:05:02,403 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-02-19 15:05:02,403 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:05:02,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 5/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-02-19 15:05:02,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:05:02,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 27 transitions, 66 flow [2024-02-19 15:05:02,421 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:05:02,426 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;@40598a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:05:02,426 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:05:02,437 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:05:02,437 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-02-19 15:05:02,437 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:05:02,438 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:02,438 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:02,439 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:05:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1288847665, now seen corresponding path program 1 times [2024-02-19 15:05:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714119457] [2024-02-19 15:05:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:02,453 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:05:02,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:02,454 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:05:02,475 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:05:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:02,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-19 15:05:02,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:02,585 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:05:02,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:02,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:02,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714119457] [2024-02-19 15:05:02,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714119457] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:02,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:02,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:05:02,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910427646] [2024-02-19 15:05:02,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:02,593 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:05:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:02,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:05:02,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:05:02,613 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:02,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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:05:02,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:02,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:02,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:02,735 INFO L124 PetriNetUnfolderBase]: 149/290 cut-off events. [2024-02-19 15:05:02,735 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-02-19 15:05:02,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 290 events. 149/290 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1072 event pairs, 51 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 482. Up to 127 conditions per place. [2024-02-19 15:05:02,740 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-02-19 15:05:02,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 174 flow [2024-02-19 15:05:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:05:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:05:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-19 15:05:02,749 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-02-19 15:05:02,752 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-02-19 15:05:02,752 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 41 transitions, 174 flow [2024-02-19 15:05:02,752 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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:05:02,752 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:02,752 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:02,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-02-19 15:05:02,955 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:05:02,955 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:05:02,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2006503072, now seen corresponding path program 1 times [2024-02-19 15:05:02,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479524765] [2024-02-19 15:05:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:02,957 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:05:02,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:02,958 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:05:02,984 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:05:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:03,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:05:03,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:03,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:03,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:03,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479524765] [2024-02-19 15:05:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479524765] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:03,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:03,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:05:03,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767672977] [2024-02-19 15:05:03,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:03,111 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:05:03,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:05:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:05:03,121 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:05:03,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 41 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:03,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:03,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:05:03,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:03,350 INFO L124 PetriNetUnfolderBase]: 316/538 cut-off events. [2024-02-19 15:05:03,353 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-02-19 15:05:03,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 538 events. 316/538 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1820 event pairs, 41 based on Foata normal form. 16/488 useless extension candidates. Maximal degree in co-relation 1361. Up to 323 conditions per place. [2024-02-19 15:05:03,360 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 55 selfloop transitions, 3 changer transitions 34/93 dead transitions. [2024-02-19 15:05:03,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 579 flow [2024-02-19 15:05:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:05:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:05:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-02-19 15:05:03,363 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-02-19 15:05:03,364 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2024-02-19 15:05:03,364 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 93 transitions, 579 flow [2024-02-19 15:05:03,364 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:03,364 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:03,364 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:03,369 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:05:03,568 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:05:03,568 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:05:03,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash 892026424, now seen corresponding path program 1 times [2024-02-19 15:05:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:03,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460764319] [2024-02-19 15:05:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:03,570 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:05:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:03,571 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:05:03,576 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:05:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:03,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:05:03,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:03,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:03,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460764319] [2024-02-19 15:05:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460764319] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:05:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167094760] [2024-02-19 15:05:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:03,709 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:05:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:05:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:05:03,710 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:03,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 93 transitions, 579 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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:05:03,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:03,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:03,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:03,877 INFO L124 PetriNetUnfolderBase]: 387/675 cut-off events. [2024-02-19 15:05:03,877 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2024-02-19 15:05:03,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 675 events. 387/675 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2538 event pairs, 70 based on Foata normal form. 10/597 useless extension candidates. Maximal degree in co-relation 1762. Up to 458 conditions per place. [2024-02-19 15:05:03,880 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 52 selfloop transitions, 2 changer transitions 64/124 dead transitions. [2024-02-19 15:05:03,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 124 transitions, 1015 flow [2024-02-19 15:05:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:05:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:05:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-19 15:05:03,883 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-19 15:05:03,883 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2024-02-19 15:05:03,884 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 124 transitions, 1015 flow [2024-02-19 15:05:03,884 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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:05:03,884 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:03,884 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:03,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:05:04,091 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:05:04,092 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:05:04,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:04,093 INFO L85 PathProgramCache]: Analyzing trace with hash 831084334, now seen corresponding path program 1 times [2024-02-19 15:05:04,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:04,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499147286] [2024-02-19 15:05:04,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:04,094 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:05:04,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:04,095 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:05:04,098 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:05:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:04,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:04,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:05:04,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:04,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499147286] [2024-02-19 15:05:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499147286] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:04,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:04,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:05:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295272544] [2024-02-19 15:05:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:04,271 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:05:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:05:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:05:04,278 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:04,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 124 transitions, 1015 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:04,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:04,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:04,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:04,473 INFO L124 PetriNetUnfolderBase]: 599/1059 cut-off events. [2024-02-19 15:05:04,473 INFO L125 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2024-02-19 15:05:04,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1059 events. 599/1059 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4724 event pairs, 94 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 3224. Up to 676 conditions per place. [2024-02-19 15:05:04,478 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 72 selfloop transitions, 7 changer transitions 115/200 dead transitions. [2024-02-19 15:05:04,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 200 transitions, 2040 flow [2024-02-19 15:05:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:05:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:05:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-19 15:05:04,479 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-19 15:05:04,480 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-02-19 15:05:04,496 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 200 transitions, 2040 flow [2024-02-19 15:05:04,496 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:04,496 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:04,496 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:04,516 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:05:04,696 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:05:04,697 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:05:04,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1104953238, now seen corresponding path program 1 times [2024-02-19 15:05:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603698670] [2024-02-19 15:05:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:04,698 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:05:04,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:04,699 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:05:04,701 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:05:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:04,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:05:04,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:05,517 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-02-19 15:05:05,518 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 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 286 [2024-02-19 15:05:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:05:05,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:23,244 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 394 DAG size of output: 346 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-19 15:05:23,248 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-02-19 15:05:23,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 269 treesize of output 1571 [2024-02-19 15:05:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:05:29,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603698670] [2024-02-19 15:05:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603698670] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:29,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:05:29,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-02-19 15:05:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770270785] [2024-02-19 15:05:29,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:29,240 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:05:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:05:29,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-02-19 15:05:33,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:05:35,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:05:39,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:05:39,556 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2024-02-19 15:05:39,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 200 transitions, 2040 flow. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 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:05:39,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:39,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2024-02-19 15:05:39,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:45,221 INFO L124 PetriNetUnfolderBase]: 739/1290 cut-off events. [2024-02-19 15:05:45,221 INFO L125 PetriNetUnfolderBase]: For 1755/1755 co-relation queries the response was YES. [2024-02-19 15:05:45,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 1290 events. 739/1290 cut-off events. For 1755/1755 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5672 event pairs, 54 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 5020. Up to 864 conditions per place. [2024-02-19 15:05:45,235 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 124 selfloop transitions, 16 changer transitions 159/302 dead transitions. [2024-02-19 15:05:45,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 302 transitions, 3677 flow [2024-02-19 15:05:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:05:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:05:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-02-19 15:05:45,249 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-02-19 15:05:45,249 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-02-19 15:05:45,249 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 302 transitions, 3677 flow [2024-02-19 15:05:45,250 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 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:05:45,250 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:45,250 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:45,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-02-19 15:05:45,452 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:05:45,452 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:05:45,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1026207875, now seen corresponding path program 2 times [2024-02-19 15:05:45,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:45,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405686154] [2024-02-19 15:05:45,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:05:45,453 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:05:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:45,455 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:05:45,459 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:05:45,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:05:45,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:45,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:45,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:05:46,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:05:48,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:48,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405686154] [2024-02-19 15:05:48,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405686154] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:48,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:05:48,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-02-19 15:05:48,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566607437] [2024-02-19 15:05:48,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:48,424 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 15:05:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:48,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 15:05:48,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-02-19 15:05:48,627 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:48,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 302 transitions, 3677 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:05:48,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:48,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:48,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:50,740 INFO L124 PetriNetUnfolderBase]: 1141/2002 cut-off events. [2024-02-19 15:05:50,741 INFO L125 PetriNetUnfolderBase]: For 4022/4022 co-relation queries the response was YES. [2024-02-19 15:05:50,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12722 conditions, 2002 events. 1141/2002 cut-off events. For 4022/4022 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9978 event pairs, 81 based on Foata normal form. 28/1800 useless extension candidates. Maximal degree in co-relation 5794. Up to 1456 conditions per place. [2024-02-19 15:05:50,752 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 130 selfloop transitions, 5 changer transitions 316/460 dead transitions. [2024-02-19 15:05:50,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 460 transitions, 6543 flow [2024-02-19 15:05:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:05:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:05:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-02-19 15:05:50,754 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2024-02-19 15:05:50,754 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-02-19 15:05:50,754 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 460 transitions, 6543 flow [2024-02-19 15:05:50,755 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:05:50,758 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:50,758 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:50,769 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:05:50,969 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:05:50,969 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:05:50,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash -587233457, now seen corresponding path program 3 times [2024-02-19 15:05:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:50,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453352760] [2024-02-19 15:05:50,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:05:50,971 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:05:50,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:50,972 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:05:50,977 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:05:51,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:05:51,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:05:51,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:05:51,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:05:53,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:05:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:05:56,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453352760] [2024-02-19 15:05:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453352760] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:05:56,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:05:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-02-19 15:05:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133634237] [2024-02-19 15:05:56,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:05:56,026 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:05:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:05:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:05:56,793 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:56,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 460 transitions, 6543 flow. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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:05:56,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:56,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:56,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:00,825 INFO L124 PetriNetUnfolderBase]: 2619/4536 cut-off events. [2024-02-19 15:06:00,826 INFO L125 PetriNetUnfolderBase]: For 10894/10894 co-relation queries the response was YES. [2024-02-19 15:06:00,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32635 conditions, 4536 events. 2619/4536 cut-off events. For 10894/10894 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 24328 event pairs, 220 based on Foata normal form. 64/4072 useless extension candidates. Maximal degree in co-relation 12124. Up to 3594 conditions per place. [2024-02-19 15:06:00,850 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 365 selfloop transitions, 39 changer transitions 517/930 dead transitions. [2024-02-19 15:06:00,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 930 transitions, 15153 flow [2024-02-19 15:06:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:06:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:06:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-02-19 15:06:00,852 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-02-19 15:06:00,853 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-02-19 15:06:00,853 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 930 transitions, 15153 flow [2024-02-19 15:06:00,853 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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:06:00,853 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:00,853 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:00,860 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 (8)] Ended with exit code 0 [2024-02-19 15:06:01,057 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:06:01,058 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:06:01,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash -926767955, now seen corresponding path program 4 times [2024-02-19 15:06:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:06:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455320096] [2024-02-19 15:06:01,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:06:01,059 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:06:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:06:01,060 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:06:01,062 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:06:01,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:06:01,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:01,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:06:01,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:06:02,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:06:03,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:06:03,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455320096] [2024-02-19 15:06:03,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455320096] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:03,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:06:03,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2024-02-19 15:06:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043379607] [2024-02-19 15:06:03,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:03,873 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:06:03,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:06:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:06:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:06:04,551 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:06:04,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 930 transitions, 15153 flow. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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:06:04,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:04,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:06:04,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:08,680 INFO L124 PetriNetUnfolderBase]: 4102/7171 cut-off events. [2024-02-19 15:06:08,680 INFO L125 PetriNetUnfolderBase]: For 21860/21860 co-relation queries the response was YES. [2024-02-19 15:06:08,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57377 conditions, 7171 events. 4102/7171 cut-off events. For 21860/21860 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 43293 event pairs, 360 based on Foata normal form. 0/6539 useless extension candidates. Maximal degree in co-relation 18216. Up to 5618 conditions per place. [2024-02-19 15:06:08,722 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 546 selfloop transitions, 121 changer transitions 1073/1749 dead transitions. [2024-02-19 15:06:08,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 1749 transitions, 31967 flow [2024-02-19 15:06:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:06:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:06:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2024-02-19 15:06:08,725 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-02-19 15:06:08,727 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-02-19 15:06:08,727 INFO L507 AbstractCegarLoop]: Abstraction has has 78 places, 1749 transitions, 31967 flow [2024-02-19 15:06:08,727 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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:06:08,728 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:08,728 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:08,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-02-19 15:06:08,932 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:06:08,933 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:06:08,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2069386453, now seen corresponding path program 5 times [2024-02-19 15:06:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:06:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469400292] [2024-02-19 15:06:08,934 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:06:08,934 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:06:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:06:08,936 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:06:08,940 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:06:09,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-02-19 15:06:09,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:09,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjunts are in the unsatisfiable core [2024-02-19 15:06:09,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:16,064 INFO L349 Elim1Store]: treesize reduction 1032, result has 14.1 percent of original size [2024-02-19 15:06:16,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 280 treesize of output 232 [2024-02-19 15:06:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 15:06:21,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:07:52,580 WARN L293 SmtUtils]: Spent 30.04s on a formula simplification. DAG size of input: 779 DAG size of output: 513 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-19 15:07:52,580 INFO L349 Elim1Store]: treesize reduction 1085, result has 70.2 percent of original size [2024-02-19 15:07:52,581 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 24 new quantified variables, introduced 276 case distinctions, treesize of input 346 treesize of output 2619 Killed by 15