./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/pthread/triangular-longest-2.i -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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:07:20,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:07:20,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:07:20,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:07:20,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:07:20,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:07:20,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:07:20,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:07:20,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:07:20,919 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:07:20,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:07:20,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:07:20,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:07:20,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:07:20,926 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:07:20,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:07:20,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:07:20,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:07:20,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:07:20,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:07:20,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:07:20,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:07:20,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:07:20,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:07:20,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:07:20,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:07:20,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:07:20,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:07:20,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:07:20,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:07:20,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:07:20,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:07:20,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:20,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:07:20,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:07:20,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:07:20,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:07:20,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:07:20,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:07:20,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:07:20,935 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:07:20,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:07:20,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:07:20,935 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2024-01-27 16:07:21,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:07:21,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:07:21,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:07:21,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:07:21,168 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:07:21,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-01-27 16:07:22,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:07:22,405 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:07:22,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-01-27 16:07:22,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040275d4c/0c91dfa127614bef996a302b547f1928/FLAG0869fd832 [2024-01-27 16:07:22,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040275d4c/0c91dfa127614bef996a302b547f1928 [2024-01-27 16:07:22,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:07:22,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:07:22,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:22,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:07:22,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:07:22,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3bb968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22, skipping insertion in model container [2024-01-27 16:07:22,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,506 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:07:22,753 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-01-27 16:07:22,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:22,771 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:07:22,813 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-01-27 16:07:22,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:22,848 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:07:22,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22 WrapperNode [2024-01-27 16:07:22,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:22,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:22,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:07:22,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:07:22,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,894 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-01-27 16:07:22,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:22,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:07:22,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:07:22,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:07:22,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,915 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-27 16:07:22,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:07:22,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:07:22,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:07:22,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:07:22,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (1/1) ... [2024-01-27 16:07:22,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:22,951 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-01-27 16:07:22,953 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-01-27 16:07:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:07:22,994 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:07:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:07:22,994 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:07:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:07:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:07:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:07:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:07:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:07:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:07:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:07:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:07:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:07:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:07:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:07:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:07:22,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:07:22,997 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:07:23,090 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:07:23,092 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:07:23,202 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:07:23,202 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:07:23,273 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:07:23,273 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:07:23,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:23 BoogieIcfgContainer [2024-01-27 16:07:23,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:07:23,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:07:23,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:07:23,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:07:23,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:07:22" (1/3) ... [2024-01-27 16:07:23,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b220b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:23, skipping insertion in model container [2024-01-27 16:07:23,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:22" (2/3) ... [2024-01-27 16:07:23,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b220b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:23, skipping insertion in model container [2024-01-27 16:07:23,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:23" (3/3) ... [2024-01-27 16:07:23,290 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-01-27 16:07:23,299 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:07:23,307 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:07:23,307 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:07:23,307 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:07:23,343 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:07:23,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-01-27 16:07:23,384 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-01-27 16:07:23,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:07:23,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-01-27 16:07:23,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-01-27 16:07:23,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-01-27 16:07:23,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:07:23,401 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b94e983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:07:23,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 16:07:23,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:07:23,407 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-01-27 16:07:23,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:07:23,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:23,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:23,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:23,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1796875976, now seen corresponding path program 1 times [2024-01-27 16:07:23,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:23,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975656744] [2024-01-27 16:07:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:23,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:23,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975656744] [2024-01-27 16:07:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975656744] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:23,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:07:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832534136] [2024-01-27 16:07:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:23,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:07:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:07:23,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:07:23,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:23,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 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-01-27 16:07:23,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:23,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:23,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:24,101 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-01-27 16:07:24,101 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:07:24,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 543 events. 321/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2187 event pairs, 62 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 1045. Up to 221 conditions per place. [2024-01-27 16:07:24,109 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-01-27 16:07:24,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-01-27 16:07:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:07:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:07:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-01-27 16:07:24,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:07:24,120 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2024-01-27 16:07:24,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2024-01-27 16:07:24,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:24,124 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2024-01-27 16:07:24,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2024-01-27 16:07:24,128 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2024-01-27 16:07:24,129 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2024-01-27 16:07:24,129 INFO L496 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-01-27 16:07:24,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:24,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:07:24,129 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:24,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash 676521124, now seen corresponding path program 1 times [2024-01-27 16:07:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270208735] [2024-01-27 16:07:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:24,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:24,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270208735] [2024-01-27 16:07:24,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270208735] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:24,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:24,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:07:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496294303] [2024-01-27 16:07:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:24,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:24,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:24,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:24,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-27 16:07:24,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:24,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:24,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:24,483 INFO L124 PetriNetUnfolderBase]: 382/689 cut-off events. [2024-01-27 16:07:24,483 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2024-01-27 16:07:24,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 689 events. 382/689 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2926 event pairs, 65 based on Foata normal form. 33/721 useless extension candidates. Maximal degree in co-relation 1572. Up to 246 conditions per place. [2024-01-27 16:07:24,517 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2024-01-27 16:07:24,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2024-01-27 16:07:24,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:07:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:07:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-01-27 16:07:24,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-01-27 16:07:24,521 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2024-01-27 16:07:24,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2024-01-27 16:07:24,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:24,525 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2024-01-27 16:07:24,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-01-27 16:07:24,526 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2024-01-27 16:07:24,526 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2024-01-27 16:07:24,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-27 16:07:24,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:24,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:24,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:07:24,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:24,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:24,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1193097064, now seen corresponding path program 2 times [2024-01-27 16:07:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420217276] [2024-01-27 16:07:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:24,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420217276] [2024-01-27 16:07:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420217276] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:24,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:07:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194310818] [2024-01-27 16:07:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:24,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:07:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:24,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:07:24,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:07:24,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:24,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-27 16:07:24,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:24,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:24,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:24,812 INFO L124 PetriNetUnfolderBase]: 328/605 cut-off events. [2024-01-27 16:07:24,813 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2024-01-27 16:07:24,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 605 events. 328/605 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2534 event pairs, 65 based on Foata normal form. 57/661 useless extension candidates. Maximal degree in co-relation 1713. Up to 234 conditions per place. [2024-01-27 16:07:24,816 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2024-01-27 16:07:24,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2024-01-27 16:07:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:07:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:07:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-01-27 16:07:24,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-01-27 16:07:24,822 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2024-01-27 16:07:24,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2024-01-27 16:07:24,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:24,831 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2024-01-27 16:07:24,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2024-01-27 16:07:24,833 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-01-27 16:07:24,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2024-01-27 16:07:24,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-01-27 16:07:24,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:24,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:24,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:07:24,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:24,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash -330137667, now seen corresponding path program 1 times [2024-01-27 16:07:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82026732] [2024-01-27 16:07:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82026732] [2024-01-27 16:07:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82026732] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:24,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:24,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:24,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117902384] [2024-01-27 16:07:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:24,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:07:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:07:24,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:07:24,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:24,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:24,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:24,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:24,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:25,159 INFO L124 PetriNetUnfolderBase]: 337/617 cut-off events. [2024-01-27 16:07:25,160 INFO L125 PetriNetUnfolderBase]: For 1712/1724 co-relation queries the response was YES. [2024-01-27 16:07:25,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 617 events. 337/617 cut-off events. For 1712/1724 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2601 event pairs, 68 based on Foata normal form. 30/646 useless extension candidates. Maximal degree in co-relation 1916. Up to 237 conditions per place. [2024-01-27 16:07:25,163 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2024-01-27 16:07:25,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2024-01-27 16:07:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:07:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:07:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-01-27 16:07:25,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-01-27 16:07:25,165 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2024-01-27 16:07:25,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2024-01-27 16:07:25,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-01-27 16:07:25,169 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2024-01-27 16:07:25,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2024-01-27 16:07:25,170 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2024-01-27 16:07:25,170 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2024-01-27 16:07:25,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:25,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:25,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:25,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:07:25,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:25,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash 350538865, now seen corresponding path program 2 times [2024-01-27 16:07:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:25,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799749493] [2024-01-27 16:07:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799749493] [2024-01-27 16:07:25,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799749493] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:25,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137047932] [2024-01-27 16:07:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:25,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:07:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:07:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:07:25,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:25,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:25,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:25,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:25,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:25,446 INFO L124 PetriNetUnfolderBase]: 508/929 cut-off events. [2024-01-27 16:07:25,447 INFO L125 PetriNetUnfolderBase]: For 3237/3255 co-relation queries the response was YES. [2024-01-27 16:07:25,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 929 events. 508/929 cut-off events. For 3237/3255 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4215 event pairs, 53 based on Foata normal form. 45/971 useless extension candidates. Maximal degree in co-relation 3046. Up to 253 conditions per place. [2024-01-27 16:07:25,451 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 57 selfloop transitions, 20 changer transitions 23/103 dead transitions. [2024-01-27 16:07:25,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 771 flow [2024-01-27 16:07:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:07:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:07:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-01-27 16:07:25,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-01-27 16:07:25,453 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 141 transitions. [2024-01-27 16:07:25,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 771 flow [2024-01-27 16:07:25,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 705 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-01-27 16:07:25,459 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 376 flow [2024-01-27 16:07:25,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2024-01-27 16:07:25,460 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2024-01-27 16:07:25,460 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 376 flow [2024-01-27 16:07:25,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:25,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:25,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:25,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:07:25,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:25,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1387768189, now seen corresponding path program 3 times [2024-01-27 16:07:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353104263] [2024-01-27 16:07:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:25,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353104263] [2024-01-27 16:07:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353104263] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:07:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578041644] [2024-01-27 16:07:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:25,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:07:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:25,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:07:25,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:07:25,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:25,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:25,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:25,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:25,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:25,737 INFO L124 PetriNetUnfolderBase]: 481/884 cut-off events. [2024-01-27 16:07:25,737 INFO L125 PetriNetUnfolderBase]: For 5184/5202 co-relation queries the response was YES. [2024-01-27 16:07:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3384 conditions, 884 events. 481/884 cut-off events. For 5184/5202 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4004 event pairs, 59 based on Foata normal form. 63/944 useless extension candidates. Maximal degree in co-relation 3352. Up to 154 conditions per place. [2024-01-27 16:07:25,742 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 25 changer transitions 33/106 dead transitions. [2024-01-27 16:07:25,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 964 flow [2024-01-27 16:07:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:07:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:07:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-01-27 16:07:25,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-01-27 16:07:25,744 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 376 flow. Second operand 11 states and 138 transitions. [2024-01-27 16:07:25,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 964 flow [2024-01-27 16:07:25,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 893 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-01-27 16:07:25,752 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 475 flow [2024-01-27 16:07:25,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2024-01-27 16:07:25,753 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 47 predicate places. [2024-01-27 16:07:25,753 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 475 flow [2024-01-27 16:07:25,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:25,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:25,754 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:25,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:07:25,754 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:25,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash 200573649, now seen corresponding path program 1 times [2024-01-27 16:07:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272462024] [2024-01-27 16:07:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272462024] [2024-01-27 16:07:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272462024] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:25,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639806972] [2024-01-27 16:07:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:25,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:25,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:25,845 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-01-27 16:07:25,868 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-01-27 16:07:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:25,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 16:07:25,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:26,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639806972] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:26,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:26,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-01-27 16:07:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237870851] [2024-01-27 16:07:26,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 16:07:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 16:07:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-01-27 16:07:26,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:26,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 475 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-01-27 16:07:26,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:26,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:26,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:26,467 INFO L124 PetriNetUnfolderBase]: 589/1094 cut-off events. [2024-01-27 16:07:26,467 INFO L125 PetriNetUnfolderBase]: For 10490/10508 co-relation queries the response was YES. [2024-01-27 16:07:26,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4735 conditions, 1094 events. 589/1094 cut-off events. For 10490/10508 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4676 event pairs, 149 based on Foata normal form. 81/1174 useless extension candidates. Maximal degree in co-relation 4699. Up to 522 conditions per place. [2024-01-27 16:07:26,473 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 67 selfloop transitions, 17 changer transitions 67/154 dead transitions. [2024-01-27 16:07:26,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 154 transitions, 1547 flow [2024-01-27 16:07:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 16:07:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 16:07:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2024-01-27 16:07:26,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2024-01-27 16:07:26,477 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 475 flow. Second operand 19 states and 231 transitions. [2024-01-27 16:07:26,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 154 transitions, 1547 flow [2024-01-27 16:07:26,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 154 transitions, 1448 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-01-27 16:07:26,487 INFO L231 Difference]: Finished difference. Result has 93 places, 54 transitions, 604 flow [2024-01-27 16:07:26,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=604, PETRI_PLACES=93, PETRI_TRANSITIONS=54} [2024-01-27 16:07:26,488 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 67 predicate places. [2024-01-27 16:07:26,488 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 54 transitions, 604 flow [2024-01-27 16:07:26,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-01-27 16:07:26,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:26,488 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:26,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:26,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:26,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:26,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1017903249, now seen corresponding path program 2 times [2024-01-27 16:07:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:26,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880857024] [2024-01-27 16:07:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:26,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:26,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880857024] [2024-01-27 16:07:26,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880857024] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:26,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575941096] [2024-01-27 16:07:26,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:07:26,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:26,793 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-01-27 16:07:26,817 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-01-27 16:07:26,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:07:26,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:26,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 16:07:26,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:26,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:26,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575941096] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:26,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:26,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-01-27 16:07:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008126023] [2024-01-27 16:07:26,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:26,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 16:07:26,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 16:07:26,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-01-27 16:07:26,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:26,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 54 transitions, 604 flow. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:26,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:26,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:26,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:27,461 INFO L124 PetriNetUnfolderBase]: 877/1613 cut-off events. [2024-01-27 16:07:27,462 INFO L125 PetriNetUnfolderBase]: For 36575/36593 co-relation queries the response was YES. [2024-01-27 16:07:27,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9220 conditions, 1613 events. 877/1613 cut-off events. For 36575/36593 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7694 event pairs, 68 based on Foata normal form. 90/1702 useless extension candidates. Maximal degree in co-relation 9174. Up to 312 conditions per place. [2024-01-27 16:07:27,501 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 88 selfloop transitions, 47 changer transitions 80/218 dead transitions. [2024-01-27 16:07:27,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 218 transitions, 2806 flow [2024-01-27 16:07:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-01-27 16:07:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-01-27 16:07:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 334 transitions. [2024-01-27 16:07:27,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-01-27 16:07:27,503 INFO L175 Difference]: Start difference. First operand has 93 places, 54 transitions, 604 flow. Second operand 27 states and 334 transitions. [2024-01-27 16:07:27,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 218 transitions, 2806 flow [2024-01-27 16:07:27,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 218 transitions, 2262 flow, removed 261 selfloop flow, removed 12 redundant places. [2024-01-27 16:07:27,524 INFO L231 Difference]: Finished difference. Result has 119 places, 70 transitions, 1007 flow [2024-01-27 16:07:27,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1007, PETRI_PLACES=119, PETRI_TRANSITIONS=70} [2024-01-27 16:07:27,525 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 93 predicate places. [2024-01-27 16:07:27,525 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 70 transitions, 1007 flow [2024-01-27 16:07:27,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:27,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:27,525 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:27,538 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-01-27 16:07:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-01-27 16:07:27,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:27,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash -783274912, now seen corresponding path program 1 times [2024-01-27 16:07:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444829037] [2024-01-27 16:07:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:27,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444829037] [2024-01-27 16:07:27,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444829037] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479355613] [2024-01-27 16:07:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:27,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:27,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:27,823 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-01-27 16:07:27,825 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-01-27 16:07:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:27,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 16:07:27,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:27,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479355613] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:28,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:28,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-01-27 16:07:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867108736] [2024-01-27 16:07:28,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:28,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 16:07:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 16:07:28,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-01-27 16:07:28,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:28,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 70 transitions, 1007 flow. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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-01-27 16:07:28,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:28,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:28,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:28,571 INFO L124 PetriNetUnfolderBase]: 1111/2082 cut-off events. [2024-01-27 16:07:28,571 INFO L125 PetriNetUnfolderBase]: For 86453/86459 co-relation queries the response was YES. [2024-01-27 16:07:28,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14592 conditions, 2082 events. 1111/2082 cut-off events. For 86453/86459 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10761 event pairs, 153 based on Foata normal form. 69/2148 useless extension candidates. Maximal degree in co-relation 14534. Up to 490 conditions per place. [2024-01-27 16:07:28,588 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 99 selfloop transitions, 51 changer transitions 67/220 dead transitions. [2024-01-27 16:07:28,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 220 transitions, 3619 flow [2024-01-27 16:07:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-27 16:07:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-01-27 16:07:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 309 transitions. [2024-01-27 16:07:28,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-01-27 16:07:28,590 INFO L175 Difference]: Start difference. First operand has 119 places, 70 transitions, 1007 flow. Second operand 25 states and 309 transitions. [2024-01-27 16:07:28,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 220 transitions, 3619 flow [2024-01-27 16:07:28,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 220 transitions, 3039 flow, removed 274 selfloop flow, removed 15 redundant places. [2024-01-27 16:07:28,645 INFO L231 Difference]: Finished difference. Result has 135 places, 81 transitions, 1293 flow [2024-01-27 16:07:28,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1293, PETRI_PLACES=135, PETRI_TRANSITIONS=81} [2024-01-27 16:07:28,645 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 109 predicate places. [2024-01-27 16:07:28,646 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 81 transitions, 1293 flow [2024-01-27 16:07:28,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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-01-27 16:07:28,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:28,646 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:28,657 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-01-27 16:07:28,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:28,857 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:28,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1082973550, now seen corresponding path program 2 times [2024-01-27 16:07:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685081153] [2024-01-27 16:07:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:28,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685081153] [2024-01-27 16:07:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685081153] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53996635] [2024-01-27 16:07:28,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:07:28,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:28,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:28,938 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-01-27 16:07:28,972 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-01-27 16:07:29,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:07:29,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:29,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 16:07:29,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:29,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:29,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53996635] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:29,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:29,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-01-27 16:07:29,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304443560] [2024-01-27 16:07:29,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:29,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 16:07:29,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 16:07:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-01-27 16:07:29,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:29,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 81 transitions, 1293 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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-01-27 16:07:29,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:29,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:29,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:29,795 INFO L124 PetriNetUnfolderBase]: 1228/2335 cut-off events. [2024-01-27 16:07:29,796 INFO L125 PetriNetUnfolderBase]: For 138016/138022 co-relation queries the response was YES. [2024-01-27 16:07:29,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17618 conditions, 2335 events. 1228/2335 cut-off events. For 138016/138022 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12358 event pairs, 38 based on Foata normal form. 141/2475 useless extension candidates. Maximal degree in co-relation 17553. Up to 498 conditions per place. [2024-01-27 16:07:29,820 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 92 selfloop transitions, 78 changer transitions 102/275 dead transitions. [2024-01-27 16:07:29,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 275 transitions, 5195 flow [2024-01-27 16:07:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-01-27 16:07:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-01-27 16:07:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 369 transitions. [2024-01-27 16:07:29,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-01-27 16:07:29,823 INFO L175 Difference]: Start difference. First operand has 135 places, 81 transitions, 1293 flow. Second operand 30 states and 369 transitions. [2024-01-27 16:07:29,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 275 transitions, 5195 flow [2024-01-27 16:07:29,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 275 transitions, 4432 flow, removed 348 selfloop flow, removed 18 redundant places. [2024-01-27 16:07:29,942 INFO L231 Difference]: Finished difference. Result has 158 places, 102 transitions, 1932 flow [2024-01-27 16:07:29,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1932, PETRI_PLACES=158, PETRI_TRANSITIONS=102} [2024-01-27 16:07:29,943 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 132 predicate places. [2024-01-27 16:07:29,944 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 102 transitions, 1932 flow [2024-01-27 16:07:29,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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-01-27 16:07:29,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:29,944 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:29,988 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-01-27 16:07:30,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:30,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:30,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash 628730026, now seen corresponding path program 3 times [2024-01-27 16:07:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969501263] [2024-01-27 16:07:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:30,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:30,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969501263] [2024-01-27 16:07:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969501263] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445400114] [2024-01-27 16:07:30,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:07:30,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:30,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:30,292 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-01-27 16:07:30,308 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-01-27 16:07:30,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-27 16:07:30,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:30,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 16:07:30,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:30,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445400114] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:30,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2024-01-27 16:07:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459132031] [2024-01-27 16:07:30,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-27 16:07:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-27 16:07:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2024-01-27 16:07:30,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:30,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 102 transitions, 1932 flow. Second operand has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 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-01-27 16:07:30,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:30,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:30,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:31,668 INFO L124 PetriNetUnfolderBase]: 1696/3129 cut-off events. [2024-01-27 16:07:31,668 INFO L125 PetriNetUnfolderBase]: For 259059/259065 co-relation queries the response was YES. [2024-01-27 16:07:31,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27310 conditions, 3129 events. 1696/3129 cut-off events. For 259059/259065 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 15645 event pairs, 42 based on Foata normal form. 96/3224 useless extension candidates. Maximal degree in co-relation 27235. Up to 675 conditions per place. [2024-01-27 16:07:31,698 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 142 selfloop transitions, 112 changer transitions 135/392 dead transitions. [2024-01-27 16:07:31,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 392 transitions, 8378 flow [2024-01-27 16:07:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-01-27 16:07:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-01-27 16:07:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 565 transitions. [2024-01-27 16:07:31,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117753623188406 [2024-01-27 16:07:31,701 INFO L175 Difference]: Start difference. First operand has 158 places, 102 transitions, 1932 flow. Second operand 46 states and 565 transitions. [2024-01-27 16:07:31,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 392 transitions, 8378 flow [2024-01-27 16:07:31,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 392 transitions, 7066 flow, removed 626 selfloop flow, removed 20 redundant places. [2024-01-27 16:07:31,913 INFO L231 Difference]: Finished difference. Result has 203 places, 136 transitions, 3026 flow [2024-01-27 16:07:31,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3026, PETRI_PLACES=203, PETRI_TRANSITIONS=136} [2024-01-27 16:07:31,914 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 177 predicate places. [2024-01-27 16:07:31,914 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 136 transitions, 3026 flow [2024-01-27 16:07:31,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 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-01-27 16:07:31,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:31,914 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:31,928 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-01-27 16:07:32,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-27 16:07:32,129 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:32,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash 657616333, now seen corresponding path program 4 times [2024-01-27 16:07:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181921460] [2024-01-27 16:07:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181921460] [2024-01-27 16:07:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181921460] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392860432] [2024-01-27 16:07:32,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 16:07:32,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:32,383 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-01-27 16:07:32,411 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-01-27 16:07:32,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 16:07:32,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:32,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-27 16:07:32,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:32,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:32,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392860432] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:32,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:32,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-01-27 16:07:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129584338] [2024-01-27 16:07:32,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:32,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-01-27 16:07:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-01-27 16:07:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2024-01-27 16:07:32,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:32,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 136 transitions, 3026 flow. Second operand has 35 states, 35 states have (on average 7.0285714285714285) internal successors, (246), 35 states have internal predecessors, (246), 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-01-27 16:07:32,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:32,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:34,694 INFO L124 PetriNetUnfolderBase]: 2200/4218 cut-off events. [2024-01-27 16:07:34,694 INFO L125 PetriNetUnfolderBase]: For 588237/588243 co-relation queries the response was YES. [2024-01-27 16:07:34,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45570 conditions, 4218 events. 2200/4218 cut-off events. For 588237/588243 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 21854 event pairs, 421 based on Foata normal form. 159/4374 useless extension candidates. Maximal degree in co-relation 45478. Up to 1483 conditions per place. [2024-01-27 16:07:34,734 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 190 selfloop transitions, 99 changer transitions 189/481 dead transitions. [2024-01-27 16:07:34,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 481 transitions, 13777 flow [2024-01-27 16:07:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-01-27 16:07:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-01-27 16:07:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 653 transitions. [2024-01-27 16:07:34,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946969696969697 [2024-01-27 16:07:34,740 INFO L175 Difference]: Start difference. First operand has 203 places, 136 transitions, 3026 flow. Second operand 55 states and 653 transitions. [2024-01-27 16:07:34,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 481 transitions, 13777 flow [2024-01-27 16:07:35,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 481 transitions, 10072 flow, removed 1813 selfloop flow, removed 29 redundant places. [2024-01-27 16:07:35,279 INFO L231 Difference]: Finished difference. Result has 251 places, 178 transitions, 3925 flow [2024-01-27 16:07:35,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3925, PETRI_PLACES=251, PETRI_TRANSITIONS=178} [2024-01-27 16:07:35,280 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 225 predicate places. [2024-01-27 16:07:35,280 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 178 transitions, 3925 flow [2024-01-27 16:07:35,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.0285714285714285) internal successors, (246), 35 states have internal predecessors, (246), 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-01-27 16:07:35,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:35,280 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:35,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-27 16:07:35,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:35,486 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:35,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 607522355, now seen corresponding path program 5 times [2024-01-27 16:07:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992808941] [2024-01-27 16:07:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:35,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992808941] [2024-01-27 16:07:35,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992808941] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:35,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499422768] [2024-01-27 16:07:35,737 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:07:35,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:35,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:35,739 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-01-27 16:07:35,764 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-01-27 16:07:35,800 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-01-27 16:07:35,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:35,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-27 16:07:35,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:35,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499422768] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:36,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:36,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-01-27 16:07:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359864091] [2024-01-27 16:07:36,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:36,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-01-27 16:07:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:36,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-01-27 16:07:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2024-01-27 16:07:36,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:36,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 178 transitions, 3925 flow. Second operand has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 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-01-27 16:07:36,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:36,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:36,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:38,815 INFO L124 PetriNetUnfolderBase]: 2749/5471 cut-off events. [2024-01-27 16:07:38,815 INFO L125 PetriNetUnfolderBase]: For 982908/982914 co-relation queries the response was YES. [2024-01-27 16:07:38,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61225 conditions, 5471 events. 2749/5471 cut-off events. For 982908/982914 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 30902 event pairs, 194 based on Foata normal form. 159/5629 useless extension candidates. Maximal degree in co-relation 61118. Up to 1377 conditions per place. [2024-01-27 16:07:38,939 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 180 selfloop transitions, 191 changer transitions 201/575 dead transitions. [2024-01-27 16:07:38,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 575 transitions, 16511 flow [2024-01-27 16:07:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-27 16:07:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-01-27 16:07:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 730 transitions. [2024-01-27 16:07:38,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49863387978142076 [2024-01-27 16:07:38,949 INFO L175 Difference]: Start difference. First operand has 251 places, 178 transitions, 3925 flow. Second operand 61 states and 730 transitions. [2024-01-27 16:07:38,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 575 transitions, 16511 flow [2024-01-27 16:07:40,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 575 transitions, 13985 flow, removed 1228 selfloop flow, removed 31 redundant places. [2024-01-27 16:07:40,422 INFO L231 Difference]: Finished difference. Result has 299 places, 239 transitions, 5950 flow [2024-01-27 16:07:40,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3027, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=5950, PETRI_PLACES=299, PETRI_TRANSITIONS=239} [2024-01-27 16:07:40,423 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 273 predicate places. [2024-01-27 16:07:40,423 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 239 transitions, 5950 flow [2024-01-27 16:07:40,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 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-01-27 16:07:40,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:40,424 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:40,437 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-01-27 16:07:40,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:40,637 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:40,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash -400590083, now seen corresponding path program 6 times [2024-01-27 16:07:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:40,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581424259] [2024-01-27 16:07:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:40,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581424259] [2024-01-27 16:07:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581424259] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915518525] [2024-01-27 16:07:40,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 16:07:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:40,867 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-01-27 16:07:40,871 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-01-27 16:07:40,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-01-27 16:07:40,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:40,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-27 16:07:40,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:41,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:41,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915518525] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:41,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:41,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-01-27 16:07:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963852625] [2024-01-27 16:07:41,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:41,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-01-27 16:07:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-01-27 16:07:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2024-01-27 16:07:41,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:41,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 239 transitions, 5950 flow. Second operand has 35 states, 35 states have (on average 7.0285714285714285) internal successors, (246), 35 states have internal predecessors, (246), 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-01-27 16:07:41,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:41,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:41,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:44,511 INFO L124 PetriNetUnfolderBase]: 3676/7264 cut-off events. [2024-01-27 16:07:44,511 INFO L125 PetriNetUnfolderBase]: For 1938211/1938217 co-relation queries the response was YES. [2024-01-27 16:07:44,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95377 conditions, 7264 events. 3676/7264 cut-off events. For 1938211/1938217 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 42406 event pairs, 83 based on Foata normal form. 159/7420 useless extension candidates. Maximal degree in co-relation 95252. Up to 1824 conditions per place. [2024-01-27 16:07:44,595 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 226 selfloop transitions, 272 changer transitions 205/706 dead transitions. [2024-01-27 16:07:44,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 706 transitions, 23602 flow [2024-01-27 16:07:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-01-27 16:07:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-01-27 16:07:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 868 transitions. [2024-01-27 16:07:44,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093896713615024 [2024-01-27 16:07:44,602 INFO L175 Difference]: Start difference. First operand has 299 places, 239 transitions, 5950 flow. Second operand 71 states and 868 transitions. [2024-01-27 16:07:44,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 706 transitions, 23602 flow [2024-01-27 16:07:47,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 706 transitions, 19751 flow, removed 1881 selfloop flow, removed 31 redundant places. [2024-01-27 16:07:47,227 INFO L231 Difference]: Finished difference. Result has 363 places, 300 transitions, 8467 flow [2024-01-27 16:07:47,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4495, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8467, PETRI_PLACES=363, PETRI_TRANSITIONS=300} [2024-01-27 16:07:47,228 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 337 predicate places. [2024-01-27 16:07:47,228 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 300 transitions, 8467 flow [2024-01-27 16:07:47,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.0285714285714285) internal successors, (246), 35 states have internal predecessors, (246), 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-01-27 16:07:47,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:47,228 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:47,240 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-01-27 16:07:47,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-01-27 16:07:47,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:07:47,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1693243801, now seen corresponding path program 7 times [2024-01-27 16:07:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841232523] [2024-01-27 16:07:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841232523] [2024-01-27 16:07:47,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841232523] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472919594] [2024-01-27 16:07:47,742 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 16:07:47,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:47,744 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:07:47,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-27 16:07:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:47,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 16:07:47,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:47,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:48,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472919594] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:48,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:48,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2024-01-27 16:07:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960537783] [2024-01-27 16:07:48,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-01-27 16:07:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:48,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-01-27 16:07:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2024-01-27 16:07:48,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:07:48,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 300 transitions, 8467 flow. Second operand has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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-01-27 16:07:48,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:48,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:07:48,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:54,260 INFO L124 PetriNetUnfolderBase]: 5431/10685 cut-off events. [2024-01-27 16:07:54,260 INFO L125 PetriNetUnfolderBase]: For 4463747/4463753 co-relation queries the response was YES. [2024-01-27 16:07:54,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169753 conditions, 10685 events. 5431/10685 cut-off events. For 4463747/4463753 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 63908 event pairs, 66 based on Foata normal form. 393/11077 useless extension candidates. Maximal degree in co-relation 169602. Up to 2724 conditions per place. [2024-01-27 16:07:54,417 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 313 selfloop transitions, 401 changer transitions 341/1058 dead transitions. [2024-01-27 16:07:54,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 1058 transitions, 44928 flow [2024-01-27 16:07:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-01-27 16:07:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-01-27 16:07:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1284 transitions. [2024-01-27 16:07:54,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2024-01-27 16:07:54,420 INFO L175 Difference]: Start difference. First operand has 363 places, 300 transitions, 8467 flow. Second operand 105 states and 1284 transitions. [2024-01-27 16:07:54,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 1058 transitions, 44928 flow [2024-01-27 16:08:02,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1058 transitions, 34596 flow, removed 5073 selfloop flow, removed 36 redundant places. [2024-01-27 16:08:02,074 INFO L231 Difference]: Finished difference. Result has 478 places, 431 transitions, 13932 flow [2024-01-27 16:08:02,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6067, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=272, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=13932, PETRI_PLACES=478, PETRI_TRANSITIONS=431} [2024-01-27 16:08:02,075 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 452 predicate places. [2024-01-27 16:08:02,075 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 431 transitions, 13932 flow [2024-01-27 16:08:02,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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-01-27 16:08:02,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:08:02,076 INFO L208 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:08:02,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-27 16:08:02,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-27 16:08:02,276 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:08:02,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:08:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1709734167, now seen corresponding path program 8 times [2024-01-27 16:08:02,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:08:02,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427608314] [2024-01-27 16:08:02,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:08:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:08:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:08:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 885 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 16:08:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:08:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427608314] [2024-01-27 16:08:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427608314] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:08:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005062997] [2024-01-27 16:08:02,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:08:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:08:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:08:02,951 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:08:02,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-01-27 16:08:03,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:08:03,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:08:03,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 41 conjunts are in the unsatisfiable core [2024-01-27 16:08:03,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:08:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 885 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 16:08:03,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:08:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 885 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 16:08:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005062997] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:08:03,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:08:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 46 [2024-01-27 16:08:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588499168] [2024-01-27 16:08:03,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:08:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-01-27 16:08:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:08:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-01-27 16:08:03,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1695, Unknown=0, NotChecked=0, Total=2162 [2024-01-27 16:08:03,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-01-27 16:08:03,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 431 transitions, 13932 flow. Second operand has 47 states, 47 states have (on average 7.170212765957447) internal successors, (337), 47 states have internal predecessors, (337), 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-01-27 16:08:03,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:08:03,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-01-27 16:08:03,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:08:11,998 INFO L124 PetriNetUnfolderBase]: 7510/14377 cut-off events. [2024-01-27 16:08:11,998 INFO L125 PetriNetUnfolderBase]: For 8406498/8406504 co-relation queries the response was YES. [2024-01-27 16:08:12,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249636 conditions, 14377 events. 7510/14377 cut-off events. For 8406498/8406504 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 86497 event pairs, 65 based on Foata normal form. 60/14434 useless extension candidates. Maximal degree in co-relation 249439. Up to 3408 conditions per place. [2024-01-27 16:08:12,218 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 312 selfloop transitions, 576 changer transitions 195/1086 dead transitions. [2024-01-27 16:08:12,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 1086 transitions, 50087 flow [2024-01-27 16:08:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-01-27 16:08:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2024-01-27 16:08:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1041 transitions. [2024-01-27 16:08:12,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043604651162791 [2024-01-27 16:08:12,220 INFO L175 Difference]: Start difference. First operand has 478 places, 431 transitions, 13932 flow. Second operand 86 states and 1041 transitions. [2024-01-27 16:08:12,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 1086 transitions, 50087 flow [2024-01-27 16:08:35,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 1086 transitions, 32280 flow, removed 8746 selfloop flow, removed 54 redundant places. [2024-01-27 16:08:35,131 INFO L231 Difference]: Finished difference. Result has 506 places, 612 transitions, 15403 flow [2024-01-27 16:08:35,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9025, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=400, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=15403, PETRI_PLACES=506, PETRI_TRANSITIONS=612} [2024-01-27 16:08:35,132 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 480 predicate places. [2024-01-27 16:08:35,132 INFO L495 AbstractCegarLoop]: Abstraction has has 506 places, 612 transitions, 15403 flow [2024-01-27 16:08:35,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.170212765957447) internal successors, (337), 47 states have internal predecessors, (337), 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-01-27 16:08:35,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:08:35,133 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:08:35,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-01-27 16:08:35,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-27 16:08:35,333 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:08:35,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:08:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1054744238, now seen corresponding path program 9 times [2024-01-27 16:08:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:08:35,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315655556] [2024-01-27 16:08:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:08:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:08:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:08:35,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:08:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:08:35,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:08:35,429 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:08:35,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-01-27 16:08:35,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-01-27 16:08:35,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-01-27 16:08:35,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-27 16:08:35,432 INFO L445 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1] [2024-01-27 16:08:35,437 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:08:35,437 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:08:35,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:08:35 BasicIcfg [2024-01-27 16:08:35,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:08:35,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:08:35,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:08:35,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:08:35,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:23" (3/4) ... [2024-01-27 16:08:35,540 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:08:35,624 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:08:35,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:08:35,625 INFO L158 Benchmark]: Toolchain (without parser) took 73171.21ms. Allocated memory was 199.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 171.1MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-01-27 16:08:35,625 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:08:35,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.69ms. Allocated memory is still 199.2MB. Free memory was 171.1MB in the beginning and 151.4MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 16:08:35,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.08ms. Allocated memory is still 199.2MB. Free memory was 151.4MB in the beginning and 149.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:08:35,626 INFO L158 Benchmark]: Boogie Preprocessor took 29.89ms. Allocated memory is still 199.2MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:08:35,626 INFO L158 Benchmark]: RCFGBuilder took 348.79ms. Allocated memory is still 199.2MB. Free memory was 147.2MB in the beginning and 127.1MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-01-27 16:08:35,626 INFO L158 Benchmark]: TraceAbstraction took 72255.36ms. Allocated memory was 199.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 126.2MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-01-27 16:08:35,627 INFO L158 Benchmark]: Witness Printer took 85.77ms. Allocated memory is still 7.0GB. Free memory was 5.2GB in the beginning and 5.2GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 16:08:35,628 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.14ms. Allocated memory is still 127.9MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.69ms. Allocated memory is still 199.2MB. Free memory was 171.1MB in the beginning and 151.4MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.08ms. Allocated memory is still 199.2MB. Free memory was 151.4MB in the beginning and 149.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.89ms. Allocated memory is still 199.2MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.79ms. Allocated memory is still 199.2MB. Free memory was 147.2MB in the beginning and 127.1MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 72255.36ms. Allocated memory was 199.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 126.2MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 85.77ms. Allocated memory is still 7.0GB. Free memory was 5.2GB in the beginning and 5.2GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, argc=51, argv={49:50}, i=3, id1={5:0}, id2={3:0}, j=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, i=7, id1={5:0}, id2={3:0}, j=6, k=0] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, i=43, id1={5:0}, id2={3:0}, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(argc)=51, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=51, argv={49:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 72.1s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8572 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8542 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 368 mSDsCounter, 499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7247 IncrementalHoareTripleChecker+Invalid, 7746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 499 mSolverCounterUnsat, 8 mSDtfsCounter, 7247 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1563 GetRequests, 750 SyntacticMatches, 31 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22338 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15403occurred in iteration=16, InterpolantAutomatonStates: 581, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1101 NumberOfCodeBlocks, 1101 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1383 ConstructedInterpolants, 0 QuantifiedInterpolants, 5606 SizeOfPredicates, 128 NumberOfNonLiveVariables, 1595 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 6/4491 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:08:35,655 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE