./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.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.graphml --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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:43:03,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:43:03,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:43:03,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:43:03,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:43:03,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:43:03,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:43:03,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:43:03,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:43:03,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:43:03,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:43:03,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:43:03,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:43:03,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:43:03,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:43:03,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:43:03,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:43:03,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:43:03,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:43:03,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:43:03,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:43:03,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:43:03,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:43:03,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:43:03,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:43:03,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:43:03,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:43:03,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:43:03,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:43:03,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:43:03,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:43:03,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:43:03,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:43:03,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:43:03,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:43:03,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:43:03,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:43:03,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:43:03,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:43:03,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:43:03,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:43:03,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:43:03,183 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:43:03,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:43:03,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:43:03,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:43:03,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:43:03,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:43:03,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:43:03,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:43:03,186 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:43:03,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:43:03,186 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:43:03,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:43:03,188 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:43:03,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:43:03,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:43:03,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:43:03,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:43:03,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:03,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:43:03,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:43:03,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:43:03,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:43:03,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:43:03,189 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:43:03,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:43:03,190 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:43:03,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:43:03,190 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:43:03,190 INFO L138 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.graphml 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:43:03,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:43:03,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:43:03,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:43:03,467 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:43:03,468 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:43:03,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-09-01 09:43:04,462 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:43:04,705 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:43:04,705 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-09-01 09:43:04,723 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5005d4ddc/5aac532770a642be8f94d3314b7ef028/FLAG023fdc0fd [2023-09-01 09:43:04,744 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5005d4ddc/5aac532770a642be8f94d3314b7ef028 [2023-09-01 09:43:04,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:43:04,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:43:04,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:04,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:43:04,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:43:04,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:04" (1/1) ... [2023-09-01 09:43:04,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132fd46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:04, skipping insertion in model container [2023-09-01 09:43:04,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:04" (1/1) ... [2023-09-01 09:43:04,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:43:04,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:43:04,910 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-09-01 09:43:05,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:05,081 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:43:05,091 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-09-01 09:43:05,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:05,190 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:05,191 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:05,196 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:43:05,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05 WrapperNode [2023-09-01 09:43:05,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:05,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:05,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:43:05,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:43:05,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,263 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-09-01 09:43:05,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:05,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:43:05,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:43:05,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:43:05,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,306 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:43:05,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:43:05,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:43:05,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:43:05,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (1/1) ... [2023-09-01 09:43:05,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:43:05,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:43:05,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:43:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:43:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:43:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:43:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:43:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:43:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:43:05,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:43:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:43:05,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:43:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:43:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:43:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:43:05,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:43:05,384 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:43:05,509 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:43:05,510 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:43:05,772 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:43:05,863 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:43:05,863 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:43:05,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:05 BoogieIcfgContainer [2023-09-01 09:43:05,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:43:05,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:43:05,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:43:05,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:43:05,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:43:04" (1/3) ... [2023-09-01 09:43:05,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@840c2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:05, skipping insertion in model container [2023-09-01 09:43:05,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:05" (2/3) ... [2023-09-01 09:43:05,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@840c2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:05, skipping insertion in model container [2023-09-01 09:43:05,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:05" (3/3) ... [2023-09-01 09:43:05,872 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-09-01 09:43:05,879 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:43:05,887 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:43:05,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:43:05,887 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:43:05,936 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:43:05,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2023-09-01 09:43:06,025 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-09-01 09:43:06,025 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:06,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-09-01 09:43:06,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2023-09-01 09:43:06,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2023-09-01 09:43:06,039 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:43:06,050 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2023-09-01 09:43:06,053 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2023-09-01 09:43:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2023-09-01 09:43:06,086 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2023-09-01 09:43:06,086 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:06,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-09-01 09:43:06,088 INFO L119 LiptonReduction]: Number of co-enabled transitions 1104 [2023-09-01 09:43:08,564 INFO L134 LiptonReduction]: Checked pairs total: 3298 [2023-09-01 09:43:08,564 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-09-01 09:43:08,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:43:08,576 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=LoopsAndPotentialCycles, 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;@635f04ee, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:43:08,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:43:08,579 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-09-01 09:43:08,579 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:08,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:08,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:43:08,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:08,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash 404605, now seen corresponding path program 1 times [2023-09-01 09:43:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:08,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791168910] [2023-09-01 09:43:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791168910] [2023-09-01 09:43:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791168910] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:08,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:08,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:43:08,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071295099] [2023-09-01 09:43:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:08,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:43:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:43:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:43:08,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 168 [2023-09-01 09:43:08,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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) [2023-09-01 09:43:08,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:08,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 168 [2023-09-01 09:43:08,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:08,960 INFO L130 PetriNetUnfolder]: 204/393 cut-off events. [2023-09-01 09:43:08,961 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 09:43:08,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 393 events. 204/393 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1788 event pairs, 24 based on Foata normal form. 20/372 useless extension candidates. Maximal degree in co-relation 750. Up to 292 conditions per place. [2023-09-01 09:43:08,964 INFO L137 encePairwiseOnDemand]: 164/168 looper letters, 23 selfloop transitions, 2 changer transitions 4/31 dead transitions. [2023-09-01 09:43:08,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 129 flow [2023-09-01 09:43:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2023-09-01 09:43:08,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2023-09-01 09:43:08,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2023-09-01 09:43:08,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2023-09-01 09:43:08,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:08,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2023-09-01 09:43:08,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2023-09-01 09:43:08,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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) [2023-09-01 09:43:08,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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) [2023-09-01 09:43:08,992 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 266 transitions. [2023-09-01 09:43:08,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 129 flow [2023-09-01 09:43:08,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:08,996 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-09-01 09:43:08,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-09-01 09:43:09,000 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-09-01 09:43:09,000 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-09-01 09:43:09,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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) [2023-09-01 09:43:09,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:09,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:09,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:43:09,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:09,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1148612633, now seen corresponding path program 1 times [2023-09-01 09:43:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397541863] [2023-09-01 09:43:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:09,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397541863] [2023-09-01 09:43:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397541863] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:09,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:43:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403849601] [2023-09-01 09:43:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:09,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:09,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:09,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 168 [2023-09-01 09:43:09,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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) [2023-09-01 09:43:09,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:09,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 168 [2023-09-01 09:43:09,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:09,298 INFO L130 PetriNetUnfolder]: 167/306 cut-off events. [2023-09-01 09:43:09,298 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-09-01 09:43:09,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 306 events. 167/306 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1146 event pairs, 53 based on Foata normal form. 24/329 useless extension candidates. Maximal degree in co-relation 648. Up to 197 conditions per place. [2023-09-01 09:43:09,302 INFO L137 encePairwiseOnDemand]: 164/168 looper letters, 19 selfloop transitions, 2 changer transitions 12/34 dead transitions. [2023-09-01 09:43:09,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 148 flow [2023-09-01 09:43:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-09-01 09:43:09,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2023-09-01 09:43:09,305 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-09-01 09:43:09,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-09-01 09:43:09,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:09,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-09-01 09:43:09,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 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) [2023-09-01 09:43:09,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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) [2023-09-01 09:43:09,310 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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) [2023-09-01 09:43:09,311 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 415 transitions. [2023-09-01 09:43:09,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 148 flow [2023-09-01 09:43:09,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:09,312 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 50 flow [2023-09-01 09:43:09,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2023-09-01 09:43:09,313 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-09-01 09:43:09,313 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 50 flow [2023-09-01 09:43:09,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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) [2023-09-01 09:43:09,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:09,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:09,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:43:09,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:09,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash -13258289, now seen corresponding path program 1 times [2023-09-01 09:43:09,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:09,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932256565] [2023-09-01 09:43:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932256565] [2023-09-01 09:43:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932256565] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:09,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:43:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804694258] [2023-09-01 09:43:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:09,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:43:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:09,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:43:09,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:43:09,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 168 [2023-09-01 09:43:09,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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) [2023-09-01 09:43:09,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:09,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 168 [2023-09-01 09:43:09,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:09,552 INFO L130 PetriNetUnfolder]: 44/108 cut-off events. [2023-09-01 09:43:09,553 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-09-01 09:43:09,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 108 events. 44/108 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 314 event pairs, 14 based on Foata normal form. 12/119 useless extension candidates. Maximal degree in co-relation 242. Up to 75 conditions per place. [2023-09-01 09:43:09,554 INFO L137 encePairwiseOnDemand]: 164/168 looper letters, 21 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-09-01 09:43:09,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 118 flow [2023-09-01 09:43:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-09-01 09:43:09,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501984126984127 [2023-09-01 09:43:09,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-09-01 09:43:09,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-09-01 09:43:09,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:09,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-09-01 09:43:09,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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) [2023-09-01 09:43:09,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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) [2023-09-01 09:43:09,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 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) [2023-09-01 09:43:09,557 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 50 flow. Second operand 3 states and 253 transitions. [2023-09-01 09:43:09,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 118 flow [2023-09-01 09:43:09,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 110 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:09,558 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 61 flow [2023-09-01 09:43:09,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-09-01 09:43:09,559 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-09-01 09:43:09,561 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 61 flow [2023-09-01 09:43:09,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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) [2023-09-01 09:43:09,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:09,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:09,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:43:09,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:09,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1304679194, now seen corresponding path program 1 times [2023-09-01 09:43:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:09,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674423558] [2023-09-01 09:43:09,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:09,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:09,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674423558] [2023-09-01 09:43:09,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674423558] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:09,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:09,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972080469] [2023-09-01 09:43:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:09,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:09,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:09,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 168 [2023-09-01 09:43:09,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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) [2023-09-01 09:43:09,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:09,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 168 [2023-09-01 09:43:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:09,802 INFO L130 PetriNetUnfolder]: 18/56 cut-off events. [2023-09-01 09:43:09,802 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 09:43:09,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 56 events. 18/56 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 121 event pairs, 10 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 136. Up to 29 conditions per place. [2023-09-01 09:43:09,803 INFO L137 encePairwiseOnDemand]: 164/168 looper letters, 19 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-09-01 09:43:09,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 125 flow [2023-09-01 09:43:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:43:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:43:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-09-01 09:43:09,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2023-09-01 09:43:09,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-09-01 09:43:09,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-09-01 09:43:09,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:09,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-09-01 09:43:09,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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) [2023-09-01 09:43:09,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 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) [2023-09-01 09:43:09,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 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) [2023-09-01 09:43:09,810 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 61 flow. Second operand 4 states and 329 transitions. [2023-09-01 09:43:09,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 125 flow [2023-09-01 09:43:09,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 118 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:09,811 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 70 flow [2023-09-01 09:43:09,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-09-01 09:43:09,813 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-09-01 09:43:09,813 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 70 flow [2023-09-01 09:43:09,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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) [2023-09-01 09:43:09,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:09,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:09,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:43:09,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:09,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 380260139, now seen corresponding path program 1 times [2023-09-01 09:43:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068480880] [2023-09-01 09:43:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068480880] [2023-09-01 09:43:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068480880] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573152177] [2023-09-01 09:43:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:10,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:43:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:43:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:43:10,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 168 [2023-09-01 09:43:10,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 71.42857142857143) internal successors, (500), 7 states have internal predecessors, (500), 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) [2023-09-01 09:43:10,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:10,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 168 [2023-09-01 09:43:10,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:10,602 INFO L130 PetriNetUnfolder]: 29/83 cut-off events. [2023-09-01 09:43:10,602 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2023-09-01 09:43:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 83 events. 29/83 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 209 event pairs, 0 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 216. Up to 29 conditions per place. [2023-09-01 09:43:10,603 INFO L137 encePairwiseOnDemand]: 159/168 looper letters, 26 selfloop transitions, 8 changer transitions 13/47 dead transitions. [2023-09-01 09:43:10,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 260 flow [2023-09-01 09:43:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 09:43:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 09:43:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 734 transitions. [2023-09-01 09:43:10,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369047619047619 [2023-09-01 09:43:10,605 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 734 transitions. [2023-09-01 09:43:10,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 734 transitions. [2023-09-01 09:43:10,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:10,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 734 transitions. [2023-09-01 09:43:10,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 73.4) internal successors, (734), 10 states have internal predecessors, (734), 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) [2023-09-01 09:43:10,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 168.0) internal successors, (1848), 11 states have internal predecessors, (1848), 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) [2023-09-01 09:43:10,609 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 168.0) internal successors, (1848), 11 states have internal predecessors, (1848), 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) [2023-09-01 09:43:10,609 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 70 flow. Second operand 10 states and 734 transitions. [2023-09-01 09:43:10,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 260 flow [2023-09-01 09:43:10,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 240 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:10,610 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 99 flow [2023-09-01 09:43:10,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=99, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2023-09-01 09:43:10,611 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2023-09-01 09:43:10,611 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 99 flow [2023-09-01 09:43:10,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.42857142857143) internal successors, (500), 7 states have internal predecessors, (500), 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) [2023-09-01 09:43:10,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:10,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:10,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:43:10,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:10,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1812338683, now seen corresponding path program 2 times [2023-09-01 09:43:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316383128] [2023-09-01 09:43:10,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:10,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:10,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316383128] [2023-09-01 09:43:10,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316383128] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:10,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:10,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557770229] [2023-09-01 09:43:10,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:10,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:43:10,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:10,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:43:10,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:43:10,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 168 [2023-09-01 09:43:10,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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) [2023-09-01 09:43:10,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:10,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 168 [2023-09-01 09:43:10,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:10,881 INFO L130 PetriNetUnfolder]: 27/90 cut-off events. [2023-09-01 09:43:10,881 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2023-09-01 09:43:10,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 90 events. 27/90 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 5 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 282. Up to 37 conditions per place. [2023-09-01 09:43:10,881 INFO L137 encePairwiseOnDemand]: 162/168 looper letters, 18 selfloop transitions, 3 changer transitions 20/41 dead transitions. [2023-09-01 09:43:10,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 260 flow [2023-09-01 09:43:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:43:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:43:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 534 transitions. [2023-09-01 09:43:10,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45408163265306123 [2023-09-01 09:43:10,883 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 534 transitions. [2023-09-01 09:43:10,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 534 transitions. [2023-09-01 09:43:10,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:10,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 534 transitions. [2023-09-01 09:43:10,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.28571428571429) internal successors, (534), 7 states have internal predecessors, (534), 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) [2023-09-01 09:43:10,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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) [2023-09-01 09:43:10,885 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 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) [2023-09-01 09:43:10,885 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 99 flow. Second operand 7 states and 534 transitions. [2023-09-01 09:43:10,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 260 flow [2023-09-01 09:43:10,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 246 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:10,887 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 84 flow [2023-09-01 09:43:10,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=84, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2023-09-01 09:43:10,887 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2023-09-01 09:43:10,888 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 84 flow [2023-09-01 09:43:10,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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) [2023-09-01 09:43:10,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:10,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:10,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:43:10,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:43:10,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2033638101, now seen corresponding path program 3 times [2023-09-01 09:43:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:10,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147848810] [2023-09-01 09:43:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:10,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:43:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:10,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:43:10,947 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:43:10,948 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:43:10,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-09-01 09:43:10,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:43:10,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:43:10,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-01 09:43:10,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:43:10,950 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-09-01 09:43:10,953 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:43:10,953 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:43:11,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:43:11 BasicIcfg [2023-09-01 09:43:11,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:43:11,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:43:11,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:43:11,001 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:43:11,002 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:05" (3/4) ... [2023-09-01 09:43:11,003 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:43:11,072 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:43:11,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:43:11,072 INFO L158 Benchmark]: Toolchain (without parser) took 6325.22ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 52.1MB in the beginning and 71.8MB in the end (delta: -19.7MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2023-09-01 09:43:11,073 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:43:11,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.24ms. Allocated memory is still 75.5MB. Free memory was 51.9MB in the beginning and 47.9MB in the end (delta: 4.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-09-01 09:43:11,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.37ms. Allocated memory is still 75.5MB. Free memory was 47.9MB in the beginning and 45.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:43:11,073 INFO L158 Benchmark]: Boogie Preprocessor took 45.68ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 43.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:43:11,073 INFO L158 Benchmark]: RCFGBuilder took 555.32ms. Allocated memory is still 75.5MB. Free memory was 43.6MB in the beginning and 34.2MB in the end (delta: 9.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2023-09-01 09:43:11,073 INFO L158 Benchmark]: TraceAbstraction took 5133.84ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 33.5MB in the beginning and 79.2MB in the end (delta: -45.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2023-09-01 09:43:11,074 INFO L158 Benchmark]: Witness Printer took 70.80ms. Allocated memory is still 161.5MB. Free memory was 79.2MB in the beginning and 71.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-09-01 09:43:11,075 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82ms. Allocated memory is still 56.6MB. Free memory was 34.7MB in the beginning and 34.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.24ms. Allocated memory is still 75.5MB. Free memory was 51.9MB in the beginning and 47.9MB in the end (delta: 4.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.37ms. Allocated memory is still 75.5MB. Free memory was 47.9MB in the beginning and 45.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.68ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 43.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 555.32ms. Allocated memory is still 75.5MB. Free memory was 43.6MB in the beginning and 34.2MB in the end (delta: 9.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5133.84ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 33.5MB in the beginning and 79.2MB in the end (delta: -45.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 70.80ms. Allocated memory is still 161.5MB. Free memory was 79.2MB in the beginning and 71.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 93 PlacesBefore, 27 PlacesAfterwards, 88 TransitionsBefore, 21 TransitionsAfterwards, 1104 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 3298 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1322, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 591, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1322, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 591, unknown conditional: 0, unknown unconditional: 591] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 64 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, InterpolantAutomatonStates: 32, 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, 1.2s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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! [2023-09-01 09:43:11,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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