./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix008_power.oepc_pso.oepc_rmo.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 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:10:20,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:10:20,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:10:20,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:10:20,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:10:20,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:10:20,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:10:20,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:10:20,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:10:20,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:10:20,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:10:20,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:10:20,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:10:20,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:10:20,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:10:20,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:10:20,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:10:20,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:10:20,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:10:20,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:10:20,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:10:20,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:10:20,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:10:20,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:10:20,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:10:20,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:10:20,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:10:20,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:10:20,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:10:20,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:10:20,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:10:20,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:10:20,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:10:20,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:10:20,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:10:20,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:10:20,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:10:20,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:10:20,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:10:20,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:10:20,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:10:20,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:10:20,532 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:10:20,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:10:20,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:10:20,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:10:20,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:10:20,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:10:20,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:10:20,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:10:20,535 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:10:20,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:10:20,536 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:10:20,536 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:10:20,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:10:20,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:10:20,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:10:20,537 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:10:20,537 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:10:20,537 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:10:20,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:10:20,538 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:10:20,538 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:10:20,538 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:10:20,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:10:20,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:10:20,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:10:20,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:10:20,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:10:20,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:10:20,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:10:20,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:10:20,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:10:20,540 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:10:20,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:10:20,541 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:10:20,541 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 -> 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:10:20,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:10:20,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:10:20,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:10:20,846 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:10:20,846 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:10:20,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:10:22,049 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:10:22,297 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:10:22,297 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:10:22,309 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c4b8b2b3/c3097961d2e64f8097c4085676f9667d/FLAG917355c76 [2023-08-31 23:10:22,322 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c4b8b2b3/c3097961d2e64f8097c4085676f9667d [2023-08-31 23:10:22,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:10:22,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:10:22,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:10:22,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:10:22,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:10:22,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6045242c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22, skipping insertion in model container [2023-08-31 23:10:22,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:10:22,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:10:22,503 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:10:22,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:10:22,693 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:10:22,706 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:10:22,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:10:22,822 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:10:22,823 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:10:22,828 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:10:22,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22 WrapperNode [2023-08-31 23:10:22,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:10:22,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:10:22,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:10:22,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:10:22,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,899 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-31 23:10:22,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:10:22,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:10:22,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:10:22,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:10:22,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:10:22,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:10:22,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:10:22,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:10:22,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (1/1) ... [2023-08-31 23:10:22,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:10:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:10:22,998 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-31 23:10:23,016 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-31 23:10:23,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:10:23,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:10:23,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:10:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:10:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:10:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:10:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:10:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:10:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:10:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:10:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:10:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:10:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:10:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:10:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:10:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:10:23,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:10:23,038 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:10:23,222 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:10:23,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:10:23,625 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:10:23,721 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:10:23,722 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:10:23,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:10:23 BoogieIcfgContainer [2023-08-31 23:10:23,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:10:23,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:10:23,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:10:23,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:10:23,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:10:22" (1/3) ... [2023-08-31 23:10:23,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3448822c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:10:23, skipping insertion in model container [2023-08-31 23:10:23,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:10:22" (2/3) ... [2023-08-31 23:10:23,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3448822c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:10:23, skipping insertion in model container [2023-08-31 23:10:23,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:10:23" (3/3) ... [2023-08-31 23:10:23,730 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:10:23,744 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:10:23,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:10:23,744 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:10:23,797 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:10:23,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:10:23,871 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:10:23,872 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:10:23,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:10:23,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:10:23,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-31 23:10:23,885 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:10:23,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:10:23,895 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:10:23,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-31 23:10:23,926 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:10:23,927 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:10:23,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:10:23,930 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-31 23:10:28,063 INFO L134 LiptonReduction]: Checked pairs total: 11356 [2023-08-31 23:10:28,065 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:10:28,089 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:10:28,096 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;@19b17bcd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:10:28,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:10:28,100 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:10:28,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:10:28,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:28,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:10:28,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:28,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2023-08-31 23:10:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128361521] [2023-08-31 23:10:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:28,223 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-31 23:10:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128361521] [2023-08-31 23:10:28,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128361521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:10:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005660698] [2023-08-31 23:10:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:28,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:10:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:28,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:10:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:10:28,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 280 [2023-08-31 23:10:28,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 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-31 23:10:28,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:28,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 280 [2023-08-31 23:10:28,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:29,737 INFO L130 PetriNetUnfolder]: 8719/11885 cut-off events. [2023-08-31 23:10:29,737 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2023-08-31 23:10:29,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23833 conditions, 11885 events. 8719/11885 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 63989 event pairs, 8719 based on Foata normal form. 0/10377 useless extension candidates. Maximal degree in co-relation 23821. Up to 11731 conditions per place. [2023-08-31 23:10:29,810 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-31 23:10:29,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-31 23:10:29,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:10:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:10:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-31 23:10:29,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2023-08-31 23:10:29,828 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-31 23:10:29,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-31 23:10:29,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:29,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-31 23:10:29,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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-31 23:10:29,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:10:29,844 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:10:29,845 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 295 transitions. [2023-08-31 23:10:29,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-31 23:10:29,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:10:29,859 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-31 23:10:29,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-31 23:10:29,863 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-31 23:10:29,864 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-31 23:10:29,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 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-31 23:10:29,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:29,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:10:29,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:10:29,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:29,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash 600364, now seen corresponding path program 1 times [2023-08-31 23:10:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:29,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986585845] [2023-08-31 23:10:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:30,123 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-31 23:10:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986585845] [2023-08-31 23:10:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986585845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:30,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:30,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:10:30,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202660924] [2023-08-31 23:10:30,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:30,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:10:30,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:10:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:10:30,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 280 [2023-08-31 23:10:30,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 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-31 23:10:30,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:30,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 280 [2023-08-31 23:10:30,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:31,260 INFO L130 PetriNetUnfolder]: 6855/9365 cut-off events. [2023-08-31 23:10:31,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:10:31,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18802 conditions, 9365 events. 6855/9365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 48314 event pairs, 3527 based on Foata normal form. 0/8702 useless extension candidates. Maximal degree in co-relation 18799. Up to 7399 conditions per place. [2023-08-31 23:10:31,300 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-31 23:10:31,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-08-31 23:10:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:10:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:10:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-31 23:10:31,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2023-08-31 23:10:31,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-31 23:10:31,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-31 23:10:31,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:31,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-31 23:10:31,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-31 23:10:31,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:31,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:31,307 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 434 transitions. [2023-08-31 23:10:31,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-08-31 23:10:31,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:10:31,309 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-31 23:10:31,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:10:31,310 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-31 23:10:31,310 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-31 23:10:31,311 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-31 23:10:31,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:31,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:31,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:10:31,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:31,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash -697057832, now seen corresponding path program 1 times [2023-08-31 23:10:31,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:31,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852808180] [2023-08-31 23:10:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:31,642 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-31 23:10:31,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:31,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852808180] [2023-08-31 23:10:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852808180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:10:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424714365] [2023-08-31 23:10:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:31,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:10:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:10:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:10:31,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-31 23:10:31,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-31 23:10:31,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:31,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-31 23:10:31,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:34,744 INFO L130 PetriNetUnfolder]: 31165/41738 cut-off events. [2023-08-31 23:10:34,744 INFO L131 PetriNetUnfolder]: For 1931/1931 co-relation queries the response was YES. [2023-08-31 23:10:34,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85997 conditions, 41738 events. 31165/41738 cut-off events. For 1931/1931 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 231097 event pairs, 11139 based on Foata normal form. 0/40878 useless extension candidates. Maximal degree in co-relation 85993. Up to 23916 conditions per place. [2023-08-31 23:10:34,945 INFO L137 encePairwiseOnDemand]: 269/280 looper letters, 47 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2023-08-31 23:10:34,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 246 flow [2023-08-31 23:10:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:10:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:10:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-31 23:10:34,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-31 23:10:34,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-31 23:10:34,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-31 23:10:34,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:34,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-31 23:10:34,950 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-31 23:10:34,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:34,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:34,953 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 406 transitions. [2023-08-31 23:10:34,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 246 flow [2023-08-31 23:10:34,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:10:34,955 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2023-08-31 23:10:34,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-31 23:10:34,957 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-31 23:10:34,960 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2023-08-31 23:10:34,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-31 23:10:34,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:34,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:34,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:10:34,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:34,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash -133959096, now seen corresponding path program 1 times [2023-08-31 23:10:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655053371] [2023-08-31 23:10:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:35,225 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-31 23:10:35,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:35,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655053371] [2023-08-31 23:10:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655053371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:35,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:35,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:10:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980863535] [2023-08-31 23:10:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:35,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:10:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:10:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:10:35,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-31 23:10:35,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-31 23:10:35,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:35,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-31 23:10:35,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:37,899 INFO L130 PetriNetUnfolder]: 23505/32961 cut-off events. [2023-08-31 23:10:37,900 INFO L131 PetriNetUnfolder]: For 15298/15731 co-relation queries the response was YES. [2023-08-31 23:10:37,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81616 conditions, 32961 events. 23505/32961 cut-off events. For 15298/15731 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 206812 event pairs, 6756 based on Foata normal form. 331/32351 useless extension candidates. Maximal degree in co-relation 81611. Up to 20824 conditions per place. [2023-08-31 23:10:38,361 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 48 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-31 23:10:38,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 308 flow [2023-08-31 23:10:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:10:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:10:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-31 23:10:38,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2023-08-31 23:10:38,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-31 23:10:38,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-31 23:10:38,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:38,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-31 23:10:38,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-31 23:10:38,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:38,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:38,372 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 3 states and 425 transitions. [2023-08-31 23:10:38,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 308 flow [2023-08-31 23:10:38,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:10:38,426 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 139 flow [2023-08-31 23:10:38,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=139, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-31 23:10:38,428 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-08-31 23:10:38,428 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 139 flow [2023-08-31 23:10:38,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-31 23:10:38,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:38,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:38,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:10:38,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:38,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -133955475, now seen corresponding path program 1 times [2023-08-31 23:10:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404676167] [2023-08-31 23:10:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:38,951 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-31 23:10:38,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404676167] [2023-08-31 23:10:38,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404676167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:38,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:38,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:10:38,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678199279] [2023-08-31 23:10:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:38,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:10:38,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:38,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:10:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:10:39,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 280 [2023-08-31 23:10:39,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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-31 23:10:39,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:39,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 280 [2023-08-31 23:10:39,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:40,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [26#L773true, 41#L809true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, 12#L829true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-31 23:10:40,283 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,283 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,283 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,283 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:40,284 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,284 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,284 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,284 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,285 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [26#L773true, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-31 23:10:40,285 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,285 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,285 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,285 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,286 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 133#L887true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-31 23:10:40,286 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,286 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,286 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,286 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:40,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [26#L773true, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:40,529 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,530 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,530 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,530 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,530 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [26#L773true, 41#L809true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 66#L786true, 133#L887true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, 12#L829true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-31 23:10:40,530 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,530 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,531 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,531 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 133#L887true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:40,531 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,531 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,532 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,532 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [110#P0EXITtrue, 41#L809true, 66#L786true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 12#L829true, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-31 23:10:40,532 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,532 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,532 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,533 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,533 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:40,533 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,533 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,533 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,534 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [110#P0EXITtrue, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-31 23:10:40,534 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,535 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,535 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,535 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 133#L887true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 119#L793true, 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-31 23:10:40,535 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,536 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,536 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,536 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:40,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [110#P0EXITtrue, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:40,810 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,810 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,810 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [110#P0EXITtrue, 41#L809true, 66#L786true, 133#L887true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 12#L829true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-31 23:10:40,811 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 133#L887true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 119#L793true, 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:40,811 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:40,811 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:41,758 INFO L130 PetriNetUnfolder]: 22623/31801 cut-off events. [2023-08-31 23:10:41,758 INFO L131 PetriNetUnfolder]: For 6968/7075 co-relation queries the response was YES. [2023-08-31 23:10:41,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74095 conditions, 31801 events. 22623/31801 cut-off events. For 6968/7075 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 196546 event pairs, 3727 based on Foata normal form. 1458/32093 useless extension candidates. Maximal degree in co-relation 74089. Up to 20048 conditions per place. [2023-08-31 23:10:41,912 INFO L137 encePairwiseOnDemand]: 272/280 looper letters, 59 selfloop transitions, 6 changer transitions 20/93 dead transitions. [2023-08-31 23:10:41,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 453 flow [2023-08-31 23:10:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:10:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:10:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-31 23:10:41,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4372448979591837 [2023-08-31 23:10:41,916 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-31 23:10:41,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-31 23:10:41,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:41,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-31 23:10:41,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 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-31 23:10:41,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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-31 23:10:41,923 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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-31 23:10:41,923 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 139 flow. Second operand 7 states and 857 transitions. [2023-08-31 23:10:41,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 453 flow [2023-08-31 23:10:41,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:10:41,936 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 156 flow [2023-08-31 23:10:41,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-31 23:10:41,937 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-31 23:10:41,937 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 156 flow [2023-08-31 23:10:41,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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-31 23:10:41,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:41,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:41,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:10:41,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:41,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash 36107091, now seen corresponding path program 1 times [2023-08-31 23:10:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693697329] [2023-08-31 23:10:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:42,457 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-31 23:10:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693697329] [2023-08-31 23:10:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693697329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:42,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:10:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964728069] [2023-08-31 23:10:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:42,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:10:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:10:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:10:42,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 280 [2023-08-31 23:10:42,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 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-31 23:10:42,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:42,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 280 [2023-08-31 23:10:42,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:43,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:43,558 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,558 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,558 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,558 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 133#L887true, 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-31 23:10:43,559 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,559 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,559 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,560 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:43,775 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 133#L887true, 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:43,775 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,775 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,776 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,776 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,776 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:43,776 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,777 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,777 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,777 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,778 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 133#L887true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-31 23:10:43,778 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,778 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,778 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:43,778 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:44,003 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 133#L887true, 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-31 23:10:44,004 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:10:44,004 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:44,004 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:44,004 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:44,776 INFO L130 PetriNetUnfolder]: 16178/22634 cut-off events. [2023-08-31 23:10:44,776 INFO L131 PetriNetUnfolder]: For 10127/10443 co-relation queries the response was YES. [2023-08-31 23:10:44,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55560 conditions, 22634 events. 16178/22634 cut-off events. For 10127/10443 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 136065 event pairs, 3384 based on Foata normal form. 1010/22524 useless extension candidates. Maximal degree in co-relation 55552. Up to 15668 conditions per place. [2023-08-31 23:10:44,908 INFO L137 encePairwiseOnDemand]: 274/280 looper letters, 43 selfloop transitions, 4 changer transitions 17/74 dead transitions. [2023-08-31 23:10:44,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 372 flow [2023-08-31 23:10:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:10:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:10:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-08-31 23:10:44,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2023-08-31 23:10:44,912 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-08-31 23:10:44,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-08-31 23:10:44,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:44,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-08-31 23:10:44,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 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-31 23:10:44,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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-31 23:10:44,919 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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-31 23:10:44,919 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 156 flow. Second operand 7 states and 826 transitions. [2023-08-31 23:10:44,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 372 flow [2023-08-31 23:10:44,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 360 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:10:44,926 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 136 flow [2023-08-31 23:10:44,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-31 23:10:44,929 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-08-31 23:10:44,929 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 136 flow [2023-08-31 23:10:44,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 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-31 23:10:44,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:44,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:44,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:10:44,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:44,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1119247039, now seen corresponding path program 1 times [2023-08-31 23:10:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560946205] [2023-08-31 23:10:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:45,111 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-31 23:10:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560946205] [2023-08-31 23:10:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560946205] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:10:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092510869] [2023-08-31 23:10:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:45,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:10:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:45,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:10:45,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:10:45,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-31 23:10:45,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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-31 23:10:45,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:45,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-31 23:10:45,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:46,791 INFO L130 PetriNetUnfolder]: 17095/23194 cut-off events. [2023-08-31 23:10:46,791 INFO L131 PetriNetUnfolder]: For 6803/6803 co-relation queries the response was YES. [2023-08-31 23:10:46,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57775 conditions, 23194 events. 17095/23194 cut-off events. For 6803/6803 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 123282 event pairs, 3124 based on Foata normal form. 32/23226 useless extension candidates. Maximal degree in co-relation 57767. Up to 13129 conditions per place. [2023-08-31 23:10:46,901 INFO L137 encePairwiseOnDemand]: 270/280 looper letters, 65 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-08-31 23:10:46,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 421 flow [2023-08-31 23:10:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:10:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:10:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-31 23:10:46,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2023-08-31 23:10:46,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-31 23:10:46,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-31 23:10:46,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:46,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-31 23:10:46,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-31 23:10:46,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:10:46,908 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:10:46,908 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 136 flow. Second operand 4 states and 539 transitions. [2023-08-31 23:10:46,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 421 flow [2023-08-31 23:10:46,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 406 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:10:46,912 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 205 flow [2023-08-31 23:10:46,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-31 23:10:46,912 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2023-08-31 23:10:46,913 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 205 flow [2023-08-31 23:10:46,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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-31 23:10:46,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:46,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:46,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:10:46,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:46,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 359080817, now seen corresponding path program 1 times [2023-08-31 23:10:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:46,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030362080] [2023-08-31 23:10:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:47,062 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-31 23:10:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030362080] [2023-08-31 23:10:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030362080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:10:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686134497] [2023-08-31 23:10:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:47,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:10:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:47,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:10:47,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:10:47,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-31 23:10:47,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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-31 23:10:47,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:47,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-31 23:10:47,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:48,021 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][86], [110#P0EXITtrue, Black: 196#(= ~x~0 0), 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 158#true, 119#L793true, P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true, 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-08-31 23:10:48,021 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:48,021 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:48,021 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:48,022 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:48,638 INFO L130 PetriNetUnfolder]: 10299/15441 cut-off events. [2023-08-31 23:10:48,638 INFO L131 PetriNetUnfolder]: For 8811/9343 co-relation queries the response was YES. [2023-08-31 23:10:48,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39655 conditions, 15441 events. 10299/15441 cut-off events. For 8811/9343 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 100372 event pairs, 1668 based on Foata normal form. 1493/16549 useless extension candidates. Maximal degree in co-relation 39645. Up to 8985 conditions per place. [2023-08-31 23:10:48,733 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 80 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2023-08-31 23:10:48,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 103 transitions, 606 flow [2023-08-31 23:10:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:10:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:10:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-31 23:10:48,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-31 23:10:48,736 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-31 23:10:48,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-31 23:10:48,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:48,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-31 23:10:48,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:10:48,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:10:48,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:10:48,741 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 205 flow. Second operand 5 states and 672 transitions. [2023-08-31 23:10:48,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 103 transitions, 606 flow [2023-08-31 23:10:48,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 103 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:10:48,754 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 280 flow [2023-08-31 23:10:48,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-31 23:10:48,755 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-31 23:10:48,755 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 280 flow [2023-08-31 23:10:48,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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-31 23:10:48,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:48,756 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] [2023-08-31 23:10:48,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:10:48,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:48,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -423978331, now seen corresponding path program 1 times [2023-08-31 23:10:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816499502] [2023-08-31 23:10:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:48,943 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-31 23:10:48,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:48,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816499502] [2023-08-31 23:10:48,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816499502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:48,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:48,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:10:48,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894266280] [2023-08-31 23:10:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:48,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:10:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:10:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:10:48,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-31 23:10:48,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-31 23:10:48,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:48,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-31 23:10:48,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:50,958 INFO L130 PetriNetUnfolder]: 18278/25788 cut-off events. [2023-08-31 23:10:50,959 INFO L131 PetriNetUnfolder]: For 34810/34810 co-relation queries the response was YES. [2023-08-31 23:10:51,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88698 conditions, 25788 events. 18278/25788 cut-off events. For 34810/34810 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 151094 event pairs, 1001 based on Foata normal form. 192/25980 useless extension candidates. Maximal degree in co-relation 88684. Up to 11323 conditions per place. [2023-08-31 23:10:51,085 INFO L137 encePairwiseOnDemand]: 269/280 looper letters, 87 selfloop transitions, 28 changer transitions 18/133 dead transitions. [2023-08-31 23:10:51,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 133 transitions, 958 flow [2023-08-31 23:10:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:10:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:10:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-31 23:10:51,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46714285714285714 [2023-08-31 23:10:51,088 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-31 23:10:51,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-31 23:10:51,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:51,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-31 23:10:51,090 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-31 23:10:51,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:10:51,092 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:10:51,092 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 280 flow. Second operand 5 states and 654 transitions. [2023-08-31 23:10:51,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 133 transitions, 958 flow [2023-08-31 23:10:51,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 133 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:10:51,166 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 480 flow [2023-08-31 23:10:51,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=480, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-31 23:10:51,167 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-08-31 23:10:51,167 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 480 flow [2023-08-31 23:10:51,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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-31 23:10:51,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:51,168 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-31 23:10:51,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:10:51,168 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:51,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1384216794, now seen corresponding path program 1 times [2023-08-31 23:10:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:51,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173729583] [2023-08-31 23:10:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:51,360 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-31 23:10:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:51,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173729583] [2023-08-31 23:10:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173729583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:10:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804305596] [2023-08-31 23:10:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:51,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:10:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:10:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:10:51,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-31 23:10:51,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 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-31 23:10:51,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:51,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-31 23:10:51,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:53,329 INFO L130 PetriNetUnfolder]: 18763/26838 cut-off events. [2023-08-31 23:10:53,329 INFO L131 PetriNetUnfolder]: For 60924/60924 co-relation queries the response was YES. [2023-08-31 23:10:53,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101744 conditions, 26838 events. 18763/26838 cut-off events. For 60924/60924 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 160806 event pairs, 4961 based on Foata normal form. 168/27006 useless extension candidates. Maximal degree in co-relation 101727. Up to 11880 conditions per place. [2023-08-31 23:10:53,470 INFO L137 encePairwiseOnDemand]: 270/280 looper letters, 94 selfloop transitions, 28 changer transitions 3/125 dead transitions. [2023-08-31 23:10:53,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 125 transitions, 1062 flow [2023-08-31 23:10:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:10:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:10:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-31 23:10:53,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830357142857143 [2023-08-31 23:10:53,473 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-31 23:10:53,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-31 23:10:53,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:53,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-31 23:10:53,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 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-31 23:10:53,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:10:53,476 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:10:53,476 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 480 flow. Second operand 4 states and 541 transitions. [2023-08-31 23:10:53,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 125 transitions, 1062 flow [2023-08-31 23:10:53,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 125 transitions, 1056 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-31 23:10:53,917 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 708 flow [2023-08-31 23:10:53,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=708, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-08-31 23:10:53,918 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-08-31 23:10:53,918 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 708 flow [2023-08-31 23:10:53,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 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-31 23:10:53,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:53,919 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-31 23:10:53,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:10:53,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:53,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1343123510, now seen corresponding path program 1 times [2023-08-31 23:10:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:53,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050939342] [2023-08-31 23:10:53,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:54,099 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-31 23:10:54,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050939342] [2023-08-31 23:10:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050939342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:10:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311272960] [2023-08-31 23:10:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:54,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:10:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:54,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:10:54,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:10:54,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-31 23:10:54,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 708 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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-31 23:10:54,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:54,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-31 23:10:54,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:55,546 INFO L130 PetriNetUnfolder]: 10124/15850 cut-off events. [2023-08-31 23:10:55,546 INFO L131 PetriNetUnfolder]: For 38373/40414 co-relation queries the response was YES. [2023-08-31 23:10:55,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57470 conditions, 15850 events. 10124/15850 cut-off events. For 38373/40414 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 110784 event pairs, 1270 based on Foata normal form. 1951/17520 useless extension candidates. Maximal degree in co-relation 57451. Up to 5617 conditions per place. [2023-08-31 23:10:55,625 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 140 selfloop transitions, 14 changer transitions 2/185 dead transitions. [2023-08-31 23:10:55,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 185 transitions, 1914 flow [2023-08-31 23:10:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:10:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:10:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2023-08-31 23:10:55,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48154761904761906 [2023-08-31 23:10:55,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2023-08-31 23:10:55,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2023-08-31 23:10:55,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:55,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2023-08-31 23:10:55,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 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-31 23:10:55,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:10:55,632 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:10:55,632 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 708 flow. Second operand 6 states and 809 transitions. [2023-08-31 23:10:55,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 185 transitions, 1914 flow [2023-08-31 23:10:55,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 185 transitions, 1890 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-31 23:10:55,677 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 820 flow [2023-08-31 23:10:55,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=820, PETRI_PLACES=74, PETRI_TRANSITIONS=83} [2023-08-31 23:10:55,678 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-08-31 23:10:55,678 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 820 flow [2023-08-31 23:10:55,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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-31 23:10:55,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:55,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:55,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:10:55,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:55,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1921443718, now seen corresponding path program 1 times [2023-08-31 23:10:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280932380] [2023-08-31 23:10:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:10:55,835 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-31 23:10:55,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:10:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280932380] [2023-08-31 23:10:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280932380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:10:55,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:10:55,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:10:55,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580002538] [2023-08-31 23:10:55,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:10:55,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:10:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:10:55,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:10:55,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:10:55,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-31 23:10:55,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-31 23:10:55,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:10:55,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-31 23:10:55,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:10:56,764 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [33#L876-3true, 233#(<= ~__unbuffered_cnt~0 1), Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 66#L786true, 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:56,764 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:10:56,764 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:56,764 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:56,764 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:10:56,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [33#L876-3true, 233#(<= ~__unbuffered_cnt~0 1), Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, 119#L793true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:56,949 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:56,949 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:56,949 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:56,949 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:56,954 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 66#L786true, 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:56,954 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:10:56,954 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:56,954 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:56,954 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:10:57,165 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [33#L876-3true, Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 230#true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:57,165 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,165 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,165 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,165 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,166 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, 119#L793true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:57,166 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,166 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,166 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,166 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:10:57,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 230#true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:57,382 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,382 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,382 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,382 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,383 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 233#(<= ~__unbuffered_cnt~0 1), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:57,383 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,383 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,383 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,383 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:10:57,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 133#L887true, 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 230#true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-31 23:10:57,587 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:10:57,588 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:10:57,588 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:10:57,588 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:10:58,046 INFO L130 PetriNetUnfolder]: 15203/23820 cut-off events. [2023-08-31 23:10:58,046 INFO L131 PetriNetUnfolder]: For 83040/84748 co-relation queries the response was YES. [2023-08-31 23:10:58,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102003 conditions, 23820 events. 15203/23820 cut-off events. For 83040/84748 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 174696 event pairs, 5127 based on Foata normal form. 516/23742 useless extension candidates. Maximal degree in co-relation 101980. Up to 11713 conditions per place. [2023-08-31 23:10:58,195 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 79 selfloop transitions, 8 changer transitions 12/119 dead transitions. [2023-08-31 23:10:58,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 1269 flow [2023-08-31 23:10:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:10:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:10:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-31 23:10:58,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023809523809524 [2023-08-31 23:10:58,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-31 23:10:58,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-31 23:10:58,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:10:58,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-31 23:10:58,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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-31 23:10:58,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:58,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:10:58,199 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 820 flow. Second operand 3 states and 422 transitions. [2023-08-31 23:10:58,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 1269 flow [2023-08-31 23:10:59,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 1183 flow, removed 34 selfloop flow, removed 2 redundant places. [2023-08-31 23:10:59,850 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 756 flow [2023-08-31 23:10:59,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-08-31 23:10:59,850 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2023-08-31 23:10:59,850 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 756 flow [2023-08-31 23:10:59,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-31 23:10:59,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:10:59,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:10:59,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:10:59,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:10:59,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:10:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1097637608, now seen corresponding path program 1 times [2023-08-31 23:10:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:10:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361351707] [2023-08-31 23:10:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:10:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:10:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:00,076 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-31 23:11:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361351707] [2023-08-31 23:11:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361351707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:00,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:00,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:11:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735332521] [2023-08-31 23:11:00,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:00,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:11:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:00,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:11:00,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:11:00,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-31 23:11:00,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 756 flow. Second operand has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 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-31 23:11:00,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:00,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-31 23:11:00,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:01,907 INFO L130 PetriNetUnfolder]: 11693/18629 cut-off events. [2023-08-31 23:11:01,907 INFO L131 PetriNetUnfolder]: For 49728/51652 co-relation queries the response was YES. [2023-08-31 23:11:01,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70625 conditions, 18629 events. 11693/18629 cut-off events. For 49728/51652 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 138603 event pairs, 1246 based on Foata normal form. 1416/19742 useless extension candidates. Maximal degree in co-relation 70601. Up to 4861 conditions per place. [2023-08-31 23:11:02,007 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 147 selfloop transitions, 23 changer transitions 32/227 dead transitions. [2023-08-31 23:11:02,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 227 transitions, 2394 flow [2023-08-31 23:11:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:11:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:11:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions. [2023-08-31 23:11:02,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2023-08-31 23:11:02,010 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions. [2023-08-31 23:11:02,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions. [2023-08-31 23:11:02,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:02,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions. [2023-08-31 23:11:02,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 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-31 23:11:02,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:02,016 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:02,016 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 756 flow. Second operand 8 states and 1078 transitions. [2023-08-31 23:11:02,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 227 transitions, 2394 flow [2023-08-31 23:11:02,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 227 transitions, 2336 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-31 23:11:02,960 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 879 flow [2023-08-31 23:11:02,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=879, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-08-31 23:11:02,961 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2023-08-31 23:11:02,961 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 879 flow [2023-08-31 23:11:02,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 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-31 23:11:02,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:02,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:02,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:11:02,962 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:02,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1746276705, now seen corresponding path program 1 times [2023-08-31 23:11:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671754516] [2023-08-31 23:11:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:03,211 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-31 23:11:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:03,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671754516] [2023-08-31 23:11:03,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671754516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:03,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:03,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:11:03,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934510193] [2023-08-31 23:11:03,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:03,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:11:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:03,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:11:03,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:11:03,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-31 23:11:03,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 879 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 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-31 23:11:03,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:03,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-31 23:11:03,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:05,237 INFO L130 PetriNetUnfolder]: 11444/18210 cut-off events. [2023-08-31 23:11:05,237 INFO L131 PetriNetUnfolder]: For 53662/55538 co-relation queries the response was YES. [2023-08-31 23:11:05,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75957 conditions, 18210 events. 11444/18210 cut-off events. For 53662/55538 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 135370 event pairs, 1223 based on Foata normal form. 767/18674 useless extension candidates. Maximal degree in co-relation 75931. Up to 4722 conditions per place. [2023-08-31 23:11:05,314 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 85 selfloop transitions, 26 changer transitions 100/223 dead transitions. [2023-08-31 23:11:05,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 223 transitions, 2371 flow [2023-08-31 23:11:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:11:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:11:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1319 transitions. [2023-08-31 23:11:05,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4710714285714286 [2023-08-31 23:11:05,316 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1319 transitions. [2023-08-31 23:11:05,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1319 transitions. [2023-08-31 23:11:05,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:05,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1319 transitions. [2023-08-31 23:11:05,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 131.9) internal successors, (1319), 10 states have internal predecessors, (1319), 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-31 23:11:05,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 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-31 23:11:05,323 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 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-31 23:11:05,323 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 879 flow. Second operand 10 states and 1319 transitions. [2023-08-31 23:11:05,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 223 transitions, 2371 flow [2023-08-31 23:11:07,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 223 transitions, 2281 flow, removed 29 selfloop flow, removed 5 redundant places. [2023-08-31 23:11:07,449 INFO L231 Difference]: Finished difference. Result has 90 places, 63 transitions, 555 flow [2023-08-31 23:11:07,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=555, PETRI_PLACES=90, PETRI_TRANSITIONS=63} [2023-08-31 23:11:07,450 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2023-08-31 23:11:07,450 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 63 transitions, 555 flow [2023-08-31 23:11:07,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 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-31 23:11:07,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:07,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:07,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:11:07,451 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:07,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:07,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1593149568, now seen corresponding path program 1 times [2023-08-31 23:11:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47161801] [2023-08-31 23:11:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:08,504 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-31 23:11:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47161801] [2023-08-31 23:11:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47161801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:11:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782845806] [2023-08-31 23:11:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:08,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:11:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:08,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:11:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:11:08,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 280 [2023-08-31 23:11:08,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 63 transitions, 555 flow. Second operand has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 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-31 23:11:08,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:08,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 280 [2023-08-31 23:11:08,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:09,573 INFO L130 PetriNetUnfolder]: 3176/5065 cut-off events. [2023-08-31 23:11:09,574 INFO L131 PetriNetUnfolder]: For 16537/16537 co-relation queries the response was YES. [2023-08-31 23:11:09,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21381 conditions, 5065 events. 3176/5065 cut-off events. For 16537/16537 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28457 event pairs, 315 based on Foata normal form. 1/5066 useless extension candidates. Maximal degree in co-relation 21353. Up to 2285 conditions per place. [2023-08-31 23:11:09,588 INFO L137 encePairwiseOnDemand]: 266/280 looper letters, 87 selfloop transitions, 17 changer transitions 97/201 dead transitions. [2023-08-31 23:11:09,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 201 transitions, 2002 flow [2023-08-31 23:11:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:11:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:11:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1120 transitions. [2023-08-31 23:11:09,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-31 23:11:09,591 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1120 transitions. [2023-08-31 23:11:09,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1120 transitions. [2023-08-31 23:11:09,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:09,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1120 transitions. [2023-08-31 23:11:09,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.44444444444444) internal successors, (1120), 9 states have internal predecessors, (1120), 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-31 23:11:09,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 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-31 23:11:09,596 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 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-31 23:11:09,596 INFO L175 Difference]: Start difference. First operand has 90 places, 63 transitions, 555 flow. Second operand 9 states and 1120 transitions. [2023-08-31 23:11:09,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 201 transitions, 2002 flow [2023-08-31 23:11:09,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 201 transitions, 1605 flow, removed 66 selfloop flow, removed 17 redundant places. [2023-08-31 23:11:09,671 INFO L231 Difference]: Finished difference. Result has 85 places, 59 transitions, 457 flow [2023-08-31 23:11:09,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=457, PETRI_PLACES=85, PETRI_TRANSITIONS=59} [2023-08-31 23:11:09,672 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-08-31 23:11:09,672 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 59 transitions, 457 flow [2023-08-31 23:11:09,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 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-31 23:11:09,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:09,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:09,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:11:09,673 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:09,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1619797892, now seen corresponding path program 2 times [2023-08-31 23:11:09,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:09,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478583762] [2023-08-31 23:11:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:09,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:09,922 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-31 23:11:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478583762] [2023-08-31 23:11:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478583762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:09,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:11:09,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783303581] [2023-08-31 23:11:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:09,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:11:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:11:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:11:09,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-31 23:11:09,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 59 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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-31 23:11:09,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:09,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-31 23:11:09,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:10,279 INFO L130 PetriNetUnfolder]: 1574/2536 cut-off events. [2023-08-31 23:11:10,279 INFO L131 PetriNetUnfolder]: For 4885/4885 co-relation queries the response was YES. [2023-08-31 23:11:10,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9552 conditions, 2536 events. 1574/2536 cut-off events. For 4885/4885 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12486 event pairs, 306 based on Foata normal form. 1/2537 useless extension candidates. Maximal degree in co-relation 9527. Up to 986 conditions per place. [2023-08-31 23:11:10,288 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 57 selfloop transitions, 5 changer transitions 52/114 dead transitions. [2023-08-31 23:11:10,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 987 flow [2023-08-31 23:11:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:11:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:11:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2023-08-31 23:11:10,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2023-08-31 23:11:10,289 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 755 transitions. [2023-08-31 23:11:10,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 755 transitions. [2023-08-31 23:11:10,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:10,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 755 transitions. [2023-08-31 23:11:10,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 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-31 23:11:10,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:11:10,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:11:10,297 INFO L175 Difference]: Start difference. First operand has 85 places, 59 transitions, 457 flow. Second operand 6 states and 755 transitions. [2023-08-31 23:11:10,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 987 flow [2023-08-31 23:11:10,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 931 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-08-31 23:11:10,322 INFO L231 Difference]: Finished difference. Result has 77 places, 44 transitions, 264 flow [2023-08-31 23:11:10,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2023-08-31 23:11:10,324 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2023-08-31 23:11:10,324 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 44 transitions, 264 flow [2023-08-31 23:11:10,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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-31 23:11:10,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:10,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:10,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:11:10,333 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:10,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1783181762, now seen corresponding path program 3 times [2023-08-31 23:11:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:10,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810410634] [2023-08-31 23:11:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:11,111 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-31 23:11:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:11:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810410634] [2023-08-31 23:11:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810410634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:11,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:11:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657456575] [2023-08-31 23:11:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:11,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:11:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:11:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:11:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:11:11,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-31 23:11:11,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 44 transitions, 264 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 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-31 23:11:11,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:11,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-31 23:11:11,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:11,495 INFO L130 PetriNetUnfolder]: 851/1469 cut-off events. [2023-08-31 23:11:11,496 INFO L131 PetriNetUnfolder]: For 2505/2652 co-relation queries the response was YES. [2023-08-31 23:11:11,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5362 conditions, 1469 events. 851/1469 cut-off events. For 2505/2652 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7343 event pairs, 23 based on Foata normal form. 18/1468 useless extension candidates. Maximal degree in co-relation 5342. Up to 655 conditions per place. [2023-08-31 23:11:11,502 INFO L137 encePairwiseOnDemand]: 272/280 looper letters, 86 selfloop transitions, 11 changer transitions 42/144 dead transitions. [2023-08-31 23:11:11,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 144 transitions, 1060 flow [2023-08-31 23:11:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:11:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:11:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1076 transitions. [2023-08-31 23:11:11,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48035714285714287 [2023-08-31 23:11:11,504 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1076 transitions. [2023-08-31 23:11:11,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1076 transitions. [2023-08-31 23:11:11,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:11,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1076 transitions. [2023-08-31 23:11:11,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-31 23:11:11,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:11,509 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:11,509 INFO L175 Difference]: Start difference. First operand has 77 places, 44 transitions, 264 flow. Second operand 8 states and 1076 transitions. [2023-08-31 23:11:11,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 144 transitions, 1060 flow [2023-08-31 23:11:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 995 flow, removed 7 selfloop flow, removed 12 redundant places. [2023-08-31 23:11:11,522 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 300 flow [2023-08-31 23:11:11,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-08-31 23:11:11,523 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places. [2023-08-31 23:11:11,523 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 300 flow [2023-08-31 23:11:11,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 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-31 23:11:11,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:11,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:11,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:11:11,524 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:11,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash 973784216, now seen corresponding path program 4 times [2023-08-31 23:11:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:11:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863599311] [2023-08-31 23:11:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:11:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:11:11,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:11:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:11:11,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:11:11,659 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:11:11,659 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:11:11,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:11:11,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:11:11,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:11:11,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:11:11,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:11:11,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:11:11,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:11:11,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:11:11,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:11:11,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:11:11,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:11:11,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:11:11,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:11:11,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:11:11,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:11:11,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:11:11,664 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:11,668 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:11:11,669 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:11:11,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:11:11 BasicIcfg [2023-08-31 23:11:11,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:11:11,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:11:11,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:11:11,766 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:11:11,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:10:23" (3/4) ... [2023-08-31 23:11:11,768 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:11:11,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:11:11,769 INFO L158 Benchmark]: Toolchain (without parser) took 49443.65ms. Allocated memory was 71.3MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 47.1MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-08-31 23:11:11,769 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 34.9MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:11:11,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.07ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 39.7MB in the end (delta: 7.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-08-31 23:11:11,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:11:11,770 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 71.3MB. Free memory was 37.2MB in the beginning and 35.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:11:11,770 INFO L158 Benchmark]: RCFGBuilder took 786.95ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 52.6MB in the end (delta: -17.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-08-31 23:11:11,771 INFO L158 Benchmark]: TraceAbstraction took 48039.56ms. Allocated memory was 86.0MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 51.7MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-08-31 23:11:11,771 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 8.3GB. Free memory is still 6.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:11:11,772 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.16ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 34.9MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.07ms. Allocated memory is still 71.3MB. Free memory was 46.9MB in the beginning and 39.7MB in the end (delta: 7.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 71.3MB. Free memory was 37.2MB in the beginning and 35.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 786.95ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 52.6MB in the end (delta: -17.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 48039.56ms. Allocated memory was 86.0MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 51.7MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 8.3GB. Free memory is still 6.6GB. 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: 4.2s, 151 PlacesBefore, 54 PlacesAfterwards, 140 TransitionsBefore, 42 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 11356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4368, independent: 4099, independent conditional: 0, independent unconditional: 4099, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1921, independent: 1854, independent conditional: 0, independent unconditional: 1854, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4368, independent: 2245, independent conditional: 0, independent unconditional: 2245, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1921, unknown conditional: 0, unknown unconditional: 1921] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=-3, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=-2, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=-1, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L825] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 870]: 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: 874]: 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: 876]: 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 9 procedures, 182 locations, 16 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: 47.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 37.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 998 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3348 IncrementalHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 119 mSDtfsCounter, 3348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=13, InterpolantAutomatonStates: 93, 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.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 3220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-31 23:11:11,805 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/mix008_power.oepc_pso.oepc_rmo.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 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:11:14,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:11:14,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:11:14,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:11:14,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:11:14,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:11:14,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:11:14,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:11:14,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:11:14,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:11:14,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:11:14,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:11:14,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:11:14,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:11:14,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:11:14,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:11:14,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:11:14,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:11:14,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:11:14,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:11:14,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:11:14,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:11:14,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:11:14,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:11:14,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:11:14,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:11:14,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:11:14,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:11:14,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:11:14,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:11:14,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:11:14,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:11:14,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:11:14,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:11:14,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:11:14,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:11:14,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:11:14,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:11:14,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:11:14,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:11:14,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:11:14,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:11:14,231 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:11:14,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:11:14,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:11:14,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:11:14,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:11:14,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:11:14,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:11:14,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:11:14,234 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:11:14,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:11:14,235 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:11:14,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:11:14,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:11:14,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:11:14,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:11:14,236 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:11:14,236 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:11:14,236 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:11:14,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:11:14,237 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:11:14,237 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:11:14,237 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:11:14,237 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:11:14,237 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:11:14,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:11:14,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:11:14,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:11:14,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:11:14,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:11:14,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:11:14,238 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:11:14,238 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:11:14,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:11:14,239 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:11:14,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:11:14,239 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:11:14,239 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:11:14,239 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 -> 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:11:14,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:11:14,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:11:14,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:11:14,551 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:11:14,552 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:11:14,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:11:15,607 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:11:15,868 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:11:15,869 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:11:15,887 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf156474/5943a40028354ec48fe0e014fbe2960d/FLAG5815ea0e2 [2023-08-31 23:11:15,906 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf156474/5943a40028354ec48fe0e014fbe2960d [2023-08-31 23:11:15,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:11:15,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:11:15,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:11:15,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:11:15,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:11:15,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:11:15" (1/1) ... [2023-08-31 23:11:15,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@323738ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:15, skipping insertion in model container [2023-08-31 23:11:15,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:11:15" (1/1) ... [2023-08-31 23:11:15,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:11:15,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:11:16,138 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:11:16,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:11:16,310 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:11:16,320 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:11:16,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:11:16,419 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:11:16,419 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:11:16,425 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:11:16,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16 WrapperNode [2023-08-31 23:11:16,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:11:16,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:11:16,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:11:16,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:11:16,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,476 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-31 23:11:16,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:11:16,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:11:16,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:11:16,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:11:16,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,502 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:11:16,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:11:16,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:11:16,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:11:16,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (1/1) ... [2023-08-31 23:11:16,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:11:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:11:16,534 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-31 23:11:16,555 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-31 23:11:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:11:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:11:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:11:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:11:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:11:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:11:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:11:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:11:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:11:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:11:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:11:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:11:16,579 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:11:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:11:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:11:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:11:16,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:11:16,593 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:11:16,790 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:11:16,794 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:11:17,220 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:11:17,372 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:11:17,372 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:11:17,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:17 BoogieIcfgContainer [2023-08-31 23:11:17,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:11:17,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:11:17,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:11:17,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:11:17,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:11:15" (1/3) ... [2023-08-31 23:11:17,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffef2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:11:17, skipping insertion in model container [2023-08-31 23:11:17,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:11:16" (2/3) ... [2023-08-31 23:11:17,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffef2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:11:17, skipping insertion in model container [2023-08-31 23:11:17,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:17" (3/3) ... [2023-08-31 23:11:17,383 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:11:17,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:11:17,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:11:17,398 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:11:17,470 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:11:17,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:11:17,586 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:11:17,586 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:17,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:11:17,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:11:17,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:17,601 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:11:17,613 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:17,617 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:17,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-31 23:11:17,661 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:11:17,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:17,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:11:17,666 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-31 23:11:24,437 INFO L134 LiptonReduction]: Checked pairs total: 10907 [2023-08-31 23:11:24,438 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-31 23:11:24,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:11:24,455 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;@675fa17b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:11:24,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:11:24,456 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:11:24,457 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:24,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:24,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:11:24,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:24,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2023-08-31 23:11:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908327551] [2023-08-31 23:11:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:24,471 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-31 23:11:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:24,481 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-31 23:11:24,484 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-31 23:11:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:24,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:11:24,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:24,562 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-31 23:11:24,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:24,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908327551] [2023-08-31 23:11:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908327551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:11:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785042413] [2023-08-31 23:11:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:24,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:11:24,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:24,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:11:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:11:24,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 280 [2023-08-31 23:11:24,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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-31 23:11:24,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:24,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 280 [2023-08-31 23:11:24,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:26,142 INFO L130 PetriNetUnfolder]: 8719/11889 cut-off events. [2023-08-31 23:11:26,143 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 23:11:26,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23837 conditions, 11889 events. 8719/11889 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 63809 event pairs, 8719 based on Foata normal form. 0/10380 useless extension candidates. Maximal degree in co-relation 23825. Up to 11731 conditions per place. [2023-08-31 23:11:26,217 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-31 23:11:26,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-31 23:11:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:11:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:11:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-31 23:11:26,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303571428571429 [2023-08-31 23:11:26,229 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-31 23:11:26,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-31 23:11:26,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:26,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-31 23:11:26,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 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-31 23:11:26,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:26,246 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:11:26,247 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 297 transitions. [2023-08-31 23:11:26,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-31 23:11:26,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:11:26,256 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-31 23:11:26,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-31 23:11:26,261 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-31 23:11:26,261 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-31 23:11:26,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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-31 23:11:26,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:26,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:11:26,277 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-31 23:11:26,474 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-31 23:11:26,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:26,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash 601451, now seen corresponding path program 1 times [2023-08-31 23:11:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:26,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606789576] [2023-08-31 23:11:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:26,476 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-31 23:11:26,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:26,481 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-31 23:11:26,482 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-31 23:11:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:26,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:11:26,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:26,606 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-31 23:11:26,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:26,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:26,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606789576] [2023-08-31 23:11:26,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606789576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:26,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:26,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:11:26,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105965910] [2023-08-31 23:11:26,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:26,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:11:26,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:26,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:11:26,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:11:26,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 280 [2023-08-31 23:11:26,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-31 23:11:26,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:26,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 280 [2023-08-31 23:11:26,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:27,677 INFO L130 PetriNetUnfolder]: 6855/9366 cut-off events. [2023-08-31 23:11:27,677 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:11:27,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18803 conditions, 9366 events. 6855/9366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 48333 event pairs, 3527 based on Foata normal form. 0/8703 useless extension candidates. Maximal degree in co-relation 18800. Up to 7399 conditions per place. [2023-08-31 23:11:27,723 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-31 23:11:27,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-08-31 23:11:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:11:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:11:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-31 23:11:27,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202380952380953 [2023-08-31 23:11:27,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-31 23:11:27,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-31 23:11:27,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:27,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-31 23:11:27,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-31 23:11:27,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:11:27,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 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-31 23:11:27,731 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 437 transitions. [2023-08-31 23:11:27,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-08-31 23:11:27,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:11:27,733 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-31 23:11:27,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:11:27,734 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-31 23:11:27,734 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-31 23:11:27,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-31 23:11:27,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:27,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:27,747 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-31 23:11:27,944 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-31 23:11:27,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:27,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640907, now seen corresponding path program 1 times [2023-08-31 23:11:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107750988] [2023-08-31 23:11:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:27,946 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-31 23:11:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:27,947 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-31 23:11:27,950 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-31 23:11:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:28,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:11:28,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:28,108 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-31 23:11:28,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:28,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107750988] [2023-08-31 23:11:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107750988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:28,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:28,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:11:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422367216] [2023-08-31 23:11:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:28,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:11:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:28,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:11:28,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:11:28,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-31 23:11:28,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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-31 23:11:28,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:28,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-31 23:11:28,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:28,882 INFO L130 PetriNetUnfolder]: 4483/6404 cut-off events. [2023-08-31 23:11:28,882 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-31 23:11:28,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13353 conditions, 6404 events. 4483/6404 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 35446 event pairs, 818 based on Foata normal form. 320/6479 useless extension candidates. Maximal degree in co-relation 13349. Up to 4756 conditions per place. [2023-08-31 23:11:28,911 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 40 selfloop transitions, 5 changer transitions 27/77 dead transitions. [2023-08-31 23:11:28,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 322 flow [2023-08-31 23:11:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:11:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:11:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-31 23:11:28,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957142857142857 [2023-08-31 23:11:28,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-31 23:11:28,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-31 23:11:28,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:28,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-31 23:11:28,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 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-31 23:11:28,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:11:28,920 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:11:28,920 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 5 states and 694 transitions. [2023-08-31 23:11:28,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 322 flow [2023-08-31 23:11:28,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:11:28,922 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 115 flow [2023-08-31 23:11:28,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-31 23:11:28,923 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-31 23:11:28,923 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 115 flow [2023-08-31 23:11:28,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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-31 23:11:28,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:28,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:28,936 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-31 23:11:29,133 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-31 23:11:29,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:29,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash -670770191, now seen corresponding path program 1 times [2023-08-31 23:11:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161613770] [2023-08-31 23:11:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:29,135 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-31 23:11:29,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:29,136 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-31 23:11:29,144 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-31 23:11:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:29,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:11:29,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:29,280 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-31 23:11:29,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:29,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161613770] [2023-08-31 23:11:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161613770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:11:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688324812] [2023-08-31 23:11:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:29,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:11:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:11:29,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:11:29,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-31 23:11:29,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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-31 23:11:29,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:29,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-31 23:11:29,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:29,864 INFO L130 PetriNetUnfolder]: 2161/3299 cut-off events. [2023-08-31 23:11:29,865 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2023-08-31 23:11:29,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 3299 events. 2161/3299 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17697 event pairs, 403 based on Foata normal form. 212/3402 useless extension candidates. Maximal degree in co-relation 8687. Up to 1426 conditions per place. [2023-08-31 23:11:29,877 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 53 selfloop transitions, 9 changer transitions 27/94 dead transitions. [2023-08-31 23:11:29,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 471 flow [2023-08-31 23:11:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:11:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:11:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 835 transitions. [2023-08-31 23:11:29,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2023-08-31 23:11:29,881 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 835 transitions. [2023-08-31 23:11:29,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 835 transitions. [2023-08-31 23:11:29,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:29,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 835 transitions. [2023-08-31 23:11:29,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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-31 23:11:29,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:11:29,887 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:11:29,887 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 115 flow. Second operand 6 states and 835 transitions. [2023-08-31 23:11:29,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 471 flow [2023-08-31 23:11:29,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 464 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:11:29,901 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 180 flow [2023-08-31 23:11:29,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-31 23:11:29,903 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-31 23:11:29,903 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 180 flow [2023-08-31 23:11:29,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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-31 23:11:29,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:29,904 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] [2023-08-31 23:11:29,915 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 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:11:30,113 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-31 23:11:30,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:30,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1873097572, now seen corresponding path program 1 times [2023-08-31 23:11:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738489667] [2023-08-31 23:11:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:30,114 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-31 23:11:30,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:30,116 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-31 23:11:30,121 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-31 23:11:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:30,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:11:30,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:30,278 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-31 23:11:30,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:30,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738489667] [2023-08-31 23:11:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738489667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:30,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:11:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567035196] [2023-08-31 23:11:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:30,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:11:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:11:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:11:30,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-31 23:11:30,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 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-31 23:11:30,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:30,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-31 23:11:30,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:30,736 INFO L130 PetriNetUnfolder]: 1189/1877 cut-off events. [2023-08-31 23:11:30,736 INFO L131 PetriNetUnfolder]: For 1804/1804 co-relation queries the response was YES. [2023-08-31 23:11:30,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5597 conditions, 1877 events. 1189/1877 cut-off events. For 1804/1804 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9391 event pairs, 331 based on Foata normal form. 77/1908 useless extension candidates. Maximal degree in co-relation 5588. Up to 630 conditions per place. [2023-08-31 23:11:30,745 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 64 selfloop transitions, 13 changer transitions 27/109 dead transitions. [2023-08-31 23:11:30,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 109 transitions, 640 flow [2023-08-31 23:11:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:11:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:11:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 974 transitions. [2023-08-31 23:11:30,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969387755102041 [2023-08-31 23:11:30,748 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 974 transitions. [2023-08-31 23:11:30,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 974 transitions. [2023-08-31 23:11:30,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:30,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 974 transitions. [2023-08-31 23:11:30,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.14285714285714) internal successors, (974), 7 states have internal predecessors, (974), 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-31 23:11:30,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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-31 23:11:30,755 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 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-31 23:11:30,755 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 180 flow. Second operand 7 states and 974 transitions. [2023-08-31 23:11:30,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 109 transitions, 640 flow [2023-08-31 23:11:30,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 578 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:11:30,772 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 230 flow [2023-08-31 23:11:30,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-31 23:11:30,773 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-31 23:11:30,773 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 230 flow [2023-08-31 23:11:30,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 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-31 23:11:30,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:30,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:30,786 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-31 23:11:30,983 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-31 23:11:30,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:30,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1814509636, now seen corresponding path program 1 times [2023-08-31 23:11:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506603801] [2023-08-31 23:11:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:30,985 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-31 23:11:30,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:30,986 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-31 23:11:30,987 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-31 23:11:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:31,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:11:31,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:31,158 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-31 23:11:31,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:31,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506603801] [2023-08-31 23:11:31,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506603801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:31,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:11:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801381350] [2023-08-31 23:11:31,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:31,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:11:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:11:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:11:31,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-31 23:11:31,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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-31 23:11:31,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:31,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-31 23:11:31,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:31,602 INFO L130 PetriNetUnfolder]: 1011/1571 cut-off events. [2023-08-31 23:11:31,602 INFO L131 PetriNetUnfolder]: For 1449/1449 co-relation queries the response was YES. [2023-08-31 23:11:31,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 1571 events. 1011/1571 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7672 event pairs, 326 based on Foata normal form. 14/1552 useless extension candidates. Maximal degree in co-relation 4513. Up to 630 conditions per place. [2023-08-31 23:11:31,609 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 60 selfloop transitions, 17 changer transitions 14/96 dead transitions. [2023-08-31 23:11:31,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 576 flow [2023-08-31 23:11:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:11:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:11:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1085 transitions. [2023-08-31 23:11:31,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2023-08-31 23:11:31,621 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1085 transitions. [2023-08-31 23:11:31,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1085 transitions. [2023-08-31 23:11:31,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:31,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1085 transitions. [2023-08-31 23:11:31,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.625) internal successors, (1085), 8 states have internal predecessors, (1085), 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-31 23:11:31,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:31,631 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:31,631 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 230 flow. Second operand 8 states and 1085 transitions. [2023-08-31 23:11:31,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 576 flow [2023-08-31 23:11:31,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 514 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:11:31,652 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 224 flow [2023-08-31 23:11:31,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-31 23:11:31,654 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-31 23:11:31,654 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 224 flow [2023-08-31 23:11:31,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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-31 23:11:31,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:31,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:31,670 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-31 23:11:31,865 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-31 23:11:31,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:31,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 639618804, now seen corresponding path program 1 times [2023-08-31 23:11:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809619624] [2023-08-31 23:11:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:31,866 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-31 23:11:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:31,867 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-31 23:11:31,868 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-31 23:11:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:31,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:11:31,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:32,446 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-31 23:11:32,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:32,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809619624] [2023-08-31 23:11:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809619624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:11:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386816424] [2023-08-31 23:11:32,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:32,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:11:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:32,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:11:32,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:11:32,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 280 [2023-08-31 23:11:32,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 224 flow. Second operand has 9 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 states have internal predecessors, (1132), 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-31 23:11:32,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:32,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 280 [2023-08-31 23:11:32,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:32,976 INFO L130 PetriNetUnfolder]: 1159/1795 cut-off events. [2023-08-31 23:11:32,977 INFO L131 PetriNetUnfolder]: For 1951/1951 co-relation queries the response was YES. [2023-08-31 23:11:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5335 conditions, 1795 events. 1159/1795 cut-off events. For 1951/1951 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8772 event pairs, 195 based on Foata normal form. 0/1783 useless extension candidates. Maximal degree in co-relation 5324. Up to 773 conditions per place. [2023-08-31 23:11:32,988 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 100 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2023-08-31 23:11:32,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 816 flow [2023-08-31 23:11:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:11:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:11:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1056 transitions. [2023-08-31 23:11:32,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2023-08-31 23:11:32,992 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1056 transitions. [2023-08-31 23:11:32,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1056 transitions. [2023-08-31 23:11:32,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:32,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1056 transitions. [2023-08-31 23:11:32,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 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-31 23:11:32,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:32,999 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 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-31 23:11:32,999 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 224 flow. Second operand 8 states and 1056 transitions. [2023-08-31 23:11:32,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 816 flow [2023-08-31 23:11:33,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 660 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-31 23:11:33,015 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 192 flow [2023-08-31 23:11:33,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-31 23:11:33,015 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2023-08-31 23:11:33,016 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 192 flow [2023-08-31 23:11:33,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 states have internal predecessors, (1132), 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-31 23:11:33,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:33,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:33,030 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-31 23:11:33,227 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-31 23:11:33,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:33,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1789100440, now seen corresponding path program 2 times [2023-08-31 23:11:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:33,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231063204] [2023-08-31 23:11:33,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:11:33,228 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-31 23:11:33,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:33,229 INFO L229 MonitoredProcess]: Starting monitored process 9 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-31 23:11:33,232 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 (9)] Waiting until timeout for monitored process [2023-08-31 23:11:33,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:11:33,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:11:33,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:11:33,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:33,371 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-31 23:11:33,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:33,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:33,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231063204] [2023-08-31 23:11:33,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231063204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:33,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:33,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:11:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547146028] [2023-08-31 23:11:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:33,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:11:33,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:33,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:11:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:11:33,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-31 23:11:33,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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-31 23:11:33,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:33,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-31 23:11:33,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:33,711 INFO L130 PetriNetUnfolder]: 2066/3234 cut-off events. [2023-08-31 23:11:33,711 INFO L131 PetriNetUnfolder]: For 2545/2545 co-relation queries the response was YES. [2023-08-31 23:11:33,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9202 conditions, 3234 events. 2066/3234 cut-off events. For 2545/2545 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18509 event pairs, 858 based on Foata normal form. 1/3189 useless extension candidates. Maximal degree in co-relation 9191. Up to 1777 conditions per place. [2023-08-31 23:11:33,730 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 75 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2023-08-31 23:11:33,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 514 flow [2023-08-31 23:11:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:11:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:11:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-31 23:11:33,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49464285714285716 [2023-08-31 23:11:33,732 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-31 23:11:33,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-31 23:11:33,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:33,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-31 23:11:33,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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-31 23:11:33,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:11:33,736 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:11:33,736 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 192 flow. Second operand 4 states and 554 transitions. [2023-08-31 23:11:33,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 514 flow [2023-08-31 23:11:33,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 506 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:11:33,773 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 220 flow [2023-08-31 23:11:33,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-31 23:11:33,774 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-31 23:11:33,774 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 220 flow [2023-08-31 23:11:33,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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-31 23:11:33,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:33,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:33,787 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 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:11:33,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-31 23:11:33,985 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:33,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash 908120425, now seen corresponding path program 1 times [2023-08-31 23:11:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658282494] [2023-08-31 23:11:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:11:33,986 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-31 23:11:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:33,988 INFO L229 MonitoredProcess]: Starting monitored process 10 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-31 23:11:33,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 (10)] Waiting until timeout for monitored process [2023-08-31 23:11:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:11:34,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:11:34,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:34,764 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-31 23:11:34,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:34,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658282494] [2023-08-31 23:11:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658282494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:34,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:11:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528710305] [2023-08-31 23:11:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:11:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:11:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:11:35,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 280 [2023-08-31 23:11:35,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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-31 23:11:35,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:35,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 280 [2023-08-31 23:11:35,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:35,641 INFO L130 PetriNetUnfolder]: 1816/2885 cut-off events. [2023-08-31 23:11:35,641 INFO L131 PetriNetUnfolder]: For 2413/2413 co-relation queries the response was YES. [2023-08-31 23:11:35,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8445 conditions, 2885 events. 1816/2885 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16480 event pairs, 136 based on Foata normal form. 4/2871 useless extension candidates. Maximal degree in co-relation 8432. Up to 2393 conditions per place. [2023-08-31 23:11:35,654 INFO L137 encePairwiseOnDemand]: 275/280 looper letters, 47 selfloop transitions, 4 changer transitions 20/76 dead transitions. [2023-08-31 23:11:35,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 488 flow [2023-08-31 23:11:35,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:11:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:11:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2023-08-31 23:11:35,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2023-08-31 23:11:35,658 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2023-08-31 23:11:35,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2023-08-31 23:11:35,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:35,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2023-08-31 23:11:35,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 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-31 23:11:35,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:11:35,663 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 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-31 23:11:35,663 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 220 flow. Second operand 6 states and 704 transitions. [2023-08-31 23:11:35,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 488 flow [2023-08-31 23:11:35,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:11:35,684 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 184 flow [2023-08-31 23:11:35,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2023-08-31 23:11:35,685 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2023-08-31 23:11:35,685 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 184 flow [2023-08-31 23:11:35,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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-31 23:11:35,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:35,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:35,698 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 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:11:35,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-31 23:11:35,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:35,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:35,897 INFO L85 PathProgramCache]: Analyzing trace with hash -610322892, now seen corresponding path program 3 times [2023-08-31 23:11:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157004553] [2023-08-31 23:11:35,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:11:35,899 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-31 23:11:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:35,900 INFO L229 MonitoredProcess]: Starting monitored process 11 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-31 23:11:35,903 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 (11)] Waiting until timeout for monitored process [2023-08-31 23:11:36,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:11:36,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:11:36,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:11:36,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:36,062 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-31 23:11:36,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:36,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157004553] [2023-08-31 23:11:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157004553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:11:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56444229] [2023-08-31 23:11:36,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:36,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:11:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:36,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:11:36,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:11:36,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-31 23:11:36,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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-31 23:11:36,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:36,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-31 23:11:36,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:36,348 INFO L130 PetriNetUnfolder]: 1262/2041 cut-off events. [2023-08-31 23:11:36,348 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2023-08-31 23:11:36,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 2041 events. 1262/2041 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10757 event pairs, 542 based on Foata normal form. 1/2011 useless extension candidates. Maximal degree in co-relation 5940. Up to 1159 conditions per place. [2023-08-31 23:11:36,356 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 54 selfloop transitions, 2 changer transitions 12/72 dead transitions. [2023-08-31 23:11:36,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 462 flow [2023-08-31 23:11:36,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:11:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:11:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-31 23:11:36,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4901785714285714 [2023-08-31 23:11:36,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-31 23:11:36,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-31 23:11:36,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:36,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-31 23:11:36,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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-31 23:11:36,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:11:36,362 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 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-31 23:11:36,362 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 184 flow. Second operand 4 states and 549 transitions. [2023-08-31 23:11:36,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 462 flow [2023-08-31 23:11:36,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 434 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-31 23:11:36,377 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 175 flow [2023-08-31 23:11:36,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-31 23:11:36,378 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2023-08-31 23:11:36,378 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 175 flow [2023-08-31 23:11:36,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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-31 23:11:36,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:36,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:36,389 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 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:11:36,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-31 23:11:36,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:36,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2131053730, now seen corresponding path program 4 times [2023-08-31 23:11:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68632871] [2023-08-31 23:11:36,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:11:36,592 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-31 23:11:36,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:36,593 INFO L229 MonitoredProcess]: Starting monitored process 12 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-31 23:11:36,595 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 (12)] Waiting until timeout for monitored process [2023-08-31 23:11:36,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:11:36,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:11:36,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:11:36,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:11:36,760 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-31 23:11:36,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:11:36,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:11:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68632871] [2023-08-31 23:11:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68632871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:11:36,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:11:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:11:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208129250] [2023-08-31 23:11:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:11:36,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:11:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:11:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:11:36,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:11:36,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 280 [2023-08-31 23:11:36,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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-31 23:11:36,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:11:36,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 280 [2023-08-31 23:11:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:11:37,076 INFO L130 PetriNetUnfolder]: 847/1412 cut-off events. [2023-08-31 23:11:37,076 INFO L131 PetriNetUnfolder]: For 1194/1197 co-relation queries the response was YES. [2023-08-31 23:11:37,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 1412 events. 847/1412 cut-off events. For 1194/1197 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6480 event pairs, 316 based on Foata normal form. 1/1399 useless extension candidates. Maximal degree in co-relation 4058. Up to 540 conditions per place. [2023-08-31 23:11:37,082 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 43 selfloop transitions, 1 changer transitions 34/82 dead transitions. [2023-08-31 23:11:37,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 522 flow [2023-08-31 23:11:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:11:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:11:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-31 23:11:37,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48142857142857143 [2023-08-31 23:11:37,084 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-31 23:11:37,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-31 23:11:37,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:11:37,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-31 23:11:37,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 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-31 23:11:37,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:11:37,089 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 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-31 23:11:37,089 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 175 flow. Second operand 5 states and 674 transitions. [2023-08-31 23:11:37,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 522 flow [2023-08-31 23:11:37,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 510 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:11:37,099 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 176 flow [2023-08-31 23:11:37,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-31 23:11:37,100 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2023-08-31 23:11:37,100 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 176 flow [2023-08-31 23:11:37,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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-31 23:11:37,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:11:37,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:37,113 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 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:11:37,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-31 23:11:37,311 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:11:37,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:11:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1631139888, now seen corresponding path program 5 times [2023-08-31 23:11:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:11:37,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272704608] [2023-08-31 23:11:37,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:11:37,312 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-31 23:11:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:11:37,313 INFO L229 MonitoredProcess]: Starting monitored process 13 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-31 23:11:37,316 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 (13)] Waiting until timeout for monitored process [2023-08-31 23:11:37,475 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:11:37,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:11:37,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:11:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:11:37,667 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:11:37,667 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:11:37,668 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:11:37,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:11:37,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:11:37,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:11:37,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:11:37,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:11:37,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:11:37,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:11:37,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:11:37,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:11:37,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:11:37,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:11:37,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:11:37,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:11:37,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:11:37,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:11:37,693 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 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:11:37,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-31 23:11:37,893 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:11:37,898 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:11:37,898 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:11:38,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:11:38 BasicIcfg [2023-08-31 23:11:38,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:11:38,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:11:38,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:11:38,009 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:11:38,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:11:17" (3/4) ... [2023-08-31 23:11:38,034 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:11:38,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:11:38,035 INFO L158 Benchmark]: Toolchain (without parser) took 22124.37ms. Allocated memory was 73.4MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 42.3MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 725.1MB. Max. memory is 16.1GB. [2023-08-31 23:11:38,035 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:11:38,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.44ms. Allocated memory is still 73.4MB. Free memory was 42.1MB in the beginning and 39.0MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-31 23:11:38,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.65ms. Allocated memory is still 73.4MB. Free memory was 39.0MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:11:38,036 INFO L158 Benchmark]: Boogie Preprocessor took 29.04ms. Allocated memory is still 73.4MB. Free memory was 36.3MB in the beginning and 34.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:11:38,036 INFO L158 Benchmark]: RCFGBuilder took 867.59ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 34.2MB in the beginning and 56.1MB in the end (delta: -21.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-08-31 23:11:38,036 INFO L158 Benchmark]: TraceAbstraction took 20631.47ms. Allocated memory was 92.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 55.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 716.1MB. Max. memory is 16.1GB. [2023-08-31 23:11:38,036 INFO L158 Benchmark]: Witness Printer took 25.47ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.7GB in the end (delta: -619.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:11:38,039 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.17ms. Allocated memory is still 73.4MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.44ms. Allocated memory is still 73.4MB. Free memory was 42.1MB in the beginning and 39.0MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.65ms. Allocated memory is still 73.4MB. Free memory was 39.0MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.04ms. Allocated memory is still 73.4MB. Free memory was 36.3MB in the beginning and 34.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 867.59ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 34.2MB in the beginning and 56.1MB in the end (delta: -21.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20631.47ms. Allocated memory was 92.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 55.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 716.1MB. Max. memory is 16.1GB. * Witness Printer took 25.47ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.7GB in the end (delta: -619.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 152 PlacesBefore, 54 PlacesAfterwards, 141 TransitionsBefore, 42 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 10907 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3709, independent: 3455, independent conditional: 0, independent unconditional: 3455, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1825, independent: 1776, independent conditional: 0, independent unconditional: 1776, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3709, independent: 1679, independent conditional: 0, independent unconditional: 1679, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1825, unknown conditional: 0, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=0, t209={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=1, t209={11:0}, t210={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t211; [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=2, t209={11:0}, t210={15:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=3, t209={11:0}, t210={15:0}, t211={7:0}, t212={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L825] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={11:0}, t210={15:0}, t211={7:0}, t212={-2147483637:0}, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 870]: 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: 876]: 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: 874]: 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 9 procedures, 183 locations, 16 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: 20.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 589 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 490 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2396 IncrementalHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 17 mSDtfsCounter, 2396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=5, InterpolantAutomatonStates: 58, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 15 QuantifiedInterpolants, 2046 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-31 23:11:38,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample