./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stack-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/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.4-dev-a340643-m [2024-01-27 16:06:50,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:06:50,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:06:50,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:06:50,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:06:50,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:06:50,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:06:50,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:06:50,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:06:50,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:06:50,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:06:50,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:06:50,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:06:50,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:06:50,283 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:06:50,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:06:50,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:06:50,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:06:50,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:06:50,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:06:50,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:06:50,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:06:50,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:06:50,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:06:50,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:06:50,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:06:50,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:06:50,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:06:50,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:06:50,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:06:50,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:06:50,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:06:50,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:50,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:06:50,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:06:50,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:06:50,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:06:50,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:06:50,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:06:50,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:06:50,290 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:06:50,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:06:50,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:06:50,291 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-01-27 16:06:50,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:06:50,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:06:50,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:06:50,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:06:50,549 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:06:50,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2024-01-27 16:06:51,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:06:51,812 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:06:51,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2024-01-27 16:06:51,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faaa0a816/8191bfcb1daf4089844136fededfbc35/FLAG829fd8f84 [2024-01-27 16:06:51,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faaa0a816/8191bfcb1daf4089844136fededfbc35 [2024-01-27 16:06:51,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:06:51,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:06:51,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:51,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:06:51,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:06:51,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:51" (1/1) ... [2024-01-27 16:06:51,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276d818f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:51, skipping insertion in model container [2024-01-27 16:06:51,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:51" (1/1) ... [2024-01-27 16:06:51,923 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:06:52,263 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/stack-2.i[41520,41533] [2024-01-27 16:06:52,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:52,301 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:06:52,322 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/stack-2.i[41520,41533] [2024-01-27 16:06:52,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:52,380 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:06:52,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52 WrapperNode [2024-01-27 16:06:52,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:52,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:52,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:06:52,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:06:52,388 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:06:52" (1/1) ... [2024-01-27 16:06:52,406 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:06:52" (1/1) ... [2024-01-27 16:06:52,437 INFO L138 Inliner]: procedures = 278, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 167 [2024-01-27 16:06:52,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:52,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:06:52,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:06:52,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:06:52,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,467 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 7, 5, 2, 2]. 39 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0]. The 3 writes are split as follows [0, 1, 0, 1, 1]. [2024-01-27 16:06:52,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:06:52,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:06:52,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:06:52,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:06:52,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (1/1) ... [2024-01-27 16:06:52,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:52,520 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:06:52,531 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:06:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:06:52,567 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:06:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:06:52,567 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:06:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:06:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:06:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:06:52,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:06:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:06:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:06:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:06:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:06:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:06:52,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:06:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:06:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:06:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:06:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:06:52,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:06:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:06:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:06:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:06:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:06:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:06:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:06:52,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:06:52,573 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:06:52,724 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:06:52,727 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:06:52,980 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:06:52,981 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:06:53,130 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:06:53,130 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:06:53,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:53 BoogieIcfgContainer [2024-01-27 16:06:53,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:06:53,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:06:53,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:06:53,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:06:53,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:06:51" (1/3) ... [2024-01-27 16:06:53,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228db66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:53, skipping insertion in model container [2024-01-27 16:06:53,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:52" (2/3) ... [2024-01-27 16:06:53,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228db66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:53, skipping insertion in model container [2024-01-27 16:06:53,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:53" (3/3) ... [2024-01-27 16:06:53,138 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-01-27 16:06:53,145 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:06:53,152 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:06:53,152 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:06:53,152 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:06:53,208 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:06:53,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-01-27 16:06:53,265 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-01-27 16:06:53,265 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:06:53,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2024-01-27 16:06:53,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-01-27 16:06:53,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 73 flow [2024-01-27 16:06:53,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:06:53,281 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;@56f449d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:06:53,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:06:53,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:06:53,286 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-01-27 16:06:53,286 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:06:53,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:53,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:53,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:53,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 39778058, now seen corresponding path program 1 times [2024-01-27 16:06:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:53,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167262984] [2024-01-27 16:06:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:53,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:53,622 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:06:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167262984] [2024-01-27 16:06:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167262984] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:53,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:53,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511228783] [2024-01-27 16:06:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:53,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:06:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:53,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:06:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:06:53,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:06:53,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:53,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:53,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:06:53,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:53,859 INFO L124 PetriNetUnfolderBase]: 360/690 cut-off events. [2024-01-27 16:06:53,860 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-01-27 16:06:53,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 690 events. 360/690 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3232 event pairs, 82 based on Foata normal form. 46/686 useless extension candidates. Maximal degree in co-relation 1175. Up to 375 conditions per place. [2024-01-27 16:06:53,868 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-01-27 16:06:53,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 236 flow [2024-01-27 16:06:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:06:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:06:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-01-27 16:06:53,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-01-27 16:06:53,881 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 73 flow. Second operand 4 states and 92 transitions. [2024-01-27 16:06:53,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 236 flow [2024-01-27 16:06:53,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 58 transitions, 227 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:53,888 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2024-01-27 16:06:53,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-01-27 16:06:53,893 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2024-01-27 16:06:53,894 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2024-01-27 16:06:53,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:53,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:53,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:53,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:06:53,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:53,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1924997439, now seen corresponding path program 1 times [2024-01-27 16:06:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:53,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956550445] [2024-01-27 16:06:53,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:54,090 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:06:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956550445] [2024-01-27 16:06:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956550445] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:06:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757812338] [2024-01-27 16:06:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:54,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:54,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:54,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-01-27 16:06:54,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:54,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:54,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-01-27 16:06:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:54,210 INFO L124 PetriNetUnfolderBase]: 355/667 cut-off events. [2024-01-27 16:06:54,211 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-01-27 16:06:54,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 667 events. 355/667 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2961 event pairs, 135 based on Foata normal form. 11/633 useless extension candidates. Maximal degree in co-relation 1024. Up to 415 conditions per place. [2024-01-27 16:06:54,215 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 34 selfloop transitions, 2 changer transitions 3/45 dead transitions. [2024-01-27 16:06:54,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 191 flow [2024-01-27 16:06:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-01-27 16:06:54,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-01-27 16:06:54,216 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 3 states and 64 transitions. [2024-01-27 16:06:54,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 191 flow [2024-01-27 16:06:54,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:06:54,218 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 94 flow [2024-01-27 16:06:54,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-01-27 16:06:54,219 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2024-01-27 16:06:54,219 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 94 flow [2024-01-27 16:06:54,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:54,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:54,220 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:54,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:06:54,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:54,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:54,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1708737105, now seen corresponding path program 1 times [2024-01-27 16:06:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:54,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274027087] [2024-01-27 16:06:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:54,342 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:06:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274027087] [2024-01-27 16:06:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274027087] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:54,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119346845] [2024-01-27 16:06:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:54,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:54,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:54,356 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:06:54,368 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:06:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:54,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 16:06:54,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:54,526 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-01-27 16:06:54,596 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:06:54,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:54,663 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:06:54,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119346845] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:54,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-01-27 16:06:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28804967] [2024-01-27 16:06:54,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:54,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 16:06:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 16:06:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:06:54,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:06:54,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 94 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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:06:54,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:54,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:06:54,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:55,039 INFO L124 PetriNetUnfolderBase]: 1079/2073 cut-off events. [2024-01-27 16:06:55,040 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-01-27 16:06:55,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 2073 events. 1079/2073 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10905 event pairs, 83 based on Foata normal form. 0/1972 useless extension candidates. Maximal degree in co-relation 3740. Up to 408 conditions per place. [2024-01-27 16:06:55,048 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 142 selfloop transitions, 18 changer transitions 3/171 dead transitions. [2024-01-27 16:06:55,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 171 transitions, 753 flow [2024-01-27 16:06:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:06:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:06:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2024-01-27 16:06:55,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6365740740740741 [2024-01-27 16:06:55,054 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 94 flow. Second operand 12 states and 275 transitions. [2024-01-27 16:06:55,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 171 transitions, 753 flow [2024-01-27 16:06:55,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 171 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:06:55,058 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 239 flow [2024-01-27 16:06:55,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=239, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-01-27 16:06:55,060 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2024-01-27 16:06:55,060 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 239 flow [2024-01-27 16:06:55,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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:06:55,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:55,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:55,075 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:06:55,272 WARN L477 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-01-27 16:06:55,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:55,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1357861338, now seen corresponding path program 1 times [2024-01-27 16:06:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:55,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027273966] [2024-01-27 16:06:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:55,359 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:06:55,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:55,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027273966] [2024-01-27 16:06:55,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027273966] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:55,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:55,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113021506] [2024-01-27 16:06:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:55,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:55,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:55,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:06:55,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:06:55,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:55,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:06:55,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:55,483 INFO L124 PetriNetUnfolderBase]: 633/1321 cut-off events. [2024-01-27 16:06:55,484 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2024-01-27 16:06:55,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 1321 events. 633/1321 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6508 event pairs, 222 based on Foata normal form. 60/1364 useless extension candidates. Maximal degree in co-relation 2825. Up to 607 conditions per place. [2024-01-27 16:06:55,490 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 44 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2024-01-27 16:06:55,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 317 flow [2024-01-27 16:06:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-01-27 16:06:55,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:06:55,491 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 239 flow. Second operand 3 states and 63 transitions. [2024-01-27 16:06:55,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 317 flow [2024-01-27 16:06:55,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 293 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:55,508 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 180 flow [2024-01-27 16:06:55,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-01-27 16:06:55,510 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2024-01-27 16:06:55,510 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 180 flow [2024-01-27 16:06:55,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:06:55,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:55,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:55,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:06:55,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:55,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1749710733, now seen corresponding path program 1 times [2024-01-27 16:06:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:55,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103600148] [2024-01-27 16:06:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:55,921 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:06:55,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103600148] [2024-01-27 16:06:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103600148] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:06:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65137975] [2024-01-27 16:06:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:55,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:06:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:06:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:06:55,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:06:55,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-01-27 16:06:55,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:55,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:06:55,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:56,135 INFO L124 PetriNetUnfolderBase]: 699/1437 cut-off events. [2024-01-27 16:06:56,139 INFO L125 PetriNetUnfolderBase]: For 534/534 co-relation queries the response was YES. [2024-01-27 16:06:56,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 1437 events. 699/1437 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7240 event pairs, 162 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 2922. Up to 902 conditions per place. [2024-01-27 16:06:56,146 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 63 selfloop transitions, 5 changer transitions 3/79 dead transitions. [2024-01-27 16:06:56,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 418 flow [2024-01-27 16:06:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:06:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:06:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-01-27 16:06:56,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:06:56,148 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 180 flow. Second operand 5 states and 105 transitions. [2024-01-27 16:06:56,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 418 flow [2024-01-27 16:06:56,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:06:56,152 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 212 flow [2024-01-27 16:06:56,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-01-27 16:06:56,153 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2024-01-27 16:06:56,154 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 212 flow [2024-01-27 16:06:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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-01-27 16:06:56,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:56,154 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:56,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:06:56,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:56,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1487012278, now seen corresponding path program 1 times [2024-01-27 16:06:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062616716] [2024-01-27 16:06:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:56,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:56,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062616716] [2024-01-27 16:06:56,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062616716] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:56,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327139061] [2024-01-27 16:06:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:56,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:56,537 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:06:56,555 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:06:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:56,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 16:06:56,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:56,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-27 16:06:56,709 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-01-27 16:06:56,768 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-01-27 16:06:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:56,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:57,143 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-01-27 16:06:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327139061] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:57,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-01-27 16:06:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432665223] [2024-01-27 16:06:57,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:57,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 16:06:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:57,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 16:06:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-01-27 16:06:57,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:06:57,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 212 flow. Second operand has 14 states, 14 states have (on average 12.857142857142858) internal successors, (180), 14 states have internal predecessors, (180), 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:06:57,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:57,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:06:57,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:57,821 INFO L124 PetriNetUnfolderBase]: 1339/2765 cut-off events. [2024-01-27 16:06:57,821 INFO L125 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2024-01-27 16:06:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 2765 events. 1339/2765 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 15498 event pairs, 258 based on Foata normal form. 0/2729 useless extension candidates. Maximal degree in co-relation 5116. Up to 415 conditions per place. [2024-01-27 16:06:57,835 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 149 selfloop transitions, 28 changer transitions 0/185 dead transitions. [2024-01-27 16:06:57,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 185 transitions, 1010 flow [2024-01-27 16:06:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:06:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:06:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2024-01-27 16:06:57,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6273148148148148 [2024-01-27 16:06:57,837 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 212 flow. Second operand 12 states and 271 transitions. [2024-01-27 16:06:57,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 185 transitions, 1010 flow [2024-01-27 16:06:57,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 185 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:57,842 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 378 flow [2024-01-27 16:06:57,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=378, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-01-27 16:06:57,842 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2024-01-27 16:06:57,843 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 378 flow [2024-01-27 16:06:57,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.857142857142858) internal successors, (180), 14 states have internal predecessors, (180), 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:06:57,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:57,843 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:57,859 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:06:58,054 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,SelfDestructingSolverStorable5 [2024-01-27 16:06:58,054 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:58,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1439794242, now seen corresponding path program 1 times [2024-01-27 16:06:58,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:58,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553674016] [2024-01-27 16:06:58,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:58,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:06:58,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:06:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:06:58,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:06:58,176 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:06:58,177 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:06:58,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-01-27 16:06:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:06:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-01-27 16:06:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-01-27 16:06:58,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:06:58,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:06:58,180 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:58,184 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:06:58,184 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:06:58,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:06:58 BasicIcfg [2024-01-27 16:06:58,242 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:06:58,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:06:58,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:06:58,243 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:06:58,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:53" (3/4) ... [2024-01-27 16:06:58,244 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:06:58,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:06:58,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:06:58,300 INFO L158 Benchmark]: Toolchain (without parser) took 6433.24ms. Allocated memory was 146.8MB in the beginning and 245.4MB in the end (delta: 98.6MB). Free memory was 119.0MB in the beginning and 185.8MB in the end (delta: -66.8MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-01-27 16:06:58,300 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:06:58,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.21ms. Allocated memory is still 146.8MB. Free memory was 118.8MB in the beginning and 91.9MB in the end (delta: 26.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-01-27 16:06:58,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.39ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:06:58,301 INFO L158 Benchmark]: Boogie Preprocessor took 41.27ms. Allocated memory is still 146.8MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:06:58,303 INFO L158 Benchmark]: RCFGBuilder took 650.76ms. Allocated memory is still 146.8MB. Free memory was 85.6MB in the beginning and 106.5MB in the end (delta: -20.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-01-27 16:06:58,303 INFO L158 Benchmark]: TraceAbstraction took 5109.71ms. Allocated memory was 146.8MB in the beginning and 245.4MB in the end (delta: 98.6MB). Free memory was 106.3MB in the beginning and 194.2MB in the end (delta: -87.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-01-27 16:06:58,303 INFO L158 Benchmark]: Witness Printer took 57.40ms. Allocated memory is still 245.4MB. Free memory was 194.2MB in the beginning and 185.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 16:06:58,304 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.13ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.21ms. Allocated memory is still 146.8MB. Free memory was 118.8MB in the beginning and 91.9MB in the end (delta: 26.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.39ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 88.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.27ms. Allocated memory is still 146.8MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 650.76ms. Allocated memory is still 146.8MB. Free memory was 85.6MB in the beginning and 106.5MB in the end (delta: -20.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5109.71ms. Allocated memory was 146.8MB in the beginning and 245.4MB in the end (delta: 98.6MB). Free memory was 106.3MB in the beginning and 194.2MB in the end (delta: -87.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 57.40ms. Allocated memory is still 245.4MB. Free memory was 194.2MB in the beginning and 185.8MB 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={7:0}, id2={6:0}, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [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 [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={7:0}, id2={6:0}, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [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 [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4: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 [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 [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: 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: 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: 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, 56 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: 4.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1117 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 0 mSDtfsCounter, 1117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred 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, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 7 QuantifiedInterpolants, 1666 SizeOfPredicates, 21 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/30 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:06:58,330 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