./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread/stack-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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:07:52,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:07:52,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:07:52,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:07:52,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:07:52,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:07:52,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:07:52,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:07:52,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:07:52,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:07:52,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:07:52,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:07:52,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:07:52,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:07:52,117 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:07:52,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:07:52,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:07:52,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:07:52,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:07:52,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:07:52,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:07:52,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:07:52,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:07:52,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:07:52,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:07:52,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:07:52,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:07:52,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:07:52,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:07:52,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:07:52,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:07:52,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:07:52,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:07:52,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:07:52,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:07:52,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:07:52,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:07:52,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:07:52,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:07:52,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:07:52,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:07:52,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:07:52,124 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2024-11-10 10:07:52,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:07:52,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:07:52,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:07:52,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:07:52,324 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:07:52,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2024-11-10 10:07:53,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:07:53,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:07:53,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-11-10 10:07:53,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf50b4ec/511570020b924a23829139bb0263b1a0/FLAG62a68713d [2024-11-10 10:07:54,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf50b4ec/511570020b924a23829139bb0263b1a0 [2024-11-10 10:07:54,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:07:54,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:07:54,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:07:54,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:07:54,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:07:54,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113d5761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54, skipping insertion in model container [2024-11-10 10:07:54,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:07:54,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2024-11-10 10:07:54,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:07:54,461 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:07:54,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2024-11-10 10:07:54,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:07:54,563 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:07:54,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54 WrapperNode [2024-11-10 10:07:54,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:07:54,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:07:54,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:07:54,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:07:54,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,605 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2024-11-10 10:07:54,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:07:54,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:07:54,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:07:54,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:07:54,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,640 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2024-11-10 10:07:54,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:07:54,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:07:54,654 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:07:54,654 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:07:54,655 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (1/1) ... [2024-11-10 10:07:54,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:07:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:07:54,682 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-11-10 10:07:54,687 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-11-10 10:07:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-10 10:07:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-10 10:07:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-10 10:07:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-10 10:07:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:07:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:07:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:07:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:07:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:07:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:07:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:07:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:07:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:07:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:07:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:07:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:07:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:07:54,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:07:54,730 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:07:54,865 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:07:54,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:07:55,073 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2024-11-10 10:07:55,073 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem38#1; [2024-11-10 10:07:55,073 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret37#1; [2024-11-10 10:07:55,075 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:07:55,075 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:07:55,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:07:55,292 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:07:55,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:07:55 BoogieIcfgContainer [2024-11-10 10:07:55,293 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:07:55,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:07:55,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:07:55,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:07:55,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:07:54" (1/3) ... [2024-11-10 10:07:55,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d35d3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:07:55, skipping insertion in model container [2024-11-10 10:07:55,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:54" (2/3) ... [2024-11-10 10:07:55,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d35d3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:07:55, skipping insertion in model container [2024-11-10 10:07:55,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:07:55" (3/3) ... [2024-11-10 10:07:55,307 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-11-10 10:07:55,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:07:55,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:07:55,357 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:07:55,416 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:07:55,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 96 flow [2024-11-10 10:07:55,474 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2024-11-10 10:07:55,475 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:07:55,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 39 events. 7/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 36. Up to 3 conditions per place. [2024-11-10 10:07:55,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 96 flow [2024-11-10 10:07:55,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 37 transitions, 83 flow [2024-11-10 10:07:55,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:07:55,490 INFO L333 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, 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;@1798c296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:07:55,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:07:55,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:07:55,497 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-11-10 10:07:55,497 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:07:55,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:07:55,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:07:55,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:07:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:07:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1253059395, now seen corresponding path program 1 times [2024-11-10 10:07:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:07:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484753706] [2024-11-10 10:07:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:07:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:07:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484753706] [2024-11-10 10:07:55,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484753706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:07:55,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:07:55,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:07:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512842616] [2024-11-10 10:07:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:07:55,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:07:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:07:55,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:07:55,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:07:55,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-10 10:07:55,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:07:55,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:07:55,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-10 10:07:55,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:07:56,027 INFO L124 PetriNetUnfolderBase]: 342/709 cut-off events. [2024-11-10 10:07:56,031 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-10 10:07:56,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 709 events. 342/709 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3692 event pairs, 75 based on Foata normal form. 104/735 useless extension candidates. Maximal degree in co-relation 1229. Up to 358 conditions per place. [2024-11-10 10:07:56,041 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 46 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-11-10 10:07:56,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 236 flow [2024-11-10 10:07:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:07:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:07:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-10 10:07:56,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.676829268292683 [2024-11-10 10:07:56,058 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 83 flow. Second operand 4 states and 111 transitions. [2024-11-10 10:07:56,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 236 flow [2024-11-10 10:07:56,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 227 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:07:56,063 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 90 flow [2024-11-10 10:07:56,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2024-11-10 10:07:56,072 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2024-11-10 10:07:56,073 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 90 flow [2024-11-10 10:07:56,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:07:56,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:07:56,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:07:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:07:56,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:07:56,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:07:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1483530580, now seen corresponding path program 1 times [2024-11-10 10:07:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:07:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086311351] [2024-11-10 10:07:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:07:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:56,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:07:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086311351] [2024-11-10 10:07:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086311351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:07:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:07:56,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:07:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414059873] [2024-11-10 10:07:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:07:56,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:07:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:07:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:07:56,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:07:56,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-11-10 10:07:56,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:07:56,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:07:56,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-11-10 10:07:56,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:07:56,429 INFO L124 PetriNetUnfolderBase]: 341/681 cut-off events. [2024-11-10 10:07:56,429 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-11-10 10:07:56,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 681 events. 341/681 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3429 event pairs, 128 based on Foata normal form. 11/621 useless extension candidates. Maximal degree in co-relation 1013. Up to 398 conditions per place. [2024-11-10 10:07:56,433 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 33 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-11-10 10:07:56,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 191 flow [2024-11-10 10:07:56,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:07:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:07:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-10 10:07:56,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-11-10 10:07:56,435 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 90 flow. Second operand 3 states and 74 transitions. [2024-11-10 10:07:56,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 191 flow [2024-11-10 10:07:56,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:07:56,436 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 100 flow [2024-11-10 10:07:56,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-11-10 10:07:56,437 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2024-11-10 10:07:56,437 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 100 flow [2024-11-10 10:07:56,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:07:56,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:07:56,438 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:07:56,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:07:56,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:07:56,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:07:56,439 INFO L85 PathProgramCache]: Analyzing trace with hash -612552853, now seen corresponding path program 1 times [2024-11-10 10:07:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:07:56,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300788889] [2024-11-10 10:07:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:07:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:07:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300788889] [2024-11-10 10:07:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300788889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:07:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414217766] [2024-11-10 10:07:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:56,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:07:56,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:07:56,571 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-11-10 10:07:56,575 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-11-10 10:07:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:56,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 10:07:56,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:07:56,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 10:07:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:56,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:07:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414217766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:07:56,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:07:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-10 10:07:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792384514] [2024-11-10 10:07:56,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:07:56,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:07:56,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:07:56,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:07:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:07:56,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-10 10:07:56,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 100 flow. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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-11-10 10:07:56,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:07:56,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-10 10:07:56,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:07:57,395 INFO L124 PetriNetUnfolderBase]: 1030/2170 cut-off events. [2024-11-10 10:07:57,395 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-11-10 10:07:57,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 2170 events. 1030/2170 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12849 event pairs, 79 based on Foata normal form. 0/1969 useless extension candidates. Maximal degree in co-relation 3731. Up to 390 conditions per place. [2024-11-10 10:07:57,405 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 137 selfloop transitions, 18 changer transitions 2/169 dead transitions. [2024-11-10 10:07:57,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 169 transitions, 737 flow [2024-11-10 10:07:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:07:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:07:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 317 transitions. [2024-11-10 10:07:57,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6443089430894309 [2024-11-10 10:07:57,410 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 100 flow. Second operand 12 states and 317 transitions. [2024-11-10 10:07:57,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 169 transitions, 737 flow [2024-11-10 10:07:57,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 169 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:07:57,416 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 245 flow [2024-11-10 10:07:57,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=245, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-11-10 10:07:57,417 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2024-11-10 10:07:57,417 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 245 flow [2024-11-10 10:07:57,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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-11-10 10:07:57,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:07:57,418 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:07:57,432 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-11-10 10:07:57,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:07:57,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:07:57,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:07:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 924093195, now seen corresponding path program 1 times [2024-11-10 10:07:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:07:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314083540] [2024-11-10 10:07:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:07:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:57,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:07:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314083540] [2024-11-10 10:07:57,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314083540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:07:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:07:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:07:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373444612] [2024-11-10 10:07:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:07:57,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:07:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:07:57,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:07:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:07:57,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-10 10:07:57,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11-10 10:07:57,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:07:57,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-10 10:07:57,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:07:57,847 INFO L124 PetriNetUnfolderBase]: 593/1354 cut-off events. [2024-11-10 10:07:57,847 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2024-11-10 10:07:57,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 1354 events. 593/1354 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7506 event pairs, 204 based on Foata normal form. 60/1321 useless extension candidates. Maximal degree in co-relation 2775. Up to 580 conditions per place. [2024-11-10 10:07:57,853 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 42 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2024-11-10 10:07:57,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 317 flow [2024-11-10 10:07:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:07:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:07:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-10 10:07:57,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2024-11-10 10:07:57,856 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 245 flow. Second operand 3 states and 73 transitions. [2024-11-10 10:07:57,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 317 flow [2024-11-10 10:07:57,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 293 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-10 10:07:57,864 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 186 flow [2024-11-10 10:07:57,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-11-10 10:07:57,866 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-11-10 10:07:57,866 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 186 flow [2024-11-10 10:07:57,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11-10 10:07:57,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:07:57,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:07:57,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:07:57,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:07:57,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:07:57,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1637917574, now seen corresponding path program 1 times [2024-11-10 10:07:57,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:07:57,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662541992] [2024-11-10 10:07:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:07:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:58,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:07:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662541992] [2024-11-10 10:07:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662541992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:07:58,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:07:58,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:07:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305506038] [2024-11-10 10:07:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:07:58,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:07:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:07:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:07:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:07:58,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-10 10:07:58,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-11-10 10:07:58,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:07:58,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-10 10:07:58,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:07:58,495 INFO L124 PetriNetUnfolderBase]: 653/1471 cut-off events. [2024-11-10 10:07:58,496 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2024-11-10 10:07:58,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1471 events. 653/1471 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 8425 event pairs, 145 based on Foata normal form. 0/1383 useless extension candidates. Maximal degree in co-relation 2843. Up to 840 conditions per place. [2024-11-10 10:07:58,503 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 60 selfloop transitions, 5 changer transitions 2/79 dead transitions. [2024-11-10 10:07:58,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 410 flow [2024-11-10 10:07:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:07:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:07:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-11-10 10:07:58,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5902439024390244 [2024-11-10 10:07:58,505 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 186 flow. Second operand 5 states and 121 transitions. [2024-11-10 10:07:58,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 410 flow [2024-11-10 10:07:58,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:07:58,508 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 218 flow [2024-11-10 10:07:58,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-11-10 10:07:58,509 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2024-11-10 10:07:58,509 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 218 flow [2024-11-10 10:07:58,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-11-10 10:07:58,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:07:58,510 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:07:58,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:07:58,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:07:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:07:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1376543548, now seen corresponding path program 1 times [2024-11-10 10:07:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:07:58,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197004965] [2024-11-10 10:07:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:07:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:58,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:07:58,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197004965] [2024-11-10 10:07:58,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197004965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:07:58,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140885573] [2024-11-10 10:07:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:07:58,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:07:58,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:07:58,868 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-11-10 10:07:58,870 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-11-10 10:07:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:07:58,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 10:07:58,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:07:58,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 10:07:59,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 10:07:59,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-10 10:07:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:59,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:07:59,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-11-10 10:07:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:07:59,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140885573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:07:59,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:07:59,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-10 10:07:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516594138] [2024-11-10 10:07:59,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:07:59,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 10:07:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:07:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 10:07:59,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:07:59,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-10 10:07:59,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 218 flow. Second operand has 14 states, 14 states have (on average 16.857142857142858) internal successors, (236), 14 states have internal predecessors, (236), 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-11-10 10:07:59,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:07:59,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-10 10:07:59,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:00,190 INFO L124 PetriNetUnfolderBase]: 1248/2827 cut-off events. [2024-11-10 10:08:00,190 INFO L125 PetriNetUnfolderBase]: For 1249/1249 co-relation queries the response was YES. [2024-11-10 10:08:00,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6187 conditions, 2827 events. 1248/2827 cut-off events. For 1249/1249 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 18022 event pairs, 231 based on Foata normal form. 0/2665 useless extension candidates. Maximal degree in co-relation 4942. Up to 384 conditions per place. [2024-11-10 10:08:00,202 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 138 selfloop transitions, 28 changer transitions 0/178 dead transitions. [2024-11-10 10:08:00,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 178 transitions, 974 flow [2024-11-10 10:08:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:08:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:08:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 308 transitions. [2024-11-10 10:08:00,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6260162601626016 [2024-11-10 10:08:00,204 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 218 flow. Second operand 12 states and 308 transitions. [2024-11-10 10:08:00,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 178 transitions, 974 flow [2024-11-10 10:08:00,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 178 transitions, 969 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:00,209 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 384 flow [2024-11-10 10:08:00,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=384, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2024-11-10 10:08:00,210 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2024-11-10 10:08:00,210 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 384 flow [2024-11-10 10:08:00,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.857142857142858) internal successors, (236), 14 states have internal predecessors, (236), 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-11-10 10:08:00,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:00,211 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:00,224 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-11-10 10:08:00,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 10:08:00,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:08:00,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 61166922, now seen corresponding path program 1 times [2024-11-10 10:08:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:00,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244120493] [2024-11-10 10:08:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:08:00,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:08:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:08:00,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:08:00,517 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:08:00,519 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-10 10:08:00,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-11-10 10:08:00,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 10:08:00,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-10 10:08:00,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-10 10:08:00,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:08:00,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:08:00,522 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:00,566 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:08:00,566 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:08:00,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:08:00 BasicIcfg [2024-11-10 10:08:00,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:08:00,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:08:00,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:08:00,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:08:00,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:07:55" (3/4) ... [2024-11-10 10:08:00,572 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:08:00,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:08:00,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:08:00,612 INFO L158 Benchmark]: Toolchain (without parser) took 6601.91ms. Allocated memory was 220.2MB in the beginning and 394.3MB in the end (delta: 174.1MB). Free memory was 190.2MB in the beginning and 294.3MB in the end (delta: -104.1MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-11-10 10:08:00,613 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 134.2MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:08:00,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.07ms. Allocated memory is still 220.2MB. Free memory was 190.0MB in the beginning and 160.5MB in the end (delta: 29.5MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2024-11-10 10:08:00,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.61ms. Allocated memory is still 220.2MB. Free memory was 160.5MB in the beginning and 158.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:08:00,613 INFO L158 Benchmark]: Boogie Preprocessor took 42.58ms. Allocated memory is still 220.2MB. Free memory was 158.4MB in the beginning and 156.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:08:00,613 INFO L158 Benchmark]: IcfgBuilder took 640.37ms. Allocated memory is still 220.2MB. Free memory was 155.1MB in the beginning and 184.7MB in the end (delta: -29.5MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-11-10 10:08:00,614 INFO L158 Benchmark]: TraceAbstraction took 5276.12ms. Allocated memory was 220.2MB in the beginning and 394.3MB in the end (delta: 174.1MB). Free memory was 183.6MB in the beginning and 302.7MB in the end (delta: -119.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-11-10 10:08:00,614 INFO L158 Benchmark]: Witness Printer took 41.51ms. Allocated memory is still 394.3MB. Free memory was 302.7MB in the beginning and 294.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 10:08:00,615 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.10ms. Allocated memory is still 134.2MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.07ms. Allocated memory is still 220.2MB. Free memory was 190.0MB in the beginning and 160.5MB in the end (delta: 29.5MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.61ms. Allocated memory is still 220.2MB. Free memory was 160.5MB in the beginning and 158.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.58ms. Allocated memory is still 220.2MB. Free memory was 158.4MB in the beginning and 156.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 640.37ms. Allocated memory is still 220.2MB. Free memory was 155.1MB in the beginning and 184.7MB in the end (delta: -29.5MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5276.12ms. Allocated memory was 220.2MB in the beginning and 394.3MB in the end (delta: 174.1MB). Free memory was 183.6MB in the beginning and 302.7MB in the end (delta: -119.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Witness Printer took 41.51ms. Allocated memory is still 394.3MB. Free memory was 302.7MB in the beginning and 294.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1024]: 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: 1023]: 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: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 63 locations, 6 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: 5.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 506 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 961 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 2 mSDtfsCounter, 961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=6, InterpolantAutomatonStates: 39, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 185 ConstructedInterpolants, 8 QuantifiedInterpolants, 1862 SizeOfPredicates, 21 NumberOfNonLiveVariables, 316 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/36 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-11-10 10:08:00,637 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