./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:00:40,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:00:40,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:00:40,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:00:40,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:00:40,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:00:40,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:00:40,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:00:40,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:00:40,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:00:40,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:00:40,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:00:40,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:00:40,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:00:40,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:00:40,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:00:40,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:00:40,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:00:40,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:00:40,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:00:40,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:00:40,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:00:40,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:00:40,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:00:40,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:00:40,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:00:40,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:00:40,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:00:40,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:00:40,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:00:40,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:00:40,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:00:40,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:00:40,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:00:40,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:00:40,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:00:40,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:00:40,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:00:40,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:00:40,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:00:40,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:00:40,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:00:40,351 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:00:40,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:00:40,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:00:40,353 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:00:40,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:00:40,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:00:40,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:00:40,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:00:40,354 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:00:40,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:00:40,355 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:00:40,355 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:00:40,356 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:00:40,357 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:00:40,357 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:00:40,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:00:40,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:00:40,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:00:40,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:00:40,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:00:40,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:00:40,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:00:40,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:00:40,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:00:40,358 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:00:40,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:00:40,359 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:00:40,359 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 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 -> TOGETHER [2023-08-30 03:00:40,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:00:40,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:00:40,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:00:40,703 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:00:40,704 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:00:40,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-30 03:00:41,797 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:00:42,062 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:00:42,062 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-30 03:00:42,079 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e403f9452/2e0a0695ef6a4a92bbf7313083a21a56/FLAGa0168f060 [2023-08-30 03:00:42,094 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e403f9452/2e0a0695ef6a4a92bbf7313083a21a56 [2023-08-30 03:00:42,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:00:42,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:00:42,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:00:42,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:00:42,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:00:42,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409a6c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42, skipping insertion in model container [2023-08-30 03:00:42,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:00:42,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:00:42,280 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/rfi006_power.oepc.i[994,1007] [2023-08-30 03:00:42,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:00:42,496 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:00:42,505 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/rfi006_power.oepc.i[994,1007] [2023-08-30 03:00:42,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:00:42,591 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:00:42,591 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:00:42,596 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:00:42,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42 WrapperNode [2023-08-30 03:00:42,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:00:42,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:00:42,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:00:42,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:00:42,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,661 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-08-30 03:00:42,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:00:42,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:00:42,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:00:42,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:00:42,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,707 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:00:42,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:00:42,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:00:42,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:00:42,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (1/1) ... [2023-08-30 03:00:42,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:00:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:00:42,773 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-08-30 03:00:42,821 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-08-30 03:00:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:00:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:00:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:00:42,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:00:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:00:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:00:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:00:42,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:00:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:00:42,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:00:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:00:42,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:00:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:00:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:00:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:00:42,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:00:42,864 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:00:42,975 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:00:42,977 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:00:43,394 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:00:43,820 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:00:43,820 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:00:43,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:00:43 BoogieIcfgContainer [2023-08-30 03:00:43,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:00:43,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:00:43,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:00:43,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:00:43,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:00:42" (1/3) ... [2023-08-30 03:00:43,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c36c5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:00:43, skipping insertion in model container [2023-08-30 03:00:43,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:00:42" (2/3) ... [2023-08-30 03:00:43,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c36c5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:00:43, skipping insertion in model container [2023-08-30 03:00:43,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:00:43" (3/3) ... [2023-08-30 03:00:43,830 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-08-30 03:00:43,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:00:43,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-08-30 03:00:43,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:00:43,956 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:00:43,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 174 transitions, 363 flow [2023-08-30 03:00:44,076 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2023-08-30 03:00:44,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:44,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 2/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 279 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-30 03:00:44,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 174 transitions, 363 flow [2023-08-30 03:00:44,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 171 transitions, 351 flow [2023-08-30 03:00:44,101 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:00:44,108 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 171 transitions, 351 flow [2023-08-30 03:00:44,111 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 171 transitions, 351 flow [2023-08-30 03:00:44,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 351 flow [2023-08-30 03:00:44,143 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2023-08-30 03:00:44,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:44,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 2/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 283 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-30 03:00:44,149 INFO L119 LiptonReduction]: Number of co-enabled transitions 6982 [2023-08-30 03:00:53,424 INFO L134 LiptonReduction]: Checked pairs total: 32691 [2023-08-30 03:00:53,424 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-30 03:00:53,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:00:53,437 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@755a6835, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:00:53,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-30 03:00:53,439 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:00:53,439 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:53,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:53,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:00:53,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:00:53,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1064, now seen corresponding path program 1 times [2023-08-30 03:00:53,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:53,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461241875] [2023-08-30 03:00:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:00:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461241875] [2023-08-30 03:00:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461241875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:53,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:00:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984859602] [2023-08-30 03:00:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:53,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:00:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:00:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:00:53,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 321 [2023-08-30 03:00:53,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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-08-30 03:00:53,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:53,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 321 [2023-08-30 03:00:53,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:55,668 INFO L130 PetriNetUnfolder]: 11260/15872 cut-off events. [2023-08-30 03:00:55,669 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 03:00:55,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31815 conditions, 15872 events. 11260/15872 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 99824 event pairs, 11260 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 31804. Up to 15867 conditions per place. [2023-08-30 03:00:55,777 INFO L137 encePairwiseOnDemand]: 291/321 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-30 03:00:55,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-30 03:00:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:00:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:00:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 320 transitions. [2023-08-30 03:00:55,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984423676012461 [2023-08-30 03:00:55,789 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 320 transitions. [2023-08-30 03:00:55,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 320 transitions. [2023-08-30 03:00:55,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:55,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 320 transitions. [2023-08-30 03:00:55,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 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-08-30 03:00:55,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 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-08-30 03:00:55,799 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 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-08-30 03:00:55,801 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 153 flow. Second operand 2 states and 320 transitions. [2023-08-30 03:00:55,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-30 03:00:55,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:00:55,806 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-30 03:00:55,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-30 03:00:55,811 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-30 03:00:55,811 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-30 03:00:55,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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-08-30 03:00:55,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:55,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:00:55,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:00:55,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:00:55,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1048916, now seen corresponding path program 1 times [2023-08-30 03:00:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376234730] [2023-08-30 03:00:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:00:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376234730] [2023-08-30 03:00:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376234730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:00:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287602102] [2023-08-30 03:00:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:55,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:00:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:55,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:00:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:00:56,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 321 [2023-08-30 03:00:56,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-08-30 03:00:56,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:56,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 321 [2023-08-30 03:00:56,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:57,463 INFO L130 PetriNetUnfolder]: 7440/11018 cut-off events. [2023-08-30 03:00:57,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:00:57,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22004 conditions, 11018 events. 7440/11018 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 70943 event pairs, 4668 based on Foata normal form. 0/6424 useless extension candidates. Maximal degree in co-relation 22001. Up to 6813 conditions per place. [2023-08-30 03:00:57,514 INFO L137 encePairwiseOnDemand]: 305/321 looper letters, 45 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2023-08-30 03:00:57,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 226 flow [2023-08-30 03:00:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:00:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:00:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-30 03:00:57,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43406022845275183 [2023-08-30 03:00:57,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-30 03:00:57,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-30 03:00:57,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:57,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-30 03:00:57,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-08-30 03:00:57,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:00:57,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:00:57,525 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 418 transitions. [2023-08-30 03:00:57,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 226 flow [2023-08-30 03:00:57,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:00:57,527 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 160 flow [2023-08-30 03:00:57,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-30 03:00:57,527 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -30 predicate places. [2023-08-30 03:00:57,528 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 160 flow [2023-08-30 03:00:57,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-08-30 03:00:57,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:57,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:00:57,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:00:57,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:00:57,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1048917, now seen corresponding path program 1 times [2023-08-30 03:00:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520404096] [2023-08-30 03:00:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:00:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520404096] [2023-08-30 03:00:57,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520404096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:57,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:00:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214072018] [2023-08-30 03:00:57,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:57,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:00:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:00:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:00:57,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-30 03:00:57,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-08-30 03:00:57,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:57,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-30 03:00:57,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:58,414 INFO L130 PetriNetUnfolder]: 2598/4056 cut-off events. [2023-08-30 03:00:58,414 INFO L131 PetriNetUnfolder]: For 1134/1134 co-relation queries the response was YES. [2023-08-30 03:00:58,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11323 conditions, 4056 events. 2598/4056 cut-off events. For 1134/1134 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23863 event pairs, 1942 based on Foata normal form. 1105/4677 useless extension candidates. Maximal degree in co-relation 11318. Up to 4004 conditions per place. [2023-08-30 03:00:58,431 INFO L137 encePairwiseOnDemand]: 313/321 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-30 03:00:58,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 222 flow [2023-08-30 03:00:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:00:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:00:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-30 03:00:58,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226375908618899 [2023-08-30 03:00:58,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-30 03:00:58,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-30 03:00:58,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:58,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-30 03:00:58,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-08-30 03:00:58,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:00:58,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:00:58,437 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 160 flow. Second operand 3 states and 407 transitions. [2023-08-30 03:00:58,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 222 flow [2023-08-30 03:00:58,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:00:58,446 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 130 flow [2023-08-30 03:00:58,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-30 03:00:58,448 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-30 03:00:58,450 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 130 flow [2023-08-30 03:00:58,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-08-30 03:00:58,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:58,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:58,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:00:58,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:00:58,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:58,452 INFO L85 PathProgramCache]: Analyzing trace with hash -969735936, now seen corresponding path program 1 times [2023-08-30 03:00:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:58,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484498739] [2023-08-30 03:00:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:00:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:58,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484498739] [2023-08-30 03:00:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484498739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:58,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:58,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:00:58,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038628738] [2023-08-30 03:00:58,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:58,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:00:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:00:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:00:58,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 321 [2023-08-30 03:00:58,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-08-30 03:00:58,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:58,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 321 [2023-08-30 03:00:58,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:59,132 INFO L130 PetriNetUnfolder]: 2518/4128 cut-off events. [2023-08-30 03:00:59,132 INFO L131 PetriNetUnfolder]: For 478/481 co-relation queries the response was YES. [2023-08-30 03:00:59,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10419 conditions, 4128 events. 2518/4128 cut-off events. For 478/481 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 26449 event pairs, 910 based on Foata normal form. 0/3267 useless extension candidates. Maximal degree in co-relation 10414. Up to 2515 conditions per place. [2023-08-30 03:00:59,157 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 65 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-30 03:00:59,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 364 flow [2023-08-30 03:00:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:00:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:00:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-30 03:00:59,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4454828660436137 [2023-08-30 03:00:59,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-30 03:00:59,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-30 03:00:59,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:00:59,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-30 03:00:59,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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-08-30 03:00:59,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:00:59,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:00:59,163 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 130 flow. Second operand 3 states and 429 transitions. [2023-08-30 03:00:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 364 flow [2023-08-30 03:00:59,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:00:59,165 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 142 flow [2023-08-30 03:00:59,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-30 03:00:59,166 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -35 predicate places. [2023-08-30 03:00:59,166 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 142 flow [2023-08-30 03:00:59,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-08-30 03:00:59,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:00:59,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:00:59,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:00:59,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:00:59,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:00:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash -969735733, now seen corresponding path program 1 times [2023-08-30 03:00:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:00:59,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210837800] [2023-08-30 03:00:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:00:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:00:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:00:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:00:59,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:00:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210837800] [2023-08-30 03:00:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210837800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:00:59,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:00:59,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:00:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177567224] [2023-08-30 03:00:59,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:00:59,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:00:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:00:59,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:00:59,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:00:59,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 321 [2023-08-30 03:00:59,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-08-30 03:00:59,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:00:59,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 321 [2023-08-30 03:00:59,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:00:59,991 INFO L130 PetriNetUnfolder]: 3386/5507 cut-off events. [2023-08-30 03:00:59,991 INFO L131 PetriNetUnfolder]: For 1675/1675 co-relation queries the response was YES. [2023-08-30 03:01:00,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14348 conditions, 5507 events. 3386/5507 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34873 event pairs, 743 based on Foata normal form. 0/4637 useless extension candidates. Maximal degree in co-relation 14342. Up to 4784 conditions per place. [2023-08-30 03:01:00,020 INFO L137 encePairwiseOnDemand]: 317/321 looper letters, 67 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-30 03:01:00,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 392 flow [2023-08-30 03:01:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:01:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:01:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-30 03:01:00,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4402907580477674 [2023-08-30 03:01:00,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-30 03:01:00,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-30 03:01:00,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:00,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-30 03:01:00,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-08-30 03:01:00,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:00,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:00,026 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 142 flow. Second operand 3 states and 424 transitions. [2023-08-30 03:01:00,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 392 flow [2023-08-30 03:01:00,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:01:00,028 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 155 flow [2023-08-30 03:01:00,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-08-30 03:01:00,029 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -34 predicate places. [2023-08-30 03:01:00,029 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 155 flow [2023-08-30 03:01:00,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-08-30 03:01:00,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:00,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:00,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:01:00,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:00,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1407984746, now seen corresponding path program 1 times [2023-08-30 03:01:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463239079] [2023-08-30 03:01:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463239079] [2023-08-30 03:01:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463239079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:00,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:01:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029760384] [2023-08-30 03:01:00,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:00,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:01:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:01:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:01:00,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 321 [2023-08-30 03:01:00,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 155 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 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-08-30 03:01:00,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:00,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 321 [2023-08-30 03:01:00,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:01,476 INFO L130 PetriNetUnfolder]: 3594/5864 cut-off events. [2023-08-30 03:01:01,476 INFO L131 PetriNetUnfolder]: For 1309/1314 co-relation queries the response was YES. [2023-08-30 03:01:01,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16024 conditions, 5864 events. 3594/5864 cut-off events. For 1309/1314 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 38517 event pairs, 1266 based on Foata normal form. 88/5018 useless extension candidates. Maximal degree in co-relation 16017. Up to 2025 conditions per place. [2023-08-30 03:01:01,528 INFO L137 encePairwiseOnDemand]: 312/321 looper letters, 87 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-08-30 03:01:01,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 536 flow [2023-08-30 03:01:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:01:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:01:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2023-08-30 03:01:01,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3987538940809969 [2023-08-30 03:01:01,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2023-08-30 03:01:01,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2023-08-30 03:01:01,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:01,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2023-08-30 03:01:01,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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-08-30 03:01:01,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 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-08-30 03:01:01,553 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 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-08-30 03:01:01,553 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 155 flow. Second operand 6 states and 768 transitions. [2023-08-30 03:01:01,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 536 flow [2023-08-30 03:01:01,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 99 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:01:01,556 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 198 flow [2023-08-30 03:01:01,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-30 03:01:01,558 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-30 03:01:01,559 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 198 flow [2023-08-30 03:01:01,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 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-08-30 03:01:01,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:01,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:01,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:01:01,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:01,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash 942183236, now seen corresponding path program 1 times [2023-08-30 03:01:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195575481] [2023-08-30 03:01:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:01,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:01,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195575481] [2023-08-30 03:01:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195575481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:01,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:01,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:01:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422595927] [2023-08-30 03:01:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:01:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:01:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:01:01,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 321 [2023-08-30 03:01:01,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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-08-30 03:01:01,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:01,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 321 [2023-08-30 03:01:01,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:02,523 INFO L130 PetriNetUnfolder]: 4399/6942 cut-off events. [2023-08-30 03:01:02,523 INFO L131 PetriNetUnfolder]: For 3878/3878 co-relation queries the response was YES. [2023-08-30 03:01:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19865 conditions, 6942 events. 4399/6942 cut-off events. For 3878/3878 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 43687 event pairs, 1235 based on Foata normal form. 44/6054 useless extension candidates. Maximal degree in co-relation 19858. Up to 4904 conditions per place. [2023-08-30 03:01:02,566 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 72 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-30 03:01:02,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 480 flow [2023-08-30 03:01:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:01:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:01:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-30 03:01:02,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43509865005192105 [2023-08-30 03:01:02,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-30 03:01:02,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-30 03:01:02,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:02,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-30 03:01:02,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-08-30 03:01:02,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:02,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:02,571 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 198 flow. Second operand 3 states and 419 transitions. [2023-08-30 03:01:02,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 480 flow [2023-08-30 03:01:02,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:01:02,602 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 205 flow [2023-08-30 03:01:02,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-30 03:01:02,603 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -30 predicate places. [2023-08-30 03:01:02,603 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 205 flow [2023-08-30 03:01:02,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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-08-30 03:01:02,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:02,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:02,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:01:02,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:02,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash -857094764, now seen corresponding path program 1 times [2023-08-30 03:01:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144762177] [2023-08-30 03:01:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144762177] [2023-08-30 03:01:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144762177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:02,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:01:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104510862] [2023-08-30 03:01:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:02,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:01:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:01:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:01:02,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 321 [2023-08-30 03:01:02,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-08-30 03:01:02,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:02,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 321 [2023-08-30 03:01:02,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:03,759 INFO L130 PetriNetUnfolder]: 3540/5784 cut-off events. [2023-08-30 03:01:03,759 INFO L131 PetriNetUnfolder]: For 3099/3104 co-relation queries the response was YES. [2023-08-30 03:01:03,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16787 conditions, 5784 events. 3540/5784 cut-off events. For 3099/3104 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 37951 event pairs, 1789 based on Foata normal form. 12/5003 useless extension candidates. Maximal degree in co-relation 16779. Up to 4162 conditions per place. [2023-08-30 03:01:03,799 INFO L137 encePairwiseOnDemand]: 318/321 looper letters, 67 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-30 03:01:03,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 443 flow [2023-08-30 03:01:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:01:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:01:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-30 03:01:03,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-30 03:01:03,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-30 03:01:03,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-30 03:01:03,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:03,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-30 03:01:03,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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-08-30 03:01:03,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:03,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:03,804 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 205 flow. Second operand 3 states and 428 transitions. [2023-08-30 03:01:03,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 443 flow [2023-08-30 03:01:03,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:01:03,832 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 212 flow [2023-08-30 03:01:03,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-30 03:01:03,834 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -29 predicate places. [2023-08-30 03:01:03,834 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 212 flow [2023-08-30 03:01:03,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-08-30 03:01:03,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:03,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:03,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:01:03,835 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:03,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 91853000, now seen corresponding path program 1 times [2023-08-30 03:01:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319400658] [2023-08-30 03:01:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:03,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319400658] [2023-08-30 03:01:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319400658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:03,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:03,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:01:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676429213] [2023-08-30 03:01:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:03,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:01:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:03,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:01:03,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:01:04,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 321 [2023-08-30 03:01:04,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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-08-30 03:01:04,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:04,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 321 [2023-08-30 03:01:04,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:04,873 INFO L130 PetriNetUnfolder]: 3199/5157 cut-off events. [2023-08-30 03:01:04,873 INFO L131 PetriNetUnfolder]: For 3827/3827 co-relation queries the response was YES. [2023-08-30 03:01:04,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15482 conditions, 5157 events. 3199/5157 cut-off events. For 3827/3827 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 31988 event pairs, 1499 based on Foata normal form. 16/4472 useless extension candidates. Maximal degree in co-relation 15473. Up to 1967 conditions per place. [2023-08-30 03:01:04,904 INFO L137 encePairwiseOnDemand]: 308/321 looper letters, 49 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2023-08-30 03:01:04,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 406 flow [2023-08-30 03:01:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:01:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:01:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-30 03:01:04,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3987538940809969 [2023-08-30 03:01:04,908 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-30 03:01:04,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-30 03:01:04,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:04,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-30 03:01:04,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-08-30 03:01:04,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 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-08-30 03:01:04,911 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 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-08-30 03:01:04,911 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 212 flow. Second operand 4 states and 512 transitions. [2023-08-30 03:01:04,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 406 flow [2023-08-30 03:01:04,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:01:04,929 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 284 flow [2023-08-30 03:01:04,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2023-08-30 03:01:04,930 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -26 predicate places. [2023-08-30 03:01:04,930 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 284 flow [2023-08-30 03:01:04,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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-08-30 03:01:04,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:04,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:04,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:01:04,931 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:04,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash -635683316, now seen corresponding path program 1 times [2023-08-30 03:01:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:04,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716131623] [2023-08-30 03:01:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:06,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716131623] [2023-08-30 03:01:06,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716131623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:06,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:01:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551312858] [2023-08-30 03:01:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:06,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:01:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:01:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:01:06,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 321 [2023-08-30 03:01:06,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 284 flow. Second operand has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 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-08-30 03:01:06,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:06,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 321 [2023-08-30 03:01:06,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:07,996 INFO L130 PetriNetUnfolder]: 3532/5677 cut-off events. [2023-08-30 03:01:07,996 INFO L131 PetriNetUnfolder]: For 5262/5267 co-relation queries the response was YES. [2023-08-30 03:01:08,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18873 conditions, 5677 events. 3532/5677 cut-off events. For 5262/5267 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 36096 event pairs, 809 based on Foata normal form. 36/5224 useless extension candidates. Maximal degree in co-relation 18863. Up to 4821 conditions per place. [2023-08-30 03:01:08,022 INFO L137 encePairwiseOnDemand]: 309/321 looper letters, 82 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2023-08-30 03:01:08,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 765 flow [2023-08-30 03:01:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 03:01:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 03:01:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1272 transitions. [2023-08-30 03:01:08,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602378929481733 [2023-08-30 03:01:08,026 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1272 transitions. [2023-08-30 03:01:08,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1272 transitions. [2023-08-30 03:01:08,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:08,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1272 transitions. [2023-08-30 03:01:08,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.63636363636364) internal successors, (1272), 11 states have internal predecessors, (1272), 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-08-30 03:01:08,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 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-08-30 03:01:08,033 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 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-08-30 03:01:08,033 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 284 flow. Second operand 11 states and 1272 transitions. [2023-08-30 03:01:08,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 765 flow [2023-08-30 03:01:08,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:01:08,055 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 526 flow [2023-08-30 03:01:08,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=526, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-08-30 03:01:08,055 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -12 predicate places. [2023-08-30 03:01:08,055 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 526 flow [2023-08-30 03:01:08,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 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-08-30 03:01:08,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:08,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:01:08,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:08,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1658495372, now seen corresponding path program 2 times [2023-08-30 03:01:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590395621] [2023-08-30 03:01:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:09,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:09,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590395621] [2023-08-30 03:01:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590395621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:09,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:01:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021757252] [2023-08-30 03:01:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:09,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:01:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:01:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:01:09,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 321 [2023-08-30 03:01:09,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 526 flow. Second operand has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 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-08-30 03:01:09,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:09,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 321 [2023-08-30 03:01:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:10,205 INFO L130 PetriNetUnfolder]: 3522/5657 cut-off events. [2023-08-30 03:01:10,205 INFO L131 PetriNetUnfolder]: For 7314/7317 co-relation queries the response was YES. [2023-08-30 03:01:10,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20908 conditions, 5657 events. 3522/5657 cut-off events. For 7314/7317 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 35997 event pairs, 565 based on Foata normal form. 9/5177 useless extension candidates. Maximal degree in co-relation 20892. Up to 4173 conditions per place. [2023-08-30 03:01:10,230 INFO L137 encePairwiseOnDemand]: 311/321 looper letters, 99 selfloop transitions, 50 changer transitions 0/152 dead transitions. [2023-08-30 03:01:10,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 1287 flow [2023-08-30 03:01:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 03:01:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 03:01:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1269 transitions. [2023-08-30 03:01:10,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35938827527612577 [2023-08-30 03:01:10,234 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1269 transitions. [2023-08-30 03:01:10,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1269 transitions. [2023-08-30 03:01:10,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:10,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1269 transitions. [2023-08-30 03:01:10,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.36363636363636) internal successors, (1269), 11 states have internal predecessors, (1269), 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-08-30 03:01:10,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 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-08-30 03:01:10,241 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 321.0) internal successors, (3852), 12 states have internal predecessors, (3852), 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-08-30 03:01:10,241 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 526 flow. Second operand 11 states and 1269 transitions. [2023-08-30 03:01:10,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 1287 flow [2023-08-30 03:01:10,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 1283 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-30 03:01:10,280 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 941 flow [2023-08-30 03:01:10,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=941, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2023-08-30 03:01:10,281 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2023-08-30 03:01:10,281 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 941 flow [2023-08-30 03:01:10,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 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-08-30 03:01:10,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:10,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:10,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:01:10,282 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:10,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1923578745, now seen corresponding path program 1 times [2023-08-30 03:01:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:10,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309807228] [2023-08-30 03:01:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:10,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:10,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309807228] [2023-08-30 03:01:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309807228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:10,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:01:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390173756] [2023-08-30 03:01:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:10,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:01:10,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:10,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:01:10,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:01:10,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 321 [2023-08-30 03:01:10,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 941 flow. Second operand has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 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-08-30 03:01:10,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:10,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 321 [2023-08-30 03:01:10,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:11,518 INFO L130 PetriNetUnfolder]: 2734/4445 cut-off events. [2023-08-30 03:01:11,519 INFO L131 PetriNetUnfolder]: For 10439/10439 co-relation queries the response was YES. [2023-08-30 03:01:11,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17659 conditions, 4445 events. 2734/4445 cut-off events. For 10439/10439 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27117 event pairs, 424 based on Foata normal form. 0/4397 useless extension candidates. Maximal degree in co-relation 17637. Up to 1617 conditions per place. [2023-08-30 03:01:11,536 INFO L137 encePairwiseOnDemand]: 314/321 looper letters, 101 selfloop transitions, 26 changer transitions 0/130 dead transitions. [2023-08-30 03:01:11,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 130 transitions, 1287 flow [2023-08-30 03:01:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:01:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:01:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-08-30 03:01:11,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3684913217623498 [2023-08-30 03:01:11,538 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-08-30 03:01:11,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-08-30 03:01:11,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:11,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-08-30 03:01:11,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 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-08-30 03:01:11,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 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-08-30 03:01:11,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 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-08-30 03:01:11,542 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 941 flow. Second operand 7 states and 828 transitions. [2023-08-30 03:01:11,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 130 transitions, 1287 flow [2023-08-30 03:01:11,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 1273 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 03:01:11,579 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 844 flow [2023-08-30 03:01:11,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=844, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2023-08-30 03:01:11,580 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2023-08-30 03:01:11,580 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 844 flow [2023-08-30 03:01:11,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 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-08-30 03:01:11,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:11,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:11,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:01:11,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:11,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1447524274, now seen corresponding path program 1 times [2023-08-30 03:01:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:11,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444689670] [2023-08-30 03:01:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444689670] [2023-08-30 03:01:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444689670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:11,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:11,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:01:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511256510] [2023-08-30 03:01:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:11,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:01:11,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:01:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:01:11,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 321 [2023-08-30 03:01:11,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 844 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-08-30 03:01:11,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:11,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 321 [2023-08-30 03:01:11,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:12,372 INFO L130 PetriNetUnfolder]: 2304/3759 cut-off events. [2023-08-30 03:01:12,373 INFO L131 PetriNetUnfolder]: For 9535/9538 co-relation queries the response was YES. [2023-08-30 03:01:12,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14850 conditions, 3759 events. 2304/3759 cut-off events. For 9535/9538 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22107 event pairs, 1055 based on Foata normal form. 76/3803 useless extension candidates. Maximal degree in co-relation 14828. Up to 2135 conditions per place. [2023-08-30 03:01:12,390 INFO L137 encePairwiseOnDemand]: 308/321 looper letters, 88 selfloop transitions, 26 changer transitions 0/117 dead transitions. [2023-08-30 03:01:12,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 117 transitions, 1229 flow [2023-08-30 03:01:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:01:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:01:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-08-30 03:01:12,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37954309449636553 [2023-08-30 03:01:12,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-08-30 03:01:12,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-08-30 03:01:12,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:12,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-08-30 03:01:12,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 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-08-30 03:01:12,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 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-08-30 03:01:12,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 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-08-30 03:01:12,397 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 844 flow. Second operand 6 states and 731 transitions. [2023-08-30 03:01:12,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 117 transitions, 1229 flow [2023-08-30 03:01:12,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 1175 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-30 03:01:12,429 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 924 flow [2023-08-30 03:01:12,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=924, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2023-08-30 03:01:12,430 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 6 predicate places. [2023-08-30 03:01:12,430 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 924 flow [2023-08-30 03:01:12,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-08-30 03:01:12,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:12,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:12,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:01:12,431 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:12,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 467013533, now seen corresponding path program 1 times [2023-08-30 03:01:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:12,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582475442] [2023-08-30 03:01:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582475442] [2023-08-30 03:01:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582475442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:01:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385450688] [2023-08-30 03:01:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:12,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:01:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:12,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:01:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:01:12,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-30 03:01:12,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 924 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-08-30 03:01:12,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:12,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-30 03:01:12,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:12,880 INFO L130 PetriNetUnfolder]: 1058/1904 cut-off events. [2023-08-30 03:01:12,880 INFO L131 PetriNetUnfolder]: For 5104/5104 co-relation queries the response was YES. [2023-08-30 03:01:12,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7664 conditions, 1904 events. 1058/1904 cut-off events. For 5104/5104 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10819 event pairs, 222 based on Foata normal form. 44/1934 useless extension candidates. Maximal degree in co-relation 7641. Up to 1663 conditions per place. [2023-08-30 03:01:12,888 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 100 selfloop transitions, 4 changer transitions 4/111 dead transitions. [2023-08-30 03:01:12,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 1248 flow [2023-08-30 03:01:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:01:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:01:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-30 03:01:12,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215991692627207 [2023-08-30 03:01:12,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-30 03:01:12,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-30 03:01:12,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:12,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-30 03:01:12,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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-08-30 03:01:12,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:12,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 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-08-30 03:01:12,894 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 924 flow. Second operand 3 states and 406 transitions. [2023-08-30 03:01:12,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 1248 flow [2023-08-30 03:01:12,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 1215 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 03:01:12,910 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 821 flow [2023-08-30 03:01:12,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-30 03:01:12,911 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 6 predicate places. [2023-08-30 03:01:12,911 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 821 flow [2023-08-30 03:01:12,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-08-30 03:01:12,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:12,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:12,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:01:12,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:12,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash -246200974, now seen corresponding path program 1 times [2023-08-30 03:01:12,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:12,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899609921] [2023-08-30 03:01:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:13,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899609921] [2023-08-30 03:01:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899609921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:13,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:01:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136219639] [2023-08-30 03:01:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:01:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:01:13,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:01:13,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-30 03:01:13,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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-08-30 03:01:13,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:13,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-30 03:01:13,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:13,239 INFO L130 PetriNetUnfolder]: 363/739 cut-off events. [2023-08-30 03:01:13,240 INFO L131 PetriNetUnfolder]: For 1656/1656 co-relation queries the response was YES. [2023-08-30 03:01:13,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 739 events. 363/739 cut-off events. For 1656/1656 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3731 event pairs, 76 based on Foata normal form. 51/784 useless extension candidates. Maximal degree in co-relation 2969. Up to 308 conditions per place. [2023-08-30 03:01:13,243 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 85 selfloop transitions, 7 changer transitions 9/104 dead transitions. [2023-08-30 03:01:13,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 104 transitions, 1039 flow [2023-08-30 03:01:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:01:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:01:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-30 03:01:13,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4190031152647975 [2023-08-30 03:01:13,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-30 03:01:13,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-30 03:01:13,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:13,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-30 03:01:13,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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-08-30 03:01:13,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 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-08-30 03:01:13,247 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 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-08-30 03:01:13,248 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 821 flow. Second operand 4 states and 538 transitions. [2023-08-30 03:01:13,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 104 transitions, 1039 flow [2023-08-30 03:01:13,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 994 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-30 03:01:13,252 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 526 flow [2023-08-30 03:01:13,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2023-08-30 03:01:13,253 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2023-08-30 03:01:13,253 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 526 flow [2023-08-30 03:01:13,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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-08-30 03:01:13,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:13,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:13,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:01:13,253 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:13,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1970222810, now seen corresponding path program 1 times [2023-08-30 03:01:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:13,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707547450] [2023-08-30 03:01:13,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:01:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707547450] [2023-08-30 03:01:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707547450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:13,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:13,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:01:13,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708244135] [2023-08-30 03:01:13,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:13,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:01:13,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:01:13,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:01:13,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:01:13,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 321 [2023-08-30 03:01:13,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 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-08-30 03:01:13,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:13,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 321 [2023-08-30 03:01:13,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:13,615 INFO L130 PetriNetUnfolder]: 262/515 cut-off events. [2023-08-30 03:01:13,615 INFO L131 PetriNetUnfolder]: For 1500/1500 co-relation queries the response was YES. [2023-08-30 03:01:13,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 515 events. 262/515 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2533 event pairs, 65 based on Foata normal form. 18/528 useless extension candidates. Maximal degree in co-relation 2077. Up to 223 conditions per place. [2023-08-30 03:01:13,617 INFO L137 encePairwiseOnDemand]: 316/321 looper letters, 56 selfloop transitions, 10 changer transitions 5/74 dead transitions. [2023-08-30 03:01:13,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 74 transitions, 645 flow [2023-08-30 03:01:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:01:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:01:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-30 03:01:13,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074766355140187 [2023-08-30 03:01:13,619 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-30 03:01:13,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-30 03:01:13,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:13,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-30 03:01:13,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 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-08-30 03:01:13,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 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-08-30 03:01:13,623 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 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-08-30 03:01:13,624 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 526 flow. Second operand 5 states and 654 transitions. [2023-08-30 03:01:13,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 74 transitions, 645 flow [2023-08-30 03:01:13,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 530 flow, removed 18 selfloop flow, removed 15 redundant places. [2023-08-30 03:01:13,626 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 234 flow [2023-08-30 03:01:13,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-08-30 03:01:13,627 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -21 predicate places. [2023-08-30 03:01:13,627 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 234 flow [2023-08-30 03:01:13,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 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-08-30 03:01:13,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:13,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:13,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:01:13,628 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:13,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash 728168337, now seen corresponding path program 1 times [2023-08-30 03:01:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:01:13,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165369297] [2023-08-30 03:01:13,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:01:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:01:13,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:01:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:01:13,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:01:13,818 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:01:13,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-30 03:01:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-30 03:01:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-30 03:01:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-30 03:01:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-30 03:01:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-30 03:01:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-30 03:01:13,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-30 03:01:13,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-30 03:01:13,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-30 03:01:13,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-30 03:01:13,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-08-30 03:01:13,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-08-30 03:01:13,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-08-30 03:01:13,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-08-30 03:01:13,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-30 03:01:13,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-30 03:01:13,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-08-30 03:01:13,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-30 03:01:13,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-30 03:01:13,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-30 03:01:13,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-30 03:01:13,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-30 03:01:13,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-30 03:01:13,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-30 03:01:13,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-30 03:01:13,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-30 03:01:13,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:01:13,830 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:13,835 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:01:13,835 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:01:13,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:01:13 BasicIcfg [2023-08-30 03:01:13,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:01:13,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:01:13,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:01:13,911 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:01:13,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:00:43" (3/4) ... [2023-08-30 03:01:13,913 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:01:13,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:01:13,913 INFO L158 Benchmark]: Toolchain (without parser) took 31816.12ms. Allocated memory was 69.2MB in the beginning and 4.2GB in the end (delta: 4.2GB). Free memory was 46.1MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-30 03:01:13,914 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 50.3MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:01:13,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.72ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 37.9MB in the end (delta: 8.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-08-30 03:01:13,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.41ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 35.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:01:13,914 INFO L158 Benchmark]: Boogie Preprocessor took 54.25ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:01:13,914 INFO L158 Benchmark]: RCFGBuilder took 1105.72ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 33.0MB in the beginning and 60.9MB in the end (delta: -27.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2023-08-30 03:01:13,915 INFO L158 Benchmark]: TraceAbstraction took 30086.16ms. Allocated memory was 104.9MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 60.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-30 03:01:13,915 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 4.2GB. Free memory is still 2.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:01:13,917 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.24ms. Allocated memory is still 50.3MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.72ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 37.9MB in the end (delta: 8.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.41ms. Allocated memory is still 69.2MB. Free memory was 37.9MB in the beginning and 35.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.25ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1105.72ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 33.0MB in the beginning and 60.9MB in the end (delta: -27.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30086.16ms. Allocated memory was 104.9MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 60.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 4.2GB. Free memory is still 2.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 179 PlacesBefore, 82 PlacesAfterwards, 171 TransitionsBefore, 72 TransitionsAfterwards, 6982 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 147 TotalNumberOfCompositions, 32691 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8981, independent: 8422, independent conditional: 0, independent unconditional: 8422, dependent: 559, dependent conditional: 0, dependent unconditional: 559, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2796, independent: 2704, independent conditional: 0, independent unconditional: 2704, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8981, independent: 5718, independent conditional: 0, independent unconditional: 5718, dependent: 467, dependent conditional: 0, dependent unconditional: 467, unknown: 2796, unknown conditional: 0, unknown unconditional: 2796] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 382, Positive conditional cache size: 0, Positive unconditional cache size: 382, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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(&t1681, ((void *)0), P0, ((void *)0))=-2, t1681={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] 0 pthread_t t1682; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, pthread_create(&t1682, ((void *)0), P1, ((void *)0))=-1, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] 0 pthread_t t1683; [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1683, ((void *)0), P2, ((void *)0))=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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 7 procedures, 232 locations, 85 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: 29.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1563 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1165 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3493 IncrementalHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 153 mSDtfsCounter, 3493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=941occurred in iteration=11, InterpolantAutomatonStates: 77, 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.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 2239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:01:13,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:01:16,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:01:16,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:01:16,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:01:16,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:01:16,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:01:16,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:01:16,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:01:16,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:01:16,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:01:16,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:01:16,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:01:16,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:01:16,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:01:16,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:01:16,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:01:16,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:01:16,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:01:16,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:01:16,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:01:16,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:01:16,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:01:16,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:01:16,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:01:16,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:01:16,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:01:16,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:01:16,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:01:16,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:01:16,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:01:16,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:01:16,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:01:16,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:01:16,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:01:16,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:01:16,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:01:16,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:01:16,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:01:16,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:01:16,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:01:16,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:01:16,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:01:16,383 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:01:16,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:01:16,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:01:16,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:01:16,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:01:16,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:01:16,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:01:16,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:01:16,394 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:01:16,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:01:16,394 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:01:16,394 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:01:16,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:01:16,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:01:16,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:01:16,395 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:01:16,395 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:01:16,395 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:01:16,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:01:16,396 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:01:16,396 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:01:16,396 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:01:16,396 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:01:16,396 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:01:16,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:01:16,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:01:16,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:01:16,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:01:16,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:01:16,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:01:16,397 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:01:16,397 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:01:16,397 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:01:16,398 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:01:16,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:01:16,398 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:01:16,398 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:01:16,398 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 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 -> TOGETHER [2023-08-30 03:01:16,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:01:16,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:01:16,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:01:16,698 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:01:16,698 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:01:16,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-30 03:01:17,601 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:01:17,883 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:01:17,883 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-08-30 03:01:17,894 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6acaa2d24/7af5185526e34779ac5afd591cfe223d/FLAG47856d327 [2023-08-30 03:01:18,163 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6acaa2d24/7af5185526e34779ac5afd591cfe223d [2023-08-30 03:01:18,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:01:18,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:01:18,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:01:18,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:01:18,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:01:18,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df2b8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18, skipping insertion in model container [2023-08-30 03:01:18,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:01:18,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:01:18,313 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/rfi006_power.oepc.i[994,1007] [2023-08-30 03:01:18,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:01:18,520 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:01:18,530 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/rfi006_power.oepc.i[994,1007] [2023-08-30 03:01:18,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:01:18,611 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:01:18,612 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:01:18,616 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:01:18,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18 WrapperNode [2023-08-30 03:01:18,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:01:18,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:01:18,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:01:18,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:01:18,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,678 INFO L138 Inliner]: procedures = 180, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-30 03:01:18,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:01:18,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:01:18,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:01:18,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:01:18,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,730 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:01:18,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:01:18,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:01:18,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:01:18,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (1/1) ... [2023-08-30 03:01:18,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:01:18,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:01:18,775 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-08-30 03:01:18,777 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-08-30 03:01:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:01:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:01:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:01:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:01:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:01:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:01:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:01:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:01:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:01:18,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:01:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:01:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:01:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:01:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:01:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:01:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:01:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:01:18,811 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:01:18,934 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:01:18,936 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:01:19,461 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:01:19,890 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:01:19,890 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:01:19,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:01:19 BoogieIcfgContainer [2023-08-30 03:01:19,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:01:19,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:01:19,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:01:19,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:01:19,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:01:18" (1/3) ... [2023-08-30 03:01:19,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f855c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:01:19, skipping insertion in model container [2023-08-30 03:01:19,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:01:18" (2/3) ... [2023-08-30 03:01:19,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f855c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:01:19, skipping insertion in model container [2023-08-30 03:01:19,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:01:19" (3/3) ... [2023-08-30 03:01:19,899 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-08-30 03:01:19,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:01:19,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-08-30 03:01:19,913 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:01:20,030 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:01:20,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 175 transitions, 365 flow [2023-08-30 03:01:20,137 INFO L130 PetriNetUnfolder]: 2/172 cut-off events. [2023-08-30 03:01:20,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:01:20,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 2/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 279 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-30 03:01:20,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 175 transitions, 365 flow [2023-08-30 03:01:20,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 172 transitions, 353 flow [2023-08-30 03:01:20,149 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:01:20,156 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 172 transitions, 353 flow [2023-08-30 03:01:20,158 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 172 transitions, 353 flow [2023-08-30 03:01:20,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 353 flow [2023-08-30 03:01:20,184 INFO L130 PetriNetUnfolder]: 2/172 cut-off events. [2023-08-30 03:01:20,184 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:01:20,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 2/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 281 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-08-30 03:01:20,188 INFO L119 LiptonReduction]: Number of co-enabled transitions 6982 [2023-08-30 03:01:38,305 INFO L134 LiptonReduction]: Checked pairs total: 36107 [2023-08-30 03:01:38,306 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-30 03:01:38,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:01:38,332 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1821fb69, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:01:38,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-08-30 03:01:38,333 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:01:38,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:01:38,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:38,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:01:38,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:38,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1060, now seen corresponding path program 1 times [2023-08-30 03:01:38,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:01:38,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133486979] [2023-08-30 03:01:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:38,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:38,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:01:38,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:01:38,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:01:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:38,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:01:38,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:01:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:38,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:01:38,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:01:38,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133486979] [2023-08-30 03:01:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133486979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:38,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:01:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578658399] [2023-08-30 03:01:38,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:38,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:01:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:01:38,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:01:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:01:38,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 318 [2023-08-30 03:01:38,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 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-08-30 03:01:38,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:38,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 318 [2023-08-30 03:01:38,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:40,582 INFO L130 PetriNetUnfolder]: 11260/15872 cut-off events. [2023-08-30 03:01:40,582 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 03:01:40,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31815 conditions, 15872 events. 11260/15872 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 99938 event pairs, 11260 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 31804. Up to 15867 conditions per place. [2023-08-30 03:01:40,717 INFO L137 encePairwiseOnDemand]: 288/318 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-30 03:01:40,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-30 03:01:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:01:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:01:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2023-08-30 03:01:40,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062893081761006 [2023-08-30 03:01:40,739 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 322 transitions. [2023-08-30 03:01:40,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 322 transitions. [2023-08-30 03:01:40,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:40,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 322 transitions. [2023-08-30 03:01:40,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 161.0) internal successors, (322), 2 states have internal predecessors, (322), 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-08-30 03:01:40,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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-08-30 03:01:40,758 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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-08-30 03:01:40,760 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 153 flow. Second operand 2 states and 322 transitions. [2023-08-30 03:01:40,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-30 03:01:40,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:01:40,768 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-30 03:01:40,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-30 03:01:40,773 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2023-08-30 03:01:40,773 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-30 03:01:40,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 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-08-30 03:01:40,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:40,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:01:40,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 03:01:40,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:40,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:40,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1048020, now seen corresponding path program 1 times [2023-08-30 03:01:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:01:40,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797345188] [2023-08-30 03:01:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:40,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:40,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:01:40,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:01:40,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:01:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:41,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:01:41,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:01:41,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:01:41,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 03:01:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:41,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:01:41,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:01:41,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797345188] [2023-08-30 03:01:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797345188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:41,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:41,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:01:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027459550] [2023-08-30 03:01:41,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:41,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:01:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:01:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:01:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:01:41,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 318 [2023-08-30 03:01:41,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-08-30 03:01:41,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:41,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 318 [2023-08-30 03:01:41,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:42,014 INFO L130 PetriNetUnfolder]: 4344/6242 cut-off events. [2023-08-30 03:01:42,014 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:01:42,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12532 conditions, 6242 events. 4344/6242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 34943 event pairs, 4344 based on Foata normal form. 0/3768 useless extension candidates. Maximal degree in co-relation 12529. Up to 6237 conditions per place. [2023-08-30 03:01:42,031 INFO L137 encePairwiseOnDemand]: 310/318 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-30 03:01:42,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 142 flow [2023-08-30 03:01:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:01:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:01:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-30 03:01:42,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350104821802935 [2023-08-30 03:01:42,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-30 03:01:42,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-30 03:01:42,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:42,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-30 03:01:42,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 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-08-30 03:01:42,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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-08-30 03:01:42,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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-08-30 03:01:42,038 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 415 transitions. [2023-08-30 03:01:42,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 142 flow [2023-08-30 03:01:42,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:01:42,040 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2023-08-30 03:01:42,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-30 03:01:42,040 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-30 03:01:42,041 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2023-08-30 03:01:42,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-08-30 03:01:42,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:42,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:01:42,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:01:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:42,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:42,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1048019, now seen corresponding path program 1 times [2023-08-30 03:01:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:01:42,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403524618] [2023-08-30 03:01:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:42,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:42,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:01:42,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:01:42,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:01:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:42,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:01:42,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:01:42,347 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:01:42,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:01:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:42,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:01:42,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:01:42,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403524618] [2023-08-30 03:01:42,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403524618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:42,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:01:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141412634] [2023-08-30 03:01:42,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:42,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:01:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:01:42,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:01:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:01:42,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-30 03:01:42,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-08-30 03:01:42,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:42,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-30 03:01:42,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:42,859 INFO L130 PetriNetUnfolder]: 1994/2940 cut-off events. [2023-08-30 03:01:42,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:01:42,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 2940 events. 1994/2940 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14854 event pairs, 1138 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 5909. Up to 1817 conditions per place. [2023-08-30 03:01:42,869 INFO L137 encePairwiseOnDemand]: 309/318 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-30 03:01:42,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 168 flow [2023-08-30 03:01:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:01:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:01:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 03:01:42,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43186582809224316 [2023-08-30 03:01:42,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 03:01:42,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 03:01:42,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:42,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 03:01:42,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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-08-30 03:01:42,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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-08-30 03:01:42,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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-08-30 03:01:42,875 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 412 transitions. [2023-08-30 03:01:42,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 168 flow [2023-08-30 03:01:42,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:01:42,876 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 89 flow [2023-08-30 03:01:42,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-30 03:01:42,877 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -37 predicate places. [2023-08-30 03:01:42,877 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 89 flow [2023-08-30 03:01:42,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-08-30 03:01:42,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:42,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:42,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 03:01:43,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:43,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:43,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash -639150639, now seen corresponding path program 1 times [2023-08-30 03:01:43,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:01:43,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772432053] [2023-08-30 03:01:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:01:43,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:01:43,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:01:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:43,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:01:43,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:01:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:43,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:01:43,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:01:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772432053] [2023-08-30 03:01:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772432053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:43,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:01:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810205874] [2023-08-30 03:01:43,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:43,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:01:43,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:01:43,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:01:43,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:01:43,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-30 03:01:43,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-08-30 03:01:43,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:43,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-30 03:01:43,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:43,540 INFO L130 PetriNetUnfolder]: 860/1409 cut-off events. [2023-08-30 03:01:43,541 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-08-30 03:01:43,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 1409 events. 860/1409 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7068 event pairs, 303 based on Foata normal form. 18/1234 useless extension candidates. Maximal degree in co-relation 3089. Up to 1324 conditions per place. [2023-08-30 03:01:43,546 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 41 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-30 03:01:43,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 211 flow [2023-08-30 03:01:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:01:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:01:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 03:01:43,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43186582809224316 [2023-08-30 03:01:43,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 03:01:43,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 03:01:43,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:43,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 03:01:43,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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-08-30 03:01:43,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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-08-30 03:01:43,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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-08-30 03:01:43,552 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 89 flow. Second operand 3 states and 412 transitions. [2023-08-30 03:01:43,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 211 flow [2023-08-30 03:01:43,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:01:43,553 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2023-08-30 03:01:43,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-30 03:01:43,554 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -36 predicate places. [2023-08-30 03:01:43,554 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2023-08-30 03:01:43,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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-08-30 03:01:43,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:43,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:43,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-30 03:01:43,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:43,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:43,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2034444681, now seen corresponding path program 1 times [2023-08-30 03:01:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:01:43,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740520041] [2023-08-30 03:01:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:43,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:43,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:01:43,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:01:43,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:01:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:43,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:01:43,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:01:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:43,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:01:43,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:01:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740520041] [2023-08-30 03:01:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740520041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:01:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809531657] [2023-08-30 03:01:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:43,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:01:43,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:01:43,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:01:43,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:01:43,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-30 03:01:43,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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-08-30 03:01:43,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:43,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-30 03:01:43,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:44,199 INFO L130 PetriNetUnfolder]: 209/416 cut-off events. [2023-08-30 03:01:44,199 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-30 03:01:44,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 416 events. 209/416 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1658 event pairs, 65 based on Foata normal form. 21/389 useless extension candidates. Maximal degree in co-relation 1034. Up to 239 conditions per place. [2023-08-30 03:01:44,201 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-30 03:01:44,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 279 flow [2023-08-30 03:01:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:01:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:01:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-30 03:01:44,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42845911949685533 [2023-08-30 03:01:44,203 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-30 03:01:44,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-30 03:01:44,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:44,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-30 03:01:44,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 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-08-30 03:01:44,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 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-08-30 03:01:44,207 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 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-08-30 03:01:44,207 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 545 transitions. [2023-08-30 03:01:44,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 279 flow [2023-08-30 03:01:44,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:01:44,209 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 147 flow [2023-08-30 03:01:44,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-30 03:01:44,210 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -33 predicate places. [2023-08-30 03:01:44,210 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 147 flow [2023-08-30 03:01:44,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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-08-30 03:01:44,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:44,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:44,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 03:01:44,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:44,419 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:44,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -695106961, now seen corresponding path program 1 times [2023-08-30 03:01:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:01:44,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404154167] [2023-08-30 03:01:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:44,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:01:44,425 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:01:44,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:01:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:01:44,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:01:44,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:01:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:01:44,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:01:44,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:01:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404154167] [2023-08-30 03:01:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404154167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:01:44,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:01:44,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:01:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594379425] [2023-08-30 03:01:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:01:44,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:01:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:01:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:01:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:01:44,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-08-30 03:01:44,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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-08-30 03:01:44,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:01:44,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-08-30 03:01:44,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:01:44,810 INFO L130 PetriNetUnfolder]: 114/221 cut-off events. [2023-08-30 03:01:44,810 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2023-08-30 03:01:44,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 221 events. 114/221 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 726 event pairs, 40 based on Foata normal form. 8/222 useless extension candidates. Maximal degree in co-relation 627. Up to 92 conditions per place. [2023-08-30 03:01:44,811 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 40 selfloop transitions, 10 changer transitions 1/53 dead transitions. [2023-08-30 03:01:44,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 273 flow [2023-08-30 03:01:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:01:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:01:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-30 03:01:44,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41635220125786165 [2023-08-30 03:01:44,813 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-30 03:01:44,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-30 03:01:44,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:01:44,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-30 03:01:44,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 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-08-30 03:01:44,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 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-08-30 03:01:44,818 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 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-08-30 03:01:44,818 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 147 flow. Second operand 5 states and 662 transitions. [2023-08-30 03:01:44,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 273 flow [2023-08-30 03:01:44,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 257 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:01:44,819 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-30 03:01:44,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-30 03:01:44,820 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -36 predicate places. [2023-08-30 03:01:44,820 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-30 03:01:44,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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-08-30 03:01:44,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:01:44,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:44,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:01:45,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:45,029 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-08-30 03:01:45,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:01:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash 897369721, now seen corresponding path program 1 times [2023-08-30 03:01:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:01:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433654740] [2023-08-30 03:01:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:01:45,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:01:45,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:01:45,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:01:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:01:45,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:01:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:01:45,418 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:01:45,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:01:45,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-08-30 03:01:45,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-08-30 03:01:45,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-08-30 03:01:45,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-08-30 03:01:45,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-08-30 03:01:45,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-08-30 03:01:45,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-08-30 03:01:45,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-08-30 03:01:45,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-08-30 03:01:45,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-08-30 03:01:45,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-08-30 03:01:45,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-08-30 03:01:45,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-08-30 03:01:45,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-08-30 03:01:45,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 03:01:45,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:01:45,630 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:01:45,635 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:01:45,635 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:01:45,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:01:45 BasicIcfg [2023-08-30 03:01:45,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:01:45,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:01:45,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:01:45,689 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:01:45,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:01:19" (3/4) ... [2023-08-30 03:01:45,692 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:01:45,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:01:45,692 INFO L158 Benchmark]: Toolchain (without parser) took 27525.88ms. Allocated memory was 79.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 54.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2023-08-30 03:01:45,692 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:01:45,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.87ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 47.7MB in the end (delta: 6.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-30 03:01:45,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.19ms. Allocated memory is still 79.7MB. Free memory was 47.7MB in the beginning and 45.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:01:45,693 INFO L158 Benchmark]: Boogie Preprocessor took 64.43ms. Allocated memory is still 79.7MB. Free memory was 45.3MB in the beginning and 42.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:01:45,693 INFO L158 Benchmark]: RCFGBuilder took 1147.15ms. Allocated memory was 79.7MB in the beginning and 123.7MB in the end (delta: 44.0MB). Free memory was 42.5MB in the beginning and 89.6MB in the end (delta: -47.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2023-08-30 03:01:45,693 INFO L158 Benchmark]: TraceAbstraction took 25794.69ms. Allocated memory was 123.7MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 88.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2023-08-30 03:01:45,694 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 1.7GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:01:45,696 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.13ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.87ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 47.7MB in the end (delta: 6.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.19ms. Allocated memory is still 79.7MB. Free memory was 47.7MB in the beginning and 45.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.43ms. Allocated memory is still 79.7MB. Free memory was 45.3MB in the beginning and 42.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1147.15ms. Allocated memory was 79.7MB in the beginning and 123.7MB in the end (delta: 44.0MB). Free memory was 42.5MB in the beginning and 89.6MB in the end (delta: -47.1MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25794.69ms. Allocated memory was 123.7MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 88.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 1.7GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.1s, 180 PlacesBefore, 82 PlacesAfterwards, 172 TransitionsBefore, 72 TransitionsAfterwards, 6982 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 36107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9513, independent: 8878, independent conditional: 0, independent unconditional: 8878, dependent: 635, dependent conditional: 0, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2806, independent: 2715, independent conditional: 0, independent unconditional: 2715, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9513, independent: 6163, independent conditional: 0, independent unconditional: 6163, dependent: 544, dependent conditional: 0, dependent unconditional: 544, unknown: 2806, unknown conditional: 0, unknown unconditional: 2806] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 380, Positive conditional cache size: 0, Positive unconditional cache size: 380, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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(&t1681, ((void *)0), P0, ((void *)0))=-1, t1681={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L850] 0 pthread_t t1682; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, t1681={15:0}, t1682={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, pthread_create(&t1682, ((void *)0), P1, ((void *)0))=0, t1681={15:0}, t1682={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice0=2, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __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$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] 0 pthread_t t1683; [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1683, ((void *)0), P2, ((void *)0))=1, t1681={15:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={15:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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 7 procedures, 233 locations, 85 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: 25.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 222 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 32 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, InterpolantAutomatonStates: 20, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 2 NumberOfNonLiveVariables, 625 ConjunctsInSsa, 31 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 could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:01:45,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample