./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.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-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.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 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:10:22,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:10:22,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:10:22,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:10:22,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:10:22,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:10:22,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:10:22,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:10:22,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:10:22,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:10:22,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:10:22,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:10:22,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:10:22,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:10:22,913 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:10:22,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:10:22,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:10:22,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:10:22,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:10:22,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:10:22,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:10:22,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:10:22,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:10:22,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:10:22,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:10:22,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:10:22,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:10:22,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:10:22,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:10:22,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:10:22,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:10:22,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:10:22,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:10:22,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:10:22,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:10:22,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:10:22,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:10:22,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:10:22,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:10:22,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:10:22,919 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:10:22,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:10:22,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:10:22,920 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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2024-01-27 16:10:23,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:10:23,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:10:23,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:10:23,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:10:23,183 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:10:23,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-01-27 16:10:24,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:10:24,365 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:10:24,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-01-27 16:10:24,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab65fc87/096bd4386d284f82b228ce049bab9fa6/FLAG97b639307 [2024-01-27 16:10:24,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab65fc87/096bd4386d284f82b228ce049bab9fa6 [2024-01-27 16:10:24,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:10:24,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:10:24,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:10:24,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:10:24,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:10:24,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cca318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24, skipping insertion in model container [2024-01-27 16:10:24,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,448 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:10:24,567 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-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-01-27 16:10:24,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:10:24,724 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:10:24,732 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-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-01-27 16:10:24,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:10:24,794 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:10:24,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24 WrapperNode [2024-01-27 16:10:24,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:10:24,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:10:24,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:10:24,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:10:24,801 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:10:24" (1/1) ... [2024-01-27 16:10:24,825 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:10:24" (1/1) ... [2024-01-27 16:10:24,850 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2024-01-27 16:10:24,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:10:24,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:10:24,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:10:24,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:10:24,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,875 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 16:10:24,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:10:24,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:10:24,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:10:24,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:10:24,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (1/1) ... [2024-01-27 16:10:24,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:10:24,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:10:24,946 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:10:24,948 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:10:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:10:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:10:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:10:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:10:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:10:24,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:10:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:10:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:10:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:10:24,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:10:24,983 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:10:24,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:10:24,983 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:10:24,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:10:24,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:10:24,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:10:24,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:10:24,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:10:24,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:10:24,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:10:24,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:10:24,986 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:10:25,112 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:10:25,114 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:10:25,416 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:10:25,417 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:10:25,559 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:10:25,560 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:10:25,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:10:25 BoogieIcfgContainer [2024-01-27 16:10:25,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:10:25,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:10:25,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:10:25,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:10:25,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:10:24" (1/3) ... [2024-01-27 16:10:25,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d6606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:10:25, skipping insertion in model container [2024-01-27 16:10:25,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:24" (2/3) ... [2024-01-27 16:10:25,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d6606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:10:25, skipping insertion in model container [2024-01-27 16:10:25,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:10:25" (3/3) ... [2024-01-27 16:10:25,568 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-01-27 16:10:25,574 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:10:25,581 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:10:25,582 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:10:25,582 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:10:25,620 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:10:25,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2024-01-27 16:10:25,677 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2024-01-27 16:10:25,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:10:25,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-01-27 16:10:25,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2024-01-27 16:10:25,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2024-01-27 16:10:25,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:10:25,702 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;@4f89835a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:10:25,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:10:25,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:10:25,727 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-27 16:10:25,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:10:25,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:25,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 16:10:25,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:25,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash 11571006, now seen corresponding path program 1 times [2024-01-27 16:10:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:25,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315342299] [2024-01-27 16:10:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:25,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:26,100 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:10:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315342299] [2024-01-27 16:10:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315342299] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:10:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891575986] [2024-01-27 16:10:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:26,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:10:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:10:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:10:26,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-01-27 16:10:26,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:10:26,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:26,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-01-27 16:10:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:26,419 INFO L124 PetriNetUnfolderBase]: 617/1162 cut-off events. [2024-01-27 16:10:26,420 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 16:10:26,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 1162 events. 617/1162 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7384 event pairs, 95 based on Foata normal form. 45/1179 useless extension candidates. Maximal degree in co-relation 2128. Up to 763 conditions per place. [2024-01-27 16:10:26,432 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-01-27 16:10:26,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 183 flow [2024-01-27 16:10:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:10:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:10:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-01-27 16:10:26,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2024-01-27 16:10:26,445 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 99 transitions. [2024-01-27 16:10:26,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 183 flow [2024-01-27 16:10:26,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:10:26,452 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-01-27 16:10:26,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-01-27 16:10:26,459 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2024-01-27 16:10:26,459 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-01-27 16:10:26,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:10:26,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:26,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:26,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:10:26,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:26,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:26,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2005913312, now seen corresponding path program 1 times [2024-01-27 16:10:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:26,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211524478] [2024-01-27 16:10:26,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:26,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:26,676 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:10:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211524478] [2024-01-27 16:10:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211524478] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:26,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:26,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:10:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087415472] [2024-01-27 16:10:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:26,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:10:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:26,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:10:26,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:10:26,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-01-27 16:10:26,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:10:26,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:26,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-01-27 16:10:26,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:27,047 INFO L124 PetriNetUnfolderBase]: 1367/2387 cut-off events. [2024-01-27 16:10:27,047 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-01-27 16:10:27,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 2387 events. 1367/2387 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15344 event pairs, 189 based on Foata normal form. 0/2317 useless extension candidates. Maximal degree in co-relation 4641. Up to 1147 conditions per place. [2024-01-27 16:10:27,055 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 30 selfloop transitions, 2 changer transitions 44/90 dead transitions. [2024-01-27 16:10:27,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 356 flow [2024-01-27 16:10:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:10:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:10:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-01-27 16:10:27,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2024-01-27 16:10:27,057 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 8 states and 214 transitions. [2024-01-27 16:10:27,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 356 flow [2024-01-27 16:10:27,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:10:27,059 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 92 flow [2024-01-27 16:10:27,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2024-01-27 16:10:27,060 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2024-01-27 16:10:27,060 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 92 flow [2024-01-27 16:10:27,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:10:27,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:27,061 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:10:27,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:10:27,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:27,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1368093470, now seen corresponding path program 1 times [2024-01-27 16:10:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:27,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397662631] [2024-01-27 16:10:27,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:27,190 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:10:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397662631] [2024-01-27 16:10:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397662631] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:27,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:10:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652052708] [2024-01-27 16:10:27,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:27,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:10:27,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:10:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:10:27,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-01-27 16:10:27,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:10:27,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:27,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-01-27 16:10:27,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:27,466 INFO L124 PetriNetUnfolderBase]: 1043/1763 cut-off events. [2024-01-27 16:10:27,467 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2024-01-27 16:10:27,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 1763 events. 1043/1763 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10378 event pairs, 205 based on Foata normal form. 60/1789 useless extension candidates. Maximal degree in co-relation 3751. Up to 1065 conditions per place. [2024-01-27 16:10:27,474 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 27 selfloop transitions, 2 changer transitions 31/74 dead transitions. [2024-01-27 16:10:27,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 300 flow [2024-01-27 16:10:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:10:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:10:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-01-27 16:10:27,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6156462585034014 [2024-01-27 16:10:27,478 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 92 flow. Second operand 7 states and 181 transitions. [2024-01-27 16:10:27,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 300 flow [2024-01-27 16:10:27,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 280 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-01-27 16:10:27,489 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 96 flow [2024-01-27 16:10:27,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-01-27 16:10:27,490 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-01-27 16:10:27,490 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 96 flow [2024-01-27 16:10:27,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:10:27,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:27,491 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] [2024-01-27 16:10:27,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:10:27,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:27,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1295411154, now seen corresponding path program 1 times [2024-01-27 16:10:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:27,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891896345] [2024-01-27 16:10:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:27,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:27,637 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:10:27,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:27,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891896345] [2024-01-27 16:10:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891896345] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:10:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141783621] [2024-01-27 16:10:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:27,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:10:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:10:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:10:27,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-01-27 16:10:27,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:10:27,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:27,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-01-27 16:10:27,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:27,879 INFO L124 PetriNetUnfolderBase]: 1318/2278 cut-off events. [2024-01-27 16:10:27,879 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2024-01-27 16:10:27,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4844 conditions, 2278 events. 1318/2278 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14115 event pairs, 188 based on Foata normal form. 100/2319 useless extension candidates. Maximal degree in co-relation 4828. Up to 1053 conditions per place. [2024-01-27 16:10:27,891 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 41 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-01-27 16:10:27,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 244 flow [2024-01-27 16:10:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:10:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:10:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-01-27 16:10:27,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2024-01-27 16:10:27,892 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 96 flow. Second operand 4 states and 117 transitions. [2024-01-27 16:10:27,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 244 flow [2024-01-27 16:10:27,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 232 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-01-27 16:10:27,902 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 118 flow [2024-01-27 16:10:27,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-01-27 16:10:27,903 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-01-27 16:10:27,903 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 118 flow [2024-01-27 16:10:27,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:10:27,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:27,903 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, 1, 1] [2024-01-27 16:10:27,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:10:27,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:27,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 324712996, now seen corresponding path program 1 times [2024-01-27 16:10:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880108581] [2024-01-27 16:10:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:28,027 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:10:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880108581] [2024-01-27 16:10:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880108581] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:28,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:28,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:10:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314472006] [2024-01-27 16:10:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:28,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:10:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:28,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:10:28,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:10:28,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-01-27 16:10:28,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:10:28,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:28,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-01-27 16:10:28,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:28,220 INFO L124 PetriNetUnfolderBase]: 886/1534 cut-off events. [2024-01-27 16:10:28,221 INFO L125 PetriNetUnfolderBase]: For 451/451 co-relation queries the response was YES. [2024-01-27 16:10:28,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 1534 events. 886/1534 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8308 event pairs, 100 based on Foata normal form. 82/1568 useless extension candidates. Maximal degree in co-relation 3588. Up to 465 conditions per place. [2024-01-27 16:10:28,227 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 52 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-01-27 16:10:28,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 333 flow [2024-01-27 16:10:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:10:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:10:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-01-27 16:10:28,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2024-01-27 16:10:28,229 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 118 flow. Second operand 5 states and 148 transitions. [2024-01-27 16:10:28,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 333 flow [2024-01-27 16:10:28,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 323 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 16:10:28,231 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 158 flow [2024-01-27 16:10:28,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-01-27 16:10:28,232 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2024-01-27 16:10:28,232 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 158 flow [2024-01-27 16:10:28,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:10:28,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:28,233 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, 1, 1, 1, 1, 1] [2024-01-27 16:10:28,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:10:28,233 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:28,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 13587097, now seen corresponding path program 1 times [2024-01-27 16:10:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595341629] [2024-01-27 16:10:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:28,394 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:10:28,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595341629] [2024-01-27 16:10:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595341629] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:10:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478100215] [2024-01-27 16:10:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:28,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:10:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:10:28,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:10:28,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-01-27 16:10:28,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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:10:28,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:28,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-01-27 16:10:28,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:28,548 INFO L124 PetriNetUnfolderBase]: 557/939 cut-off events. [2024-01-27 16:10:28,548 INFO L125 PetriNetUnfolderBase]: For 764/764 co-relation queries the response was YES. [2024-01-27 16:10:28,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 939 events. 557/939 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4292 event pairs, 83 based on Foata normal form. 40/937 useless extension candidates. Maximal degree in co-relation 2444. Up to 308 conditions per place. [2024-01-27 16:10:28,553 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 45 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-01-27 16:10:28,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 340 flow [2024-01-27 16:10:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:10:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:10:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-01-27 16:10:28,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-01-27 16:10:28,554 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 158 flow. Second operand 6 states and 161 transitions. [2024-01-27 16:10:28,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 340 flow [2024-01-27 16:10:28,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 307 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-01-27 16:10:28,557 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2024-01-27 16:10:28,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-01-27 16:10:28,558 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2024-01-27 16:10:28,558 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2024-01-27 16:10:28,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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:10:28,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:28,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:28,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:10:28,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:28,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash 746412367, now seen corresponding path program 1 times [2024-01-27 16:10:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:28,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470225290] [2024-01-27 16:10:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:29,206 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:10:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:29,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470225290] [2024-01-27 16:10:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470225290] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:10:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732460995] [2024-01-27 16:10:29,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:10:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:10:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:10:29,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2024-01-27 16:10:29,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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:10:29,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:29,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2024-01-27 16:10:29,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:29,491 INFO L124 PetriNetUnfolderBase]: 614/1143 cut-off events. [2024-01-27 16:10:29,491 INFO L125 PetriNetUnfolderBase]: For 733/757 co-relation queries the response was YES. [2024-01-27 16:10:29,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 1143 events. 614/1143 cut-off events. For 733/757 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6372 event pairs, 122 based on Foata normal form. 8/1080 useless extension candidates. Maximal degree in co-relation 2789. Up to 312 conditions per place. [2024-01-27 16:10:29,497 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 41 selfloop transitions, 5 changer transitions 24/91 dead transitions. [2024-01-27 16:10:29,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 91 transitions, 430 flow [2024-01-27 16:10:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:10:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:10:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-01-27 16:10:29,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6164021164021164 [2024-01-27 16:10:29,498 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 9 states and 233 transitions. [2024-01-27 16:10:29,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 91 transitions, 430 flow [2024-01-27 16:10:29,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 358 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-01-27 16:10:29,502 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 145 flow [2024-01-27 16:10:29,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2024-01-27 16:10:29,503 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2024-01-27 16:10:29,503 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 145 flow [2024-01-27 16:10:29,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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:10:29,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:29,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:29,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:10:29,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:29,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash -29319235, now seen corresponding path program 2 times [2024-01-27 16:10:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078913041] [2024-01-27 16:10:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:29,667 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:10:29,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078913041] [2024-01-27 16:10:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078913041] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:29,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:29,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:10:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609204432] [2024-01-27 16:10:29,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:29,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:10:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:29,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:10:29,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:10:29,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2024-01-27 16:10:29,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:10:29,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:29,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2024-01-27 16:10:29,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:29,857 INFO L124 PetriNetUnfolderBase]: 1007/1869 cut-off events. [2024-01-27 16:10:29,857 INFO L125 PetriNetUnfolderBase]: For 412/438 co-relation queries the response was YES. [2024-01-27 16:10:29,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4221 conditions, 1869 events. 1007/1869 cut-off events. For 412/438 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11757 event pairs, 467 based on Foata normal form. 9/1729 useless extension candidates. Maximal degree in co-relation 4204. Up to 801 conditions per place. [2024-01-27 16:10:29,865 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 33 selfloop transitions, 2 changer transitions 16/70 dead transitions. [2024-01-27 16:10:29,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 327 flow [2024-01-27 16:10:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:10:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:10:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-01-27 16:10:29,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-01-27 16:10:29,867 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 145 flow. Second operand 5 states and 126 transitions. [2024-01-27 16:10:29,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 327 flow [2024-01-27 16:10:29,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 306 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-01-27 16:10:29,869 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 144 flow [2024-01-27 16:10:29,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-01-27 16:10:29,869 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2024-01-27 16:10:29,870 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 144 flow [2024-01-27 16:10:29,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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:10:29,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:29,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:29,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:10:29,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:29,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1064317873, now seen corresponding path program 3 times [2024-01-27 16:10:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:29,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750420639] [2024-01-27 16:10:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:30,039 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:10:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750420639] [2024-01-27 16:10:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750420639] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:30,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:10:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535129837] [2024-01-27 16:10:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:30,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:10:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:10:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:10:30,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-01-27 16:10:30,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:10:30,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:30,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-01-27 16:10:30,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:30,278 INFO L124 PetriNetUnfolderBase]: 1172/2100 cut-off events. [2024-01-27 16:10:30,279 INFO L125 PetriNetUnfolderBase]: For 433/435 co-relation queries the response was YES. [2024-01-27 16:10:30,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 2100 events. 1172/2100 cut-off events. For 433/435 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11885 event pairs, 286 based on Foata normal form. 8/2018 useless extension candidates. Maximal degree in co-relation 4789. Up to 913 conditions per place. [2024-01-27 16:10:30,287 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 44 selfloop transitions, 9 changer transitions 19/87 dead transitions. [2024-01-27 16:10:30,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 426 flow [2024-01-27 16:10:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:10:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:10:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-01-27 16:10:30,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2024-01-27 16:10:30,288 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 144 flow. Second operand 7 states and 149 transitions. [2024-01-27 16:10:30,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 426 flow [2024-01-27 16:10:30,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 404 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-27 16:10:30,290 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 199 flow [2024-01-27 16:10:30,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-01-27 16:10:30,291 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2024-01-27 16:10:30,291 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 199 flow [2024-01-27 16:10:30,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:10:30,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:30,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:30,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:10:30,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:30,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash 106410955, now seen corresponding path program 4 times [2024-01-27 16:10:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:30,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921796761] [2024-01-27 16:10:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:30,466 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:10:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:30,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921796761] [2024-01-27 16:10:30,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921796761] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:30,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:10:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541717440] [2024-01-27 16:10:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:30,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:10:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:10:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:10:30,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-01-27 16:10:30,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:10:30,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:30,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-01-27 16:10:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:30,786 INFO L124 PetriNetUnfolderBase]: 1409/2554 cut-off events. [2024-01-27 16:10:30,787 INFO L125 PetriNetUnfolderBase]: For 1012/1014 co-relation queries the response was YES. [2024-01-27 16:10:30,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6109 conditions, 2554 events. 1409/2554 cut-off events. For 1012/1014 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15525 event pairs, 358 based on Foata normal form. 8/2463 useless extension candidates. Maximal degree in co-relation 6092. Up to 888 conditions per place. [2024-01-27 16:10:30,794 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 34 selfloop transitions, 3 changer transitions 43/95 dead transitions. [2024-01-27 16:10:30,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 95 transitions, 506 flow [2024-01-27 16:10:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:10:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:10:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-01-27 16:10:30,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-01-27 16:10:30,796 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 199 flow. Second operand 8 states and 168 transitions. [2024-01-27 16:10:30,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 95 transitions, 506 flow [2024-01-27 16:10:30,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 500 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-27 16:10:30,798 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 163 flow [2024-01-27 16:10:30,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=163, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2024-01-27 16:10:30,801 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2024-01-27 16:10:30,801 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 163 flow [2024-01-27 16:10:30,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:10:30,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:30,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:30,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:10:30,803 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:30,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1108137917, now seen corresponding path program 5 times [2024-01-27 16:10:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:30,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550081147] [2024-01-27 16:10:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:10:30,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:10:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:10:30,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:10:30,906 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:10:30,907 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:10:30,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:10:30,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:10:30,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 16:10:30,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:10:30,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:10:30,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:10:30,909 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:30,913 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:10:30,913 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:10:30,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:10:30 BasicIcfg [2024-01-27 16:10:30,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:10:30,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:10:30,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:10:30,966 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:10:30,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:10:25" (3/4) ... [2024-01-27 16:10:30,967 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:10:31,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:10:31,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:10:31,025 INFO L158 Benchmark]: Toolchain (without parser) took 6630.70ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 85.4MB in the beginning and 205.0MB in the end (delta: -119.6MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2024-01-27 16:10:31,025 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 67.4MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:10:31,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.59ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 118.1MB in the end (delta: -32.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-01-27 16:10:31,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.87ms. Allocated memory is still 155.2MB. Free memory was 118.1MB in the beginning and 115.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:10:31,025 INFO L158 Benchmark]: Boogie Preprocessor took 55.29ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 112.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:10:31,026 INFO L158 Benchmark]: RCFGBuilder took 654.14ms. Allocated memory is still 155.2MB. Free memory was 112.4MB in the beginning and 63.0MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-01-27 16:10:31,026 INFO L158 Benchmark]: TraceAbstraction took 5403.70ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 62.4MB in the beginning and 218.6MB in the end (delta: -156.2MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-01-27 16:10:31,026 INFO L158 Benchmark]: Witness Printer took 58.43ms. Allocated memory is still 323.0MB. Free memory was 218.6MB in the beginning and 205.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:10:31,027 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.15ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 67.4MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.59ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 118.1MB in the end (delta: -32.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.87ms. Allocated memory is still 155.2MB. Free memory was 118.1MB in the beginning and 115.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.29ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 112.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 654.14ms. Allocated memory is still 155.2MB. Free memory was 112.4MB in the beginning and 63.0MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5403.70ms. Allocated memory was 155.2MB in the beginning and 323.0MB in the end (delta: 167.8MB). Free memory was 62.4MB in the beginning and 218.6MB in the end (delta: -156.2MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Witness Printer took 58.43ms. Allocated memory is still 323.0MB. Free memory was 218.6MB in the beginning and 205.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - 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: 849]: 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: 853]: 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: 851]: 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 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 477 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1326 IncrementalHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 32 mSDtfsCounter, 1326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=9, InterpolantAutomatonStates: 62, 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, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 1226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-01-27 16:10:31,061 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