./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:29:11,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:29:11,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:29:11,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:29:11,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:29:11,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:29:11,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:29:11,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:29:11,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:29:11,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:29:11,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:29:11,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:29:11,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:29:11,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:29:11,440 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:29:11,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:29:11,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:29:11,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:29:11,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:29:11,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:29:11,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:29:11,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:29:11,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:29:11,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:29:11,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:29:11,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:29:11,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:29:11,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:29:11,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:29:11,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:29:11,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:29:11,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:29:11,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:11,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:29:11,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:29:11,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:29:11,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:29:11,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:29:11,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:29:11,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:29:11,448 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:29:11,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:29:11,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:29:11,449 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 -> 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 [2024-06-27 17:29:11,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:29:11,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:29:11,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:29:11,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:29:11,700 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:29:11,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 17:29:12,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:29:13,201 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:29:13,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 17:29:13,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83cc7d53/a37c9a27e56b417ca7225ef7377d6f7a/FLAG8734510da [2024-06-27 17:29:13,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83cc7d53/a37c9a27e56b417ca7225ef7377d6f7a [2024-06-27 17:29:13,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:29:13,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:29:13,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:13,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:29:13,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:29:13,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4661de68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13, skipping insertion in model container [2024-06-27 17:29:13,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,298 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:29:13,483 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-06-27 17:29:13,675 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:13,685 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:29:13,694 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-06-27 17:29:13,744 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:13,784 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:29:13,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13 WrapperNode [2024-06-27 17:29:13,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:13,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:13,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:29:13,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:29:13,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,845 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2024-06-27 17:29:13,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:13,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:29:13,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:29:13,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:29:13,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,900 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 17:29:13,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:29:13,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:29:13,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:29:13,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:29:13,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:13,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:29:13,995 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-06-27 17:29:14,012 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-06-27 17:29:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:29:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:29:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:29:14,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:29:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:29:14,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:29:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:29:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:29:14,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:29:14,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:29:14,040 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:29:14,167 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:29:14,168 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:29:14,402 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:29:14,403 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:29:14,516 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:29:14,516 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:29:14,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:14 BoogieIcfgContainer [2024-06-27 17:29:14,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:29:14,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:29:14,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:29:14,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:29:14,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:29:13" (1/3) ... [2024-06-27 17:29:14,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342b811e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:14, skipping insertion in model container [2024-06-27 17:29:14,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13" (2/3) ... [2024-06-27 17:29:14,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342b811e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:14, skipping insertion in model container [2024-06-27 17:29:14,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:14" (3/3) ... [2024-06-27 17:29:14,523 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 17:29:14,529 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:29:14,537 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:29:14,538 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:29:14,538 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:29:14,564 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:29:14,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 68 flow [2024-06-27 17:29:14,646 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2024-06-27 17:29:14,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:14,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-06-27 17:29:14,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 30 transitions, 68 flow [2024-06-27 17:29:14,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 62 flow [2024-06-27 17:29:14,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:29:14,677 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;@3334d521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:29:14,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 17:29:14,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:29:14,680 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 17:29:14,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:14,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:14,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-06-27 17:29:14,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:29:14,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash 9558482, now seen corresponding path program 1 times [2024-06-27 17:29:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:14,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35508124] [2024-06-27 17:29:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35508124] [2024-06-27 17:29:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35508124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:15,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:29:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444379709] [2024-06-27 17:29:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:15,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:29:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:29:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:29:15,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-06-27 17:29:15,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-06-27 17:29:15,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:15,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-06-27 17:29:15,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:15,315 INFO L124 PetriNetUnfolderBase]: 114/263 cut-off events. [2024-06-27 17:29:15,316 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:29:15,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 263 events. 114/263 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1253 event pairs, 40 based on Foata normal form. 12/267 useless extension candidates. Maximal degree in co-relation 474. Up to 172 conditions per place. [2024-06-27 17:29:15,324 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 21 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2024-06-27 17:29:15,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 131 flow [2024-06-27 17:29:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:29:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:29:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-27 17:29:15,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2024-06-27 17:29:15,336 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 62 flow. Second operand 3 states and 67 transitions. [2024-06-27 17:29:15,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 131 flow [2024-06-27 17:29:15,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:29:15,340 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2024-06-27 17:29:15,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-06-27 17:29:15,343 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2024-06-27 17:29:15,344 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2024-06-27 17:29:15,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-06-27 17:29:15,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:15,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:15,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:29:15,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:29:15,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1103627620, now seen corresponding path program 1 times [2024-06-27 17:29:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585040652] [2024-06-27 17:29:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585040652] [2024-06-27 17:29:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585040652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:29:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392052602] [2024-06-27 17:29:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:15,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:29:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:29:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:29:15,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-06-27 17:29:15,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-06-27 17:29:15,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:15,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-06-27 17:29:15,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:15,629 INFO L124 PetriNetUnfolderBase]: 163/357 cut-off events. [2024-06-27 17:29:15,629 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-06-27 17:29:15,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 357 events. 163/357 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1669 event pairs, 26 based on Foata normal form. 20/351 useless extension candidates. Maximal degree in co-relation 691. Up to 166 conditions per place. [2024-06-27 17:29:15,632 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 28 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2024-06-27 17:29:15,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 162 flow [2024-06-27 17:29:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:29:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:29:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-06-27 17:29:15,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-06-27 17:29:15,633 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 58 flow. Second operand 4 states and 75 transitions. [2024-06-27 17:29:15,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 162 flow [2024-06-27 17:29:15,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:29:15,635 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 80 flow [2024-06-27 17:29:15,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-06-27 17:29:15,636 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2024-06-27 17:29:15,636 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 80 flow [2024-06-27 17:29:15,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-06-27 17:29:15,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:15,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:15,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:29:15,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:29:15,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1415869558, now seen corresponding path program 1 times [2024-06-27 17:29:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146804239] [2024-06-27 17:29:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146804239] [2024-06-27 17:29:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146804239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:15,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:15,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:29:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996895847] [2024-06-27 17:29:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:15,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:15,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:15,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-06-27 17:29:15,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-06-27 17:29:15,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:15,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-06-27 17:29:15,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:15,927 INFO L124 PetriNetUnfolderBase]: 86/194 cut-off events. [2024-06-27 17:29:15,927 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-06-27 17:29:15,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 194 events. 86/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 657 event pairs, 18 based on Foata normal form. 14/195 useless extension candidates. Maximal degree in co-relation 443. Up to 71 conditions per place. [2024-06-27 17:29:15,929 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 24 selfloop transitions, 6 changer transitions 1/39 dead transitions. [2024-06-27 17:29:15,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 171 flow [2024-06-27 17:29:15,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:29:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:29:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-06-27 17:29:15,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2024-06-27 17:29:15,930 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 80 flow. Second operand 5 states and 83 transitions. [2024-06-27 17:29:15,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 171 flow [2024-06-27 17:29:15,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 162 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:29:15,932 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 96 flow [2024-06-27 17:29:15,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2024-06-27 17:29:15,933 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2024-06-27 17:29:15,933 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 96 flow [2024-06-27 17:29:15,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-06-27 17:29:15,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:15,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:15,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:29:15,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:29:15,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1751334755, now seen corresponding path program 1 times [2024-06-27 17:29:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717649250] [2024-06-27 17:29:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:17,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717649250] [2024-06-27 17:29:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717649250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:17,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:17,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 17:29:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719374833] [2024-06-27 17:29:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:17,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:29:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:29:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:29:17,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-06-27 17:29:17,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 96 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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-06-27 17:29:17,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:17,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-06-27 17:29:17,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:17,690 INFO L124 PetriNetUnfolderBase]: 108/262 cut-off events. [2024-06-27 17:29:17,691 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-06-27 17:29:17,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 262 events. 108/262 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1005 event pairs, 28 based on Foata normal form. 4/258 useless extension candidates. Maximal degree in co-relation 583. Up to 99 conditions per place. [2024-06-27 17:29:17,692 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 25 selfloop transitions, 8 changer transitions 16/59 dead transitions. [2024-06-27 17:29:17,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 268 flow [2024-06-27 17:29:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:29:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:29:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2024-06-27 17:29:17,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 17:29:17,694 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 96 flow. Second operand 10 states and 150 transitions. [2024-06-27 17:29:17,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 268 flow [2024-06-27 17:29:17,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 234 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 17:29:17,696 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 108 flow [2024-06-27 17:29:17,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=108, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2024-06-27 17:29:17,697 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2024-06-27 17:29:17,697 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 108 flow [2024-06-27 17:29:17,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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-06-27 17:29:17,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:17,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:17,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:29:17,698 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:29:17,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1903964763, now seen corresponding path program 2 times [2024-06-27 17:29:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406917467] [2024-06-27 17:29:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406917467] [2024-06-27 17:29:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406917467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:29:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737039142] [2024-06-27 17:29:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:29:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:29:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:29:18,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-06-27 17:29:18,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-06-27 17:29:18,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:18,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-06-27 17:29:18,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:18,259 INFO L124 PetriNetUnfolderBase]: 126/305 cut-off events. [2024-06-27 17:29:18,259 INFO L125 PetriNetUnfolderBase]: For 83/85 co-relation queries the response was YES. [2024-06-27 17:29:18,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 305 events. 126/305 cut-off events. For 83/85 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1310 event pairs, 54 based on Foata normal form. 5/296 useless extension candidates. Maximal degree in co-relation 676. Up to 104 conditions per place. [2024-06-27 17:29:18,261 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 18 selfloop transitions, 3 changer transitions 20/51 dead transitions. [2024-06-27 17:29:18,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 244 flow [2024-06-27 17:29:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-27 17:29:18,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2024-06-27 17:29:18,262 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 108 flow. Second operand 6 states and 97 transitions. [2024-06-27 17:29:18,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 244 flow [2024-06-27 17:29:18,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 233 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 17:29:18,264 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 94 flow [2024-06-27 17:29:18,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2024-06-27 17:29:18,265 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2024-06-27 17:29:18,265 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 94 flow [2024-06-27 17:29:18,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-06-27 17:29:18,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:18,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:18,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:29:18,266 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 17:29:18,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 146353717, now seen corresponding path program 3 times [2024-06-27 17:29:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532204191] [2024-06-27 17:29:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:29:18,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:29:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:29:18,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:29:18,342 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:29:18,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 17:29:18,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-06-27 17:29:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-06-27 17:29:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 17:29:18,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-06-27 17:29:18,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:29:18,345 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-06-27 17:29:18,350 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:29:18,350 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:29:18,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:29:18 BasicIcfg [2024-06-27 17:29:18,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:29:18,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:29:18,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:29:18,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:29:18,385 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:14" (3/4) ... [2024-06-27 17:29:18,386 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:29:18,433 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:29:18,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:29:18,433 INFO L158 Benchmark]: Toolchain (without parser) took 5169.65ms. Allocated memory was 155.2MB in the beginning and 385.9MB in the end (delta: 230.7MB). Free memory was 79.0MB in the beginning and 334.7MB in the end (delta: -255.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:29:18,434 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:29:18,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.23ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 78.9MB in the beginning and 172.4MB in the end (delta: -93.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-06-27 17:29:18,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.53ms. Allocated memory is still 213.9MB. Free memory was 172.4MB in the beginning and 169.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:29:18,434 INFO L158 Benchmark]: Boogie Preprocessor took 71.68ms. Allocated memory is still 213.9MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:29:18,435 INFO L158 Benchmark]: RCFGBuilder took 598.26ms. Allocated memory is still 213.9MB. Free memory was 167.2MB in the beginning and 125.3MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-06-27 17:29:18,435 INFO L158 Benchmark]: TraceAbstraction took 3866.29ms. Allocated memory was 213.9MB in the beginning and 385.9MB in the end (delta: 172.0MB). Free memory was 125.3MB in the beginning and 343.1MB in the end (delta: -217.8MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2024-06-27 17:29:18,435 INFO L158 Benchmark]: Witness Printer took 48.41ms. Allocated memory is still 385.9MB. Free memory was 343.1MB in the beginning and 334.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-27 17:29:18,436 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.17ms. Allocated memory is still 155.2MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.23ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 78.9MB in the beginning and 172.4MB in the end (delta: -93.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.53ms. Allocated memory is still 213.9MB. Free memory was 172.4MB in the beginning and 169.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.68ms. Allocated memory is still 213.9MB. Free memory was 169.3MB in the beginning and 167.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 598.26ms. Allocated memory is still 213.9MB. Free memory was 167.2MB in the beginning and 125.3MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3866.29ms. Allocated memory was 213.9MB in the beginning and 385.9MB in the end (delta: 172.0MB). Free memory was 125.3MB in the beginning and 343.1MB in the end (delta: -217.8MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. * Witness Printer took 48.41ms. Allocated memory is still 385.9MB. Free memory was 343.1MB in the beginning and 334.7MB 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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. - UnprovableResult [Line: 793]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 5 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: 3.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 12 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, InterpolantAutomatonStates: 28, 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.3s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-06-27 17:29:18,476 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