./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix023_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 b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:20:44,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:20:44,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:20:44,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:20:44,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:20:44,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:20:44,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:20:44,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:20:44,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:20:44,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:20:44,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:20:44,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:20:44,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:20:44,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:20:44,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:20:44,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:20:44,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:20:44,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:20:44,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:20:44,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:20:44,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:20:44,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:20:44,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:20:44,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:20:44,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:20:44,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:20:44,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:20:44,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:20:44,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:20:44,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:20:44,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:20:44,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:20:44,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:20:44,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:20:44,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:20:44,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:20:44,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:20:44,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:20:44,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:20:44,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:20:44,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:20:44,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:20:44,600 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:20:44,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:20:44,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:20:44,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:20:44,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:20:44,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:20:44,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:20:44,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:20:44,603 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:20:44,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:20:44,604 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:20:44,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:20:44,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:20:44,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:20:44,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:20:44,605 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:20:44,606 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:20:44,606 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:20:44,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:20:44,606 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:20:44,606 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:20:44,607 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:20:44,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:20:44,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:20:44,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:20:44,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:20:44,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:20:44,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:20:44,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:20:44,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:20:44,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:20:44,609 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:20:44,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:20:44,609 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:20:44,609 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 -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 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 -> AFTER [2023-08-29 20:20:44,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:20:44,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:20:44,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:20:44,890 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:20:44,891 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:20:44,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:20:45,937 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:20:46,247 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:20:46,248 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:20:46,266 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e14c89a/e45ee7c208c24c649c740876e2292589/FLAGc770ad1fd [2023-08-29 20:20:46,280 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e14c89a/e45ee7c208c24c649c740876e2292589 [2023-08-29 20:20:46,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:20:46,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:20:46,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:20:46,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:20:46,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:20:46,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703a1039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46, skipping insertion in model container [2023-08-29 20:20:46,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:20:46,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:20:46,446 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:20:46,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:20:46,609 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:20:46,619 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:20:46,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:20:46,740 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:20:46,742 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:20:46,748 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:20:46,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46 WrapperNode [2023-08-29 20:20:46,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:20:46,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:20:46,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:20:46,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:20:46,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,826 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-29 20:20:46,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:20:46,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:20:46,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:20:46,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:20:46,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:20:46,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:20:46,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:20:46,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:20:46,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (1/1) ... [2023-08-29 20:20:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:20:46,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:20:46,906 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-29 20:20:46,927 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-29 20:20:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:20:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:20:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:20:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:20:46,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:20:46,943 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:20:46,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:20:46,943 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:20:46,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:20:46,943 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:20:46,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:20:46,943 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:20:46,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:20:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:20:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:20:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:20:46,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:20:46,946 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:20:47,121 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:20:47,122 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:20:47,532 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:20:47,644 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:20:47,645 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:20:47,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:47 BoogieIcfgContainer [2023-08-29 20:20:47,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:20:47,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:20:47,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:20:47,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:20:47,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:20:46" (1/3) ... [2023-08-29 20:20:47,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dfd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:20:47, skipping insertion in model container [2023-08-29 20:20:47,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:46" (2/3) ... [2023-08-29 20:20:47,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dfd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:20:47, skipping insertion in model container [2023-08-29 20:20:47,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:47" (3/3) ... [2023-08-29 20:20:47,664 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:20:47,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:20:47,679 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:20:47,679 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:20:47,750 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:20:47,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-29 20:20:47,858 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-29 20:20:47,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:47,863 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 108 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-29 20:20:47,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-29 20:20:47,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:47,875 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:20:47,895 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:47,898 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:47,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:47,944 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-29 20:20:47,945 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:47,946 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 108 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-29 20:20:47,949 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-08-29 20:20:52,322 INFO L134 LiptonReduction]: Checked pairs total: 11191 [2023-08-29 20:20:52,322 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-29 20:20:52,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:20:52,353 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;@1a72d73b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:20:52,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:20:52,356 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:20:52,356 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:52,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:52,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:20:52,358 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-29 20:20:52,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 608, now seen corresponding path program 1 times [2023-08-29 20:20:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:52,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526720595] [2023-08-29 20:20:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:52,456 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-29 20:20:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526720595] [2023-08-29 20:20:52,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526720595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:52,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:52,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:20:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645356684] [2023-08-29 20:20:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:52,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:20:52,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:20:52,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:20:52,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 276 [2023-08-29 20:20:52,491 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-29 20:20:52,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:52,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 276 [2023-08-29 20:20:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:53,940 INFO L130 PetriNetUnfolder]: 8719/11875 cut-off events. [2023-08-29 20:20:53,940 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-29 20:20:53,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23823 conditions, 11875 events. 8719/11875 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 64046 event pairs, 8719 based on Foata normal form. 0/10347 useless extension candidates. Maximal degree in co-relation 23811. Up to 11731 conditions per place. [2023-08-29 20:20:54,040 INFO L137 encePairwiseOnDemand]: 267/276 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-29 20:20:54,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-29 20:20:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:20:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:20:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-29 20:20:54,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344202898550725 [2023-08-29 20:20:54,053 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-29 20:20:54,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-29 20:20:54,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:54,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-29 20:20:54,064 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-29 20:20:54,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:54,068 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:54,070 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 295 transitions. [2023-08-29 20:20:54,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-29 20:20:54,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:20:54,079 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-29 20:20:54,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, 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-29 20:20:54,084 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-29 20:20:54,085 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-29 20:20:54,085 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-29 20:20:54,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:54,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:20:54,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:20:54,089 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-29 20:20:54,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash 596520, now seen corresponding path program 1 times [2023-08-29 20:20:54,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:54,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100299041] [2023-08-29 20:20:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:54,380 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-29 20:20:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100299041] [2023-08-29 20:20:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100299041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:20:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951616476] [2023-08-29 20:20:54,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:54,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:20:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:54,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:20:54,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:20:54,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 276 [2023-08-29 20:20:54,393 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-29 20:20:54,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:54,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 276 [2023-08-29 20:20:54,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:55,395 INFO L130 PetriNetUnfolder]: 6855/9363 cut-off events. [2023-08-29 20:20:55,396 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:55,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18800 conditions, 9363 events. 6855/9363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 48315 event pairs, 3527 based on Foata normal form. 0/8697 useless extension candidates. Maximal degree in co-relation 18797. Up to 7399 conditions per place. [2023-08-29 20:20:55,442 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-29 20:20:55,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-08-29 20:20:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:20:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:20:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-29 20:20:55,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241545893719807 [2023-08-29 20:20:55,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-29 20:20:55,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-29 20:20:55,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:55,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-29 20:20:55,447 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-29 20:20:55,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 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-29 20:20:55,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 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-29 20:20:55,451 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 434 transitions. [2023-08-29 20:20:55,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-08-29 20:20:55,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:20:55,453 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-29 20:20:55,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, 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-29 20:20:55,454 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-29 20:20:55,454 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-29 20:20:55,454 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-29 20:20:55,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:55,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:55,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:20:55,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:55,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1393915186, now seen corresponding path program 1 times [2023-08-29 20:20:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:55,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666979619] [2023-08-29 20:20:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:56,116 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-29 20:20:56,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666979619] [2023-08-29 20:20:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666979619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:56,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614458487] [2023-08-29 20:20:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:56,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:20:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:20:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:20:56,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 276 [2023-08-29 20:20:56,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 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-29 20:20:56,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:56,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 276 [2023-08-29 20:20:56,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:57,027 INFO L130 PetriNetUnfolder]: 4903/6783 cut-off events. [2023-08-29 20:20:57,027 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2023-08-29 20:20:57,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14072 conditions, 6783 events. 4903/6783 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 35014 event pairs, 1864 based on Foata normal form. 0/6732 useless extension candidates. Maximal degree in co-relation 14068. Up to 6432 conditions per place. [2023-08-29 20:20:57,077 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 39 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-29 20:20:57,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 200 flow [2023-08-29 20:20:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2023-08-29 20:20:57,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428743961352657 [2023-08-29 20:20:57,080 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 710 transitions. [2023-08-29 20:20:57,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 710 transitions. [2023-08-29 20:20:57,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:57,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 710 transitions. [2023-08-29 20:20:57,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 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-29 20:20:57,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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-29 20:20:57,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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-29 20:20:57,087 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 6 states and 710 transitions. [2023-08-29 20:20:57,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 200 flow [2023-08-29 20:20:57,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:20:57,089 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 76 flow [2023-08-29 20:20:57,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-29 20:20:57,090 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-29 20:20:57,090 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 76 flow [2023-08-29 20:20:57,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 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-29 20:20:57,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:57,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:57,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:20:57,092 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-29 20:20:57,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1393915246, now seen corresponding path program 1 times [2023-08-29 20:20:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:57,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433610518] [2023-08-29 20:20:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:57,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:57,262 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-29 20:20:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433610518] [2023-08-29 20:20:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433610518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:20:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437920465] [2023-08-29 20:20:57,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:57,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:20:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:20:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:20:57,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 276 [2023-08-29 20:20:57,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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-29 20:20:57,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:57,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 276 [2023-08-29 20:20:57,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:00,293 INFO L130 PetriNetUnfolder]: 29612/39983 cut-off events. [2023-08-29 20:21:00,293 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2023-08-29 20:21:00,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80888 conditions, 39983 events. 29612/39983 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 223157 event pairs, 9027 based on Foata normal form. 1635/41618 useless extension candidates. Maximal degree in co-relation 80884. Up to 20747 conditions per place. [2023-08-29 20:21:00,498 INFO L137 encePairwiseOnDemand]: 265/276 looper letters, 46 selfloop transitions, 9 changer transitions 37/92 dead transitions. [2023-08-29 20:21:00,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 392 flow [2023-08-29 20:21:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-29 20:21:00,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48478260869565215 [2023-08-29 20:21:00,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-29 20:21:00,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-29 20:21:00,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:00,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-29 20:21:00,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 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-29 20:21:00,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:00,508 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:00,508 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 76 flow. Second operand 5 states and 669 transitions. [2023-08-29 20:21:00,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 392 flow [2023-08-29 20:21:00,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 92 transitions, 382 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:21:00,511 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 159 flow [2023-08-29 20:21:00,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-29 20:21:00,513 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-29 20:21:00,513 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 159 flow [2023-08-29 20:21:00,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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-29 20:21:00,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:00,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:00,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:21:00,514 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-29 20:21:00,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:00,515 INFO L85 PathProgramCache]: Analyzing trace with hash -261758550, now seen corresponding path program 1 times [2023-08-29 20:21:00,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:00,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214263474] [2023-08-29 20:21:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:00,726 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-29 20:21:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214263474] [2023-08-29 20:21:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214263474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:00,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:00,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:21:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990806470] [2023-08-29 20:21:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:00,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:21:00,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:00,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:21:00,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:21:00,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-08-29 20:21:00,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-29 20:21:00,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:00,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-08-29 20:21:00,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:03,527 INFO L130 PetriNetUnfolder]: 22005/31358 cut-off events. [2023-08-29 20:21:03,527 INFO L131 PetriNetUnfolder]: For 21498/22019 co-relation queries the response was YES. [2023-08-29 20:21:03,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82455 conditions, 31358 events. 22005/31358 cut-off events. For 21498/22019 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 196125 event pairs, 6649 based on Foata normal form. 1321/32064 useless extension candidates. Maximal degree in co-relation 82448. Up to 24125 conditions per place. [2023-08-29 20:21:03,733 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 40 selfloop transitions, 5 changer transitions 27/80 dead transitions. [2023-08-29 20:21:03,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 452 flow [2023-08-29 20:21:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-08-29 20:21:03,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4985507246376812 [2023-08-29 20:21:03,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-08-29 20:21:03,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-08-29 20:21:03,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:03,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-08-29 20:21:03,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-29 20:21:03,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:03,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:03,744 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 159 flow. Second operand 5 states and 688 transitions. [2023-08-29 20:21:03,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 452 flow [2023-08-29 20:21:03,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:21:03,822 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 198 flow [2023-08-29 20:21:03,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-29 20:21:03,824 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-29 20:21:03,825 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 198 flow [2023-08-29 20:21:03,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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-29 20:21:03,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:03,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:03,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:21:03,826 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-29 20:21:03,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash -261741252, now seen corresponding path program 1 times [2023-08-29 20:21:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:03,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128654218] [2023-08-29 20:21:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:03,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:04,028 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-29 20:21:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:04,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128654218] [2023-08-29 20:21:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128654218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:04,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:21:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516755037] [2023-08-29 20:21:04,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:04,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:04,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:04,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:04,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 276 [2023-08-29 20:21:04,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:04,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:04,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 276 [2023-08-29 20:21:04,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:07,044 INFO L130 PetriNetUnfolder]: 25541/34765 cut-off events. [2023-08-29 20:21:07,044 INFO L131 PetriNetUnfolder]: For 44437/44437 co-relation queries the response was YES. [2023-08-29 20:21:07,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98296 conditions, 34765 events. 25541/34765 cut-off events. For 44437/44437 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 189912 event pairs, 5257 based on Foata normal form. 1500/36265 useless extension candidates. Maximal degree in co-relation 98286. Up to 13469 conditions per place. [2023-08-29 20:21:07,213 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 66 selfloop transitions, 9 changer transitions 55/130 dead transitions. [2023-08-29 20:21:07,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 130 transitions, 786 flow [2023-08-29 20:21:07,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-29 20:21:07,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-29 20:21:07,217 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-29 20:21:07,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-29 20:21:07,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:07,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-29 20:21:07,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 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-29 20:21:07,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:07,223 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:07,223 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 198 flow. Second operand 7 states and 920 transitions. [2023-08-29 20:21:07,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 130 transitions, 786 flow [2023-08-29 20:21:07,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 130 transitions, 769 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-29 20:21:07,454 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 275 flow [2023-08-29 20:21:07,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-08-29 20:21:07,454 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2023-08-29 20:21:07,455 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 275 flow [2023-08-29 20:21:07,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:07,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:07,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:07,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:21:07,456 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-29 20:21:07,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 416887652, now seen corresponding path program 1 times [2023-08-29 20:21:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943656596] [2023-08-29 20:21:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:07,662 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-29 20:21:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943656596] [2023-08-29 20:21:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943656596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:07,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:07,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:21:07,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744560134] [2023-08-29 20:21:07,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:07,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:07,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:07,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 276 [2023-08-29 20:21:07,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 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-29 20:21:07,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:07,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 276 [2023-08-29 20:21:07,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:10,296 INFO L130 PetriNetUnfolder]: 23827/32464 cut-off events. [2023-08-29 20:21:10,296 INFO L131 PetriNetUnfolder]: For 78485/78485 co-relation queries the response was YES. [2023-08-29 20:21:10,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102960 conditions, 32464 events. 23827/32464 cut-off events. For 78485/78485 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 179515 event pairs, 4494 based on Foata normal form. 1089/33553 useless extension candidates. Maximal degree in co-relation 102946. Up to 16986 conditions per place. [2023-08-29 20:21:10,463 INFO L137 encePairwiseOnDemand]: 265/276 looper letters, 71 selfloop transitions, 22 changer transitions 46/139 dead transitions. [2023-08-29 20:21:10,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 139 transitions, 965 flow [2023-08-29 20:21:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2023-08-29 20:21:10,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47929606625258797 [2023-08-29 20:21:10,468 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2023-08-29 20:21:10,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2023-08-29 20:21:10,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:10,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2023-08-29 20:21:10,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 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-29 20:21:10,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:10,474 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:10,475 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 275 flow. Second operand 7 states and 926 transitions. [2023-08-29 20:21:10,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 139 transitions, 965 flow [2023-08-29 20:21:10,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 139 transitions, 948 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-29 20:21:10,782 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 481 flow [2023-08-29 20:21:10,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2023-08-29 20:21:10,783 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2023-08-29 20:21:10,783 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 481 flow [2023-08-29 20:21:10,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 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-29 20:21:10,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:10,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:10,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:21:10,784 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-29 20:21:10,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1851732800, now seen corresponding path program 1 times [2023-08-29 20:21:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196693150] [2023-08-29 20:21:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:10,955 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-29 20:21:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196693150] [2023-08-29 20:21:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196693150] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:10,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:10,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:21:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925669731] [2023-08-29 20:21:10,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:10,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:21:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:21:10,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:21:10,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 276 [2023-08-29 20:21:10,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-29 20:21:10,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:10,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 276 [2023-08-29 20:21:10,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:13,175 INFO L130 PetriNetUnfolder]: 16151/23419 cut-off events. [2023-08-29 20:21:13,175 INFO L131 PetriNetUnfolder]: For 82466/83574 co-relation queries the response was YES. [2023-08-29 20:21:13,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77672 conditions, 23419 events. 16151/23419 cut-off events. For 82466/83574 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 147470 event pairs, 4310 based on Foata normal form. 1305/24152 useless extension candidates. Maximal degree in co-relation 77653. Up to 13849 conditions per place. [2023-08-29 20:21:13,305 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 56 selfloop transitions, 4 changer transitions 27/106 dead transitions. [2023-08-29 20:21:13,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 106 transitions, 864 flow [2023-08-29 20:21:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-29 20:21:13,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505072463768116 [2023-08-29 20:21:13,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-29 20:21:13,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-29 20:21:13,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:13,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-29 20:21:13,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 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-29 20:21:13,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:13,313 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:13,313 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 481 flow. Second operand 5 states and 697 transitions. [2023-08-29 20:21:13,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 106 transitions, 864 flow [2023-08-29 20:21:13,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 838 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-29 20:21:13,659 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 475 flow [2023-08-29 20:21:13,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=475, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-08-29 20:21:13,659 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2023-08-29 20:21:13,660 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 475 flow [2023-08-29 20:21:13,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-29 20:21:13,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:13,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:13,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:21:13,661 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-29 20:21:13,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -37119731, now seen corresponding path program 1 times [2023-08-29 20:21:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139454661] [2023-08-29 20:21:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:13,937 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-29 20:21:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:13,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139454661] [2023-08-29 20:21:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139454661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:13,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:13,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:21:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677556797] [2023-08-29 20:21:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:13,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:21:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:13,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:21:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:21:13,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:21:13,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 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-29 20:21:13,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:13,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:21:13,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:15,653 INFO L130 PetriNetUnfolder]: 11468/17088 cut-off events. [2023-08-29 20:21:15,653 INFO L131 PetriNetUnfolder]: For 40058/43556 co-relation queries the response was YES. [2023-08-29 20:21:15,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52516 conditions, 17088 events. 11468/17088 cut-off events. For 40058/43556 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 110920 event pairs, 2154 based on Foata normal form. 1586/18168 useless extension candidates. Maximal degree in co-relation 52496. Up to 10486 conditions per place. [2023-08-29 20:21:15,737 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 107 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2023-08-29 20:21:15,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 1206 flow [2023-08-29 20:21:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-08-29 20:21:15,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4985507246376812 [2023-08-29 20:21:15,740 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-08-29 20:21:15,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-08-29 20:21:15,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:15,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-08-29 20:21:15,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-29 20:21:15,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:15,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:15,744 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 475 flow. Second operand 5 states and 688 transitions. [2023-08-29 20:21:15,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 1206 flow [2023-08-29 20:21:15,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 139 transitions, 1182 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-29 20:21:15,809 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 532 flow [2023-08-29 20:21:15,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-29 20:21:15,810 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2023-08-29 20:21:15,810 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 532 flow [2023-08-29 20:21:15,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 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-29 20:21:15,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:15,811 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-29 20:21:15,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:21:15,811 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-29 20:21:15,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -407600713, now seen corresponding path program 1 times [2023-08-29 20:21:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87926670] [2023-08-29 20:21:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:15,997 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-29 20:21:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87926670] [2023-08-29 20:21:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87926670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:21:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532507370] [2023-08-29 20:21:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:15,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:16,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:21:16,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 532 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 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-29 20:21:16,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:16,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:21:16,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:17,409 INFO L130 PetriNetUnfolder]: 8674/13361 cut-off events. [2023-08-29 20:21:17,410 INFO L131 PetriNetUnfolder]: For 29461/32183 co-relation queries the response was YES. [2023-08-29 20:21:17,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47854 conditions, 13361 events. 8674/13361 cut-off events. For 29461/32183 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 89787 event pairs, 1040 based on Foata normal form. 1073/14004 useless extension candidates. Maximal degree in co-relation 47835. Up to 3951 conditions per place. [2023-08-29 20:21:17,486 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 145 selfloop transitions, 19 changer transitions 0/186 dead transitions. [2023-08-29 20:21:17,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 186 transitions, 1650 flow [2023-08-29 20:21:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 965 transitions. [2023-08-29 20:21:17,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4994824016563147 [2023-08-29 20:21:17,490 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 965 transitions. [2023-08-29 20:21:17,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 965 transitions. [2023-08-29 20:21:17,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:17,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 965 transitions. [2023-08-29 20:21:17,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.85714285714286) internal successors, (965), 7 states have internal predecessors, (965), 0 states have call successors, (0), 0 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-29 20:21:17,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:17,496 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:17,496 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 532 flow. Second operand 7 states and 965 transitions. [2023-08-29 20:21:17,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 186 transitions, 1650 flow [2023-08-29 20:21:17,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 186 transitions, 1645 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:21:17,579 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 661 flow [2023-08-29 20:21:17,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=661, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2023-08-29 20:21:17,581 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2023-08-29 20:21:17,582 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 661 flow [2023-08-29 20:21:17,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 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-29 20:21:17,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:17,583 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-29 20:21:17,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:21:17,583 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-29 20:21:17,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash 796792904, now seen corresponding path program 1 times [2023-08-29 20:21:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:17,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501454972] [2023-08-29 20:21:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:17,873 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-29 20:21:17,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501454972] [2023-08-29 20:21:17,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501454972] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:17,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:17,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:21:17,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549437485] [2023-08-29 20:21:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:17,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:21:17,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:17,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:21:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:21:17,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:21:17,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 661 flow. Second operand has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 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-29 20:21:17,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:17,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:21:17,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:19,320 INFO L130 PetriNetUnfolder]: 7992/12298 cut-off events. [2023-08-29 20:21:19,320 INFO L131 PetriNetUnfolder]: For 36383/38955 co-relation queries the response was YES. [2023-08-29 20:21:19,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49884 conditions, 12298 events. 7992/12298 cut-off events. For 36383/38955 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 82107 event pairs, 895 based on Foata normal form. 520/12398 useless extension candidates. Maximal degree in co-relation 49862. Up to 3715 conditions per place. [2023-08-29 20:21:19,375 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 159 selfloop transitions, 28 changer transitions 12/221 dead transitions. [2023-08-29 20:21:19,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 221 transitions, 2042 flow [2023-08-29 20:21:19,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:21:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:21:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1240 transitions. [2023-08-29 20:21:19,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.499194847020934 [2023-08-29 20:21:19,379 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1240 transitions. [2023-08-29 20:21:19,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1240 transitions. [2023-08-29 20:21:19,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:19,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1240 transitions. [2023-08-29 20:21:19,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.77777777777777) internal successors, (1240), 9 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-29 20:21:19,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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-29 20:21:19,385 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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-29 20:21:19,385 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 661 flow. Second operand 9 states and 1240 transitions. [2023-08-29 20:21:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 221 transitions, 2042 flow [2023-08-29 20:21:19,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 221 transitions, 1990 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-29 20:21:19,866 INFO L231 Difference]: Finished difference. Result has 83 places, 86 transitions, 787 flow [2023-08-29 20:21:19,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=83, PETRI_TRANSITIONS=86} [2023-08-29 20:21:19,867 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2023-08-29 20:21:19,867 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 86 transitions, 787 flow [2023-08-29 20:21:19,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 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-29 20:21:19,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:19,868 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] [2023-08-29 20:21:19,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:21:19,868 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-29 20:21:19,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1932050592, now seen corresponding path program 1 times [2023-08-29 20:21:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355477725] [2023-08-29 20:21:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:20,342 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-29 20:21:20,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:20,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355477725] [2023-08-29 20:21:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355477725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:20,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:21:20,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138800152] [2023-08-29 20:21:20,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:20,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:21:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:21:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:21:20,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 276 [2023-08-29 20:21:20,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 86 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 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-29 20:21:20,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:20,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 276 [2023-08-29 20:21:20,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:23,331 INFO L130 PetriNetUnfolder]: 19979/28830 cut-off events. [2023-08-29 20:21:23,331 INFO L131 PetriNetUnfolder]: For 130444/130444 co-relation queries the response was YES. [2023-08-29 20:21:23,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131740 conditions, 28830 events. 19979/28830 cut-off events. For 130444/130444 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 181736 event pairs, 2363 based on Foata normal form. 17/28847 useless extension candidates. Maximal degree in co-relation 131715. Up to 9307 conditions per place. [2023-08-29 20:21:23,460 INFO L137 encePairwiseOnDemand]: 259/276 looper letters, 163 selfloop transitions, 90 changer transitions 107/360 dead transitions. [2023-08-29 20:21:23,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 360 transitions, 3877 flow [2023-08-29 20:21:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:21:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:21:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1163 transitions. [2023-08-29 20:21:23,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46819645732689213 [2023-08-29 20:21:23,463 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1163 transitions. [2023-08-29 20:21:23,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1163 transitions. [2023-08-29 20:21:23,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:23,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1163 transitions. [2023-08-29 20:21:23,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.22222222222223) internal successors, (1163), 9 states have internal predecessors, (1163), 0 states have call successors, (0), 0 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-29 20:21:23,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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-29 20:21:23,469 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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-29 20:21:23,469 INFO L175 Difference]: Start difference. First operand has 83 places, 86 transitions, 787 flow. Second operand 9 states and 1163 transitions. [2023-08-29 20:21:23,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 360 transitions, 3877 flow [2023-08-29 20:21:25,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 360 transitions, 3324 flow, removed 198 selfloop flow, removed 5 redundant places. [2023-08-29 20:21:25,738 INFO L231 Difference]: Finished difference. Result has 92 places, 141 transitions, 1529 flow [2023-08-29 20:21:25,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1529, PETRI_PLACES=92, PETRI_TRANSITIONS=141} [2023-08-29 20:21:25,738 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2023-08-29 20:21:25,739 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 141 transitions, 1529 flow [2023-08-29 20:21:25,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 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-29 20:21:25,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:25,739 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] [2023-08-29 20:21:25,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:21:25,739 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-29 20:21:25,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 834349238, now seen corresponding path program 2 times [2023-08-29 20:21:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675481153] [2023-08-29 20:21:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:26,293 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-29 20:21:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675481153] [2023-08-29 20:21:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675481153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:26,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:21:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100112295] [2023-08-29 20:21:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:21:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:21:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:21:26,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-29 20:21:26,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 141 transitions, 1529 flow. Second operand has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-29 20:21:26,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:26,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-29 20:21:26,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:27,637 INFO L130 PetriNetUnfolder]: 7198/11700 cut-off events. [2023-08-29 20:21:27,637 INFO L131 PetriNetUnfolder]: For 47286/47753 co-relation queries the response was YES. [2023-08-29 20:21:27,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54946 conditions, 11700 events. 7198/11700 cut-off events. For 47286/47753 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 79625 event pairs, 1079 based on Foata normal form. 178/11713 useless extension candidates. Maximal degree in co-relation 54915. Up to 4252 conditions per place. [2023-08-29 20:21:27,726 INFO L137 encePairwiseOnDemand]: 267/276 looper letters, 128 selfloop transitions, 28 changer transitions 82/283 dead transitions. [2023-08-29 20:21:27,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 283 transitions, 3021 flow [2023-08-29 20:21:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:21:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:21:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1074 transitions. [2023-08-29 20:21:27,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48641304347826086 [2023-08-29 20:21:27,729 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1074 transitions. [2023-08-29 20:21:27,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1074 transitions. [2023-08-29 20:21:27,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:27,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1074 transitions. [2023-08-29 20:21:27,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.25) internal successors, (1074), 8 states have internal predecessors, (1074), 0 states have call successors, (0), 0 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-29 20:21:27,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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-29 20:21:27,734 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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-29 20:21:27,734 INFO L175 Difference]: Start difference. First operand has 92 places, 141 transitions, 1529 flow. Second operand 8 states and 1074 transitions. [2023-08-29 20:21:27,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 283 transitions, 3021 flow [2023-08-29 20:21:28,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 283 transitions, 2817 flow, removed 102 selfloop flow, removed 7 redundant places. [2023-08-29 20:21:28,233 INFO L231 Difference]: Finished difference. Result has 89 places, 143 transitions, 1502 flow [2023-08-29 20:21:28,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1502, PETRI_PLACES=89, PETRI_TRANSITIONS=143} [2023-08-29 20:21:28,233 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2023-08-29 20:21:28,233 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 143 transitions, 1502 flow [2023-08-29 20:21:28,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-29 20:21:28,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:28,234 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] [2023-08-29 20:21:28,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:21:28,234 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-29 20:21:28,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1570679626, now seen corresponding path program 3 times [2023-08-29 20:21:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:28,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712958010] [2023-08-29 20:21:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:28,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:28,895 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-29 20:21:28,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712958010] [2023-08-29 20:21:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712958010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:28,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:28,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:21:28,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144726230] [2023-08-29 20:21:28,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:28,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:21:28,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:28,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:21:28,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:21:28,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 276 [2023-08-29 20:21:28,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 143 transitions, 1502 flow. Second operand has 8 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 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-29 20:21:28,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:28,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 276 [2023-08-29 20:21:28,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:30,758 INFO L130 PetriNetUnfolder]: 8852/13238 cut-off events. [2023-08-29 20:21:30,758 INFO L131 PetriNetUnfolder]: For 63087/63087 co-relation queries the response was YES. [2023-08-29 20:21:30,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68864 conditions, 13238 events. 8852/13238 cut-off events. For 63087/63087 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 77957 event pairs, 763 based on Foata normal form. 12/13250 useless extension candidates. Maximal degree in co-relation 68834. Up to 2973 conditions per place. [2023-08-29 20:21:30,848 INFO L137 encePairwiseOnDemand]: 261/276 looper letters, 179 selfloop transitions, 115 changer transitions 33/327 dead transitions. [2023-08-29 20:21:30,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 327 transitions, 3584 flow [2023-08-29 20:21:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:21:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:21:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1149 transitions. [2023-08-29 20:21:30,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46256038647342995 [2023-08-29 20:21:30,851 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1149 transitions. [2023-08-29 20:21:30,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1149 transitions. [2023-08-29 20:21:30,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:30,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1149 transitions. [2023-08-29 20:21:30,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.66666666666667) internal successors, (1149), 9 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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-29 20:21:30,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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-29 20:21:30,857 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 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-29 20:21:30,857 INFO L175 Difference]: Start difference. First operand has 89 places, 143 transitions, 1502 flow. Second operand 9 states and 1149 transitions. [2023-08-29 20:21:30,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 327 transitions, 3584 flow [2023-08-29 20:21:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 327 transitions, 3423 flow, removed 41 selfloop flow, removed 6 redundant places. [2023-08-29 20:21:31,293 INFO L231 Difference]: Finished difference. Result has 94 places, 174 transitions, 2244 flow [2023-08-29 20:21:31,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2244, PETRI_PLACES=94, PETRI_TRANSITIONS=174} [2023-08-29 20:21:31,294 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 40 predicate places. [2023-08-29 20:21:31,294 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 174 transitions, 2244 flow [2023-08-29 20:21:31,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 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-29 20:21:31,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:31,295 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] [2023-08-29 20:21:31,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:21:31,295 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-29 20:21:31,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2104124682, now seen corresponding path program 4 times [2023-08-29 20:21:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:31,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273999456] [2023-08-29 20:21:31,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:21:31,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273999456] [2023-08-29 20:21:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273999456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:21:31,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609393953] [2023-08-29 20:21:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:31,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:21:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:21:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:21:31,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:21:31,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 174 transitions, 2244 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 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-29 20:21:31,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:31,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:21:31,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:32,742 INFO L130 PetriNetUnfolder]: 6042/9762 cut-off events. [2023-08-29 20:21:32,742 INFO L131 PetriNetUnfolder]: For 63158/64341 co-relation queries the response was YES. [2023-08-29 20:21:32,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51499 conditions, 9762 events. 6042/9762 cut-off events. For 63158/64341 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 66990 event pairs, 598 based on Foata normal form. 424/9940 useless extension candidates. Maximal degree in co-relation 51468. Up to 3678 conditions per place. [2023-08-29 20:21:32,815 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 244 selfloop transitions, 18 changer transitions 65/388 dead transitions. [2023-08-29 20:21:32,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 388 transitions, 5191 flow [2023-08-29 20:21:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:21:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:21:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1076 transitions. [2023-08-29 20:21:32,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48731884057971014 [2023-08-29 20:21:32,818 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1076 transitions. [2023-08-29 20:21:32,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1076 transitions. [2023-08-29 20:21:32,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:32,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1076 transitions. [2023-08-29 20:21:32,820 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-29 20:21:32,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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-29 20:21:32,823 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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-29 20:21:32,824 INFO L175 Difference]: Start difference. First operand has 94 places, 174 transitions, 2244 flow. Second operand 8 states and 1076 transitions. [2023-08-29 20:21:32,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 388 transitions, 5191 flow [2023-08-29 20:21:33,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 388 transitions, 5013 flow, removed 41 selfloop flow, removed 6 redundant places. [2023-08-29 20:21:33,328 INFO L231 Difference]: Finished difference. Result has 97 places, 167 transitions, 2108 flow [2023-08-29 20:21:33,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2108, PETRI_PLACES=97, PETRI_TRANSITIONS=167} [2023-08-29 20:21:33,329 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-08-29 20:21:33,329 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 167 transitions, 2108 flow [2023-08-29 20:21:33,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 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-29 20:21:33,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:33,330 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-29 20:21:33,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:21:33,330 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-29 20:21:33,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash -512025159, now seen corresponding path program 1 times [2023-08-29 20:21:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:33,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731235046] [2023-08-29 20:21:33,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:33,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:33,599 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-29 20:21:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731235046] [2023-08-29 20:21:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731235046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:21:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981920543] [2023-08-29 20:21:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:33,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:21:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:21:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:21:33,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 276 [2023-08-29 20:21:33,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 167 transitions, 2108 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-29 20:21:33,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:33,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 276 [2023-08-29 20:21:33,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:35,345 INFO L130 PetriNetUnfolder]: 11587/17525 cut-off events. [2023-08-29 20:21:35,345 INFO L131 PetriNetUnfolder]: For 117538/117538 co-relation queries the response was YES. [2023-08-29 20:21:35,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99215 conditions, 17525 events. 11587/17525 cut-off events. For 117538/117538 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 110352 event pairs, 1061 based on Foata normal form. 1/17526 useless extension candidates. Maximal degree in co-relation 99186. Up to 6212 conditions per place. [2023-08-29 20:21:35,458 INFO L137 encePairwiseOnDemand]: 264/276 looper letters, 109 selfloop transitions, 71 changer transitions 211/391 dead transitions. [2023-08-29 20:21:35,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 391 transitions, 5417 flow [2023-08-29 20:21:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 898 transitions. [2023-08-29 20:21:35,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648033126293996 [2023-08-29 20:21:35,467 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 898 transitions. [2023-08-29 20:21:35,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 898 transitions. [2023-08-29 20:21:35,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:35,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 898 transitions. [2023-08-29 20:21:35,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 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-29 20:21:35,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:35,472 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 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-29 20:21:35,472 INFO L175 Difference]: Start difference. First operand has 97 places, 167 transitions, 2108 flow. Second operand 7 states and 898 transitions. [2023-08-29 20:21:35,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 391 transitions, 5417 flow [2023-08-29 20:21:36,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 391 transitions, 5002 flow, removed 100 selfloop flow, removed 10 redundant places. [2023-08-29 20:21:36,650 INFO L231 Difference]: Finished difference. Result has 95 places, 141 transitions, 1823 flow [2023-08-29 20:21:36,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1823, PETRI_PLACES=95, PETRI_TRANSITIONS=141} [2023-08-29 20:21:36,651 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2023-08-29 20:21:36,651 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 141 transitions, 1823 flow [2023-08-29 20:21:36,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-29 20:21:36,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:36,652 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-29 20:21:36,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:21:36,652 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-29 20:21:36,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -989028573, now seen corresponding path program 2 times [2023-08-29 20:21:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:36,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598144093] [2023-08-29 20:21:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:36,897 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-29 20:21:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598144093] [2023-08-29 20:21:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598144093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:21:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521395010] [2023-08-29 20:21:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:36,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:36,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 276 [2023-08-29 20:21:36,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 141 transitions, 1823 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 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-29 20:21:36,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:36,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 276 [2023-08-29 20:21:36,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:38,206 INFO L130 PetriNetUnfolder]: 7190/11669 cut-off events. [2023-08-29 20:21:38,206 INFO L131 PetriNetUnfolder]: For 71406/71406 co-relation queries the response was YES. [2023-08-29 20:21:38,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61344 conditions, 11669 events. 7190/11669 cut-off events. For 71406/71406 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 77757 event pairs, 1701 based on Foata normal form. 1/11670 useless extension candidates. Maximal degree in co-relation 61318. Up to 5221 conditions per place. [2023-08-29 20:21:38,258 INFO L137 encePairwiseOnDemand]: 265/276 looper letters, 103 selfloop transitions, 36 changer transitions 91/230 dead transitions. [2023-08-29 20:21:38,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 230 transitions, 3031 flow [2023-08-29 20:21:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-29 20:21:38,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2023-08-29 20:21:38,260 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-29 20:21:38,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-29 20:21:38,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:38,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-29 20:21:38,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-29 20:21:38,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:38,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 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-29 20:21:38,270 INFO L175 Difference]: Start difference. First operand has 95 places, 141 transitions, 1823 flow. Second operand 5 states and 648 transitions. [2023-08-29 20:21:38,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 230 transitions, 3031 flow [2023-08-29 20:21:38,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 230 transitions, 2898 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-29 20:21:38,796 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 1155 flow [2023-08-29 20:21:38,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1155, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2023-08-29 20:21:38,797 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2023-08-29 20:21:38,797 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 1155 flow [2023-08-29 20:21:38,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 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-29 20:21:38,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:38,797 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-29 20:21:38,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:21:38,798 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-29 20:21:38,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash 231912891, now seen corresponding path program 3 times [2023-08-29 20:21:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124726702] [2023-08-29 20:21:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:39,775 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-29 20:21:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:39,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124726702] [2023-08-29 20:21:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124726702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:39,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:39,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:21:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107680564] [2023-08-29 20:21:39,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:39,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:21:39,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:39,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:21:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:21:39,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:21:39,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 1155 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-29 20:21:39,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:39,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:21:39,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:40,774 INFO L130 PetriNetUnfolder]: 3264/5887 cut-off events. [2023-08-29 20:21:40,774 INFO L131 PetriNetUnfolder]: For 30686/30822 co-relation queries the response was YES. [2023-08-29 20:21:40,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29160 conditions, 5887 events. 3264/5887 cut-off events. For 30686/30822 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 40604 event pairs, 504 based on Foata normal form. 77/5889 useless extension candidates. Maximal degree in co-relation 29135. Up to 2457 conditions per place. [2023-08-29 20:21:40,809 INFO L137 encePairwiseOnDemand]: 268/276 looper letters, 116 selfloop transitions, 15 changer transitions 47/202 dead transitions. [2023-08-29 20:21:40,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 202 transitions, 2126 flow [2023-08-29 20:21:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:21:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:21:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1067 transitions. [2023-08-29 20:21:40,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4832427536231884 [2023-08-29 20:21:40,811 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1067 transitions. [2023-08-29 20:21:40,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1067 transitions. [2023-08-29 20:21:40,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:40,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1067 transitions. [2023-08-29 20:21:40,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.375) internal successors, (1067), 8 states have internal predecessors, (1067), 0 states have call successors, (0), 0 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-29 20:21:40,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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-29 20:21:40,816 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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-29 20:21:40,816 INFO L175 Difference]: Start difference. First operand has 93 places, 103 transitions, 1155 flow. Second operand 8 states and 1067 transitions. [2023-08-29 20:21:40,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 202 transitions, 2126 flow [2023-08-29 20:21:40,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 202 transitions, 1932 flow, removed 18 selfloop flow, removed 8 redundant places. [2023-08-29 20:21:41,000 INFO L231 Difference]: Finished difference. Result has 96 places, 99 transitions, 994 flow [2023-08-29 20:21:41,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=96, PETRI_TRANSITIONS=99} [2023-08-29 20:21:41,001 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2023-08-29 20:21:41,001 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 99 transitions, 994 flow [2023-08-29 20:21:41,001 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-29 20:21:41,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:41,001 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-29 20:21:41,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:21:41,002 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:41,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1136263723, now seen corresponding path program 4 times [2023-08-29 20:21:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042754040] [2023-08-29 20:21:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:21:41,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:21:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:21:41,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:21:41,151 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:21:41,152 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:21:41,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:21:41,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:21:41,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:21:41,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:21:41,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:21:41,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:21:41,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:21:41,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:21:41,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:21:41,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:21:41,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:21:41,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:21:41,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:21:41,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:21:41,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:21:41,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:21:41,158 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:41,163 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:21:41,163 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:21:41,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:21:41 BasicIcfg [2023-08-29 20:21:41,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:21:41,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:21:41,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:21:41,269 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:21:41,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:47" (3/4) ... [2023-08-29 20:21:41,272 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:21:41,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:21:41,272 INFO L158 Benchmark]: Toolchain (without parser) took 54989.88ms. Allocated memory was 86.0MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 62.7MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 6.1GB. Max. memory is 16.1GB. [2023-08-29 20:21:41,273 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory is still 43.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:21:41,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.77ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 61.7MB in the end (delta: 722.2kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-08-29 20:21:41,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.05ms. Allocated memory is still 86.0MB. Free memory was 61.7MB in the beginning and 59.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:21:41,273 INFO L158 Benchmark]: Boogie Preprocessor took 38.29ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 57.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:21:41,273 INFO L158 Benchmark]: RCFGBuilder took 789.85ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 40.1MB in the end (delta: 17.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-08-29 20:21:41,274 INFO L158 Benchmark]: TraceAbstraction took 53610.26ms. Allocated memory was 86.0MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 39.4MB in the beginning and 5.3GB in the end (delta: -5.3GB). Peak memory consumption was 6.0GB. Max. memory is 16.1GB. [2023-08-29 20:21:41,274 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 11.4GB. Free memory was 5.3GB in the beginning and 5.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:21:41,275 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 65.0MB. Free memory is still 43.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.77ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 61.7MB in the end (delta: 722.2kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.05ms. Allocated memory is still 86.0MB. Free memory was 61.7MB in the beginning and 59.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.29ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 57.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 789.85ms. Allocated memory is still 86.0MB. Free memory was 57.1MB in the beginning and 40.1MB in the end (delta: 17.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 53610.26ms. Allocated memory was 86.0MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 39.4MB in the beginning and 5.3GB in the end (delta: -5.3GB). Peak memory consumption was 6.0GB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 11.4GB. Free memory was 5.3GB in the beginning and 5.3GB in the end (delta: 1.0MB). 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.4s, 151 PlacesBefore, 54 PlacesAfterwards, 140 TransitionsBefore, 42 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 11191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3716, independent: 3458, independent conditional: 0, independent unconditional: 3458, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1859, independent: 1809, independent conditional: 0, independent unconditional: 1809, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3716, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 1859, unknown conditional: 0, unknown unconditional: 1859] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_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 t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={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_p1_EAX=0, __unbuffered_p1_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_p1_EAX=0, __unbuffered_p1_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_p1_EAX=0, __unbuffered_p1_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 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L791] 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) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 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 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] - 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, 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: 53.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1550 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1302 mSDsluCounter, 958 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 838 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4081 IncrementalHoareTripleChecker+Invalid, 4268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 120 mSDtfsCounter, 4081 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2244occurred in iteration=14, InterpolantAutomatonStates: 115, 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.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 2817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-29 20:21:41,298 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 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/mix023_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 b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:21:43,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:21:43,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:21:43,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:21:43,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:21:43,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:21:43,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:21:43,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:21:43,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:21:43,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:21:43,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:21:43,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:21:43,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:21:43,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:21:43,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:21:43,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:21:43,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:21:43,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:21:43,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:21:43,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:21:43,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:21:43,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:21:43,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:21:43,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:21:43,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:21:43,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:21:43,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:21:43,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:21:43,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:21:43,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:21:43,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:21:43,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:21:43,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:21:43,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:21:43,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:21:43,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:21:43,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:21:43,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:21:43,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:21:43,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:21:43,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:21:43,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:21:43,843 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:21:43,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:21:43,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:21:43,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:21:43,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:21:43,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:21:43,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:21:43,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:21:43,846 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:21:43,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:21:43,847 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:21:43,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:21:43,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:21:43,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:21:43,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:21:43,848 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:21:43,848 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:21:43,849 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:21:43,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:21:43,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:21:43,849 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:21:43,849 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:21:43,849 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:21:43,850 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:21:43,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:21:43,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:21:43,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:21:43,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:21:43,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:21:43,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:21:43,851 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:21:43,851 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:21:43,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:21:43,852 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:21:43,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:21:43,852 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:21:43,852 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:21:43,853 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 -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 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 -> AFTER [2023-08-29 20:21:44,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:21:44,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:21:44,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:21:44,189 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:21:44,189 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:21:44,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:21:45,300 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:21:45,526 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:21:45,527 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:21:45,547 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9349d2d/df45ac61e5c54a60b97e18991c93d328/FLAG80accc8f8 [2023-08-29 20:21:45,563 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9349d2d/df45ac61e5c54a60b97e18991c93d328 [2023-08-29 20:21:45,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:21:45,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:21:45,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:21:45,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:21:45,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:21:45,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:21:45" (1/1) ... [2023-08-29 20:21:45,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4530f61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:45, skipping insertion in model container [2023-08-29 20:21:45,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:21:45" (1/1) ... [2023-08-29 20:21:45,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:21:45,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:21:45,787 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:21:46,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:21:46,033 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:21:46,045 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:21:46,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:21:46,165 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:21:46,165 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:21:46,172 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:21:46,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46 WrapperNode [2023-08-29 20:21:46,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:21:46,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:21:46,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:21:46,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:21:46,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,250 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-29 20:21:46,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:21:46,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:21:46,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:21:46,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:21:46,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,294 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:21:46,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:21:46,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:21:46,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:21:46,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (1/1) ... [2023-08-29 20:21:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:21:46,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:21:46,346 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-29 20:21:46,362 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-29 20:21:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:21:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:21:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:21:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:21:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:21:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:21:46,389 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:21:46,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:21:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:21:46,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:21:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:21:46,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:21:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:21:46,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:21:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:21:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:21:46,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:21:46,392 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:21:46,596 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:21:46,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:21:46,995 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:21:47,166 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:21:47,166 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:21:47,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:21:47 BoogieIcfgContainer [2023-08-29 20:21:47,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:21:47,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:21:47,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:21:47,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:21:47,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:21:45" (1/3) ... [2023-08-29 20:21:47,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2141dcf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:21:47, skipping insertion in model container [2023-08-29 20:21:47,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:46" (2/3) ... [2023-08-29 20:21:47,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2141dcf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:21:47, skipping insertion in model container [2023-08-29 20:21:47,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:21:47" (3/3) ... [2023-08-29 20:21:47,179 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:21:47,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:21:47,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:21:47,195 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:21:47,287 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:21:47,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:21:47,400 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:21:47,400 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:21:47,407 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-29 20:21:47,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:21:47,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-29 20:21:47,414 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:21:47,422 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:21:47,424 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:21:47,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-29 20:21:47,449 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:21:47,449 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:21:47,451 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-29 20:21:47,455 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-08-29 20:21:54,189 INFO L134 LiptonReduction]: Checked pairs total: 10309 [2023-08-29 20:21:54,190 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-29 20:21:54,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:21:54,214 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;@226f47db, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:21:54,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:21:54,216 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:21:54,216 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:21:54,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:54,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:21:54,218 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-29 20:21:54,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2023-08-29 20:21:54,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:21:54,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535552090] [2023-08-29 20:21:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:54,235 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-29 20:21:54,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:21:54,238 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-29 20:21:54,281 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-29 20:21:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:54,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:21:54,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:21:54,328 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-29 20:21:54,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:21:54,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:21:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535552090] [2023-08-29 20:21:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535552090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:21:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679174323] [2023-08-29 20:21:54,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:54,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:21:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:21:54,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:21:54,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:21:54,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 284 [2023-08-29 20:21:54,369 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-29 20:21:54,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:54,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 284 [2023-08-29 20:21:54,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:55,810 INFO L130 PetriNetUnfolder]: 8719/11852 cut-off events. [2023-08-29 20:21:55,810 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 20:21:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23800 conditions, 11852 events. 8719/11852 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 63929 event pairs, 8719 based on Foata normal form. 0/10314 useless extension candidates. Maximal degree in co-relation 23788. Up to 11731 conditions per place. [2023-08-29 20:21:55,887 INFO L137 encePairwiseOnDemand]: 275/284 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-29 20:21:55,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-29 20:21:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:21:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:21:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-29 20:21:55,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522887323943662 [2023-08-29 20:21:55,899 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-29 20:21:55,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-29 20:21:55,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:55,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-29 20:21:55,906 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-29 20:21:55,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 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-29 20:21:55,912 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 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-29 20:21:55,913 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 297 transitions. [2023-08-29 20:21:55,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-29 20:21:55,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:21:55,920 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-29 20:21:55,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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-29 20:21:55,925 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-29 20:21:55,925 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-29 20:21:55,925 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-29 20:21:55,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:55,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:21:55,935 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-29 20:21:56,134 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-29 20:21:56,134 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-29 20:21:56,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 606256, now seen corresponding path program 1 times [2023-08-29 20:21:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:21:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25831058] [2023-08-29 20:21:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:56,136 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-29 20:21:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:21:56,142 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-29 20:21:56,143 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-29 20:21:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:56,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:21:56,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:21:56,275 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-29 20:21:56,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:21:56,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:21:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25831058] [2023-08-29 20:21:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25831058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:56,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:21:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502929198] [2023-08-29 20:21:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:56,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:21:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:21:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:21:56,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:21:56,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 284 [2023-08-29 20:21:56,283 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-29 20:21:56,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:56,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 284 [2023-08-29 20:21:56,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:57,385 INFO L130 PetriNetUnfolder]: 6855/9359 cut-off events. [2023-08-29 20:21:57,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:21:57,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18796 conditions, 9359 events. 6855/9359 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 48581 event pairs, 3527 based on Foata normal form. 0/8691 useless extension candidates. Maximal degree in co-relation 18793. Up to 7399 conditions per place. [2023-08-29 20:21:57,435 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-29 20:21:57,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-08-29 20:21:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:21:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:21:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-29 20:21:57,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129107981220657 [2023-08-29 20:21:57,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-29 20:21:57,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-29 20:21:57,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:57,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-29 20:21:57,444 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-29 20:21:57,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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-29 20:21:57,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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-29 20:21:57,451 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 437 transitions. [2023-08-29 20:21:57,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-08-29 20:21:57,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:21:57,452 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-29 20:21:57,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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-29 20:21:57,453 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-29 20:21:57,453 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-29 20:21:57,454 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-29 20:21:57,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:57,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:57,464 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-29 20:21:57,661 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-29 20:21:57,661 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-29 20:21:57,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash 283772869, now seen corresponding path program 1 times [2023-08-29 20:21:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:21:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071563770] [2023-08-29 20:21:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:57,663 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-29 20:21:57,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:21:57,667 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-29 20:21:57,668 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-29 20:21:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:57,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:21:57,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:21:57,839 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-29 20:21:57,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:21:57,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:21:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071563770] [2023-08-29 20:21:57,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071563770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:57,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:21:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517388967] [2023-08-29 20:21:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:57,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:21:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:21:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:21:57,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:21:57,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 284 [2023-08-29 20:21:57,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 20:21:57,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:57,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 284 [2023-08-29 20:21:57,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:58,611 INFO L130 PetriNetUnfolder]: 4483/6401 cut-off events. [2023-08-29 20:21:58,612 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-29 20:21:58,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13350 conditions, 6401 events. 4483/6401 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 35636 event pairs, 818 based on Foata normal form. 320/6481 useless extension candidates. Maximal degree in co-relation 13346. Up to 4756 conditions per place. [2023-08-29 20:21:58,635 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 40 selfloop transitions, 5 changer transitions 27/77 dead transitions. [2023-08-29 20:21:58,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 322 flow [2023-08-29 20:21:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-29 20:21:58,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478169014084507 [2023-08-29 20:21:58,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-29 20:21:58,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-29 20:21:58,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:58,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-29 20:21:58,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 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-29 20:21:58,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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-29 20:21:58,644 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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-29 20:21:58,644 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 5 states and 679 transitions. [2023-08-29 20:21:58,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 322 flow [2023-08-29 20:21:58,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:21:58,647 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 115 flow [2023-08-29 20:21:58,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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-29 20:21:58,649 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-29 20:21:58,649 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 115 flow [2023-08-29 20:21:58,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-29 20:21:58,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:58,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:58,663 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-29 20:21:58,860 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-29 20:21:58,860 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-29 20:21:58,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash 341316733, now seen corresponding path program 1 times [2023-08-29 20:21:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:21:58,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306656003] [2023-08-29 20:21:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:58,861 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-29 20:21:58,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:21:58,863 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-29 20:21:58,866 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-29 20:21:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:58,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:21:58,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:21:58,999 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-29 20:21:58,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:21:59,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:21:59,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306656003] [2023-08-29 20:21:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306656003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:59,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:59,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:21:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632316581] [2023-08-29 20:21:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:59,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:21:59,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:59,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 284 [2023-08-29 20:21:59,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-29 20:21:59,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:59,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 284 [2023-08-29 20:21:59,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:59,536 INFO L130 PetriNetUnfolder]: 2161/3296 cut-off events. [2023-08-29 20:21:59,537 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2023-08-29 20:21:59,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8691 conditions, 3296 events. 2161/3296 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17879 event pairs, 403 based on Foata normal form. 212/3403 useless extension candidates. Maximal degree in co-relation 8684. Up to 1426 conditions per place. [2023-08-29 20:21:59,551 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 53 selfloop transitions, 9 changer transitions 27/94 dead transitions. [2023-08-29 20:21:59,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 471 flow [2023-08-29 20:21:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:21:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:21:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-29 20:21:59,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794600938967136 [2023-08-29 20:21:59,555 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-29 20:21:59,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-29 20:21:59,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:59,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-29 20:21:59,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 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-29 20:21:59,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 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-29 20:21:59,562 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 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-29 20:21:59,562 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 115 flow. Second operand 6 states and 817 transitions. [2023-08-29 20:21:59,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 471 flow [2023-08-29 20:21:59,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 464 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:21:59,573 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 180 flow [2023-08-29 20:21:59,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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-29 20:21:59,574 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-29 20:21:59,575 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 180 flow [2023-08-29 20:21:59,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-29 20:21:59,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:59,575 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-29 20:21:59,591 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-29 20:21:59,785 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-29 20:21:59,785 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-29 20:21:59,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 913098937, now seen corresponding path program 1 times [2023-08-29 20:21:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:21:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900560302] [2023-08-29 20:21:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:59,787 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-29 20:21:59,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:21:59,789 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-29 20:21:59,791 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-29 20:21:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:59,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:21:59,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:21:59,957 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-29 20:21:59,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:21:59,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:21:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900560302] [2023-08-29 20:21:59,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900560302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:59,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:59,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:21:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132225655] [2023-08-29 20:21:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:59,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:21:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:21:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:21:59,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:21:59,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 284 [2023-08-29 20:21:59,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-29 20:21:59,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:59,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 284 [2023-08-29 20:21:59,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:00,511 INFO L130 PetriNetUnfolder]: 1189/1874 cut-off events. [2023-08-29 20:22:00,511 INFO L131 PetriNetUnfolder]: For 1804/1804 co-relation queries the response was YES. [2023-08-29 20:22:00,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5594 conditions, 1874 events. 1189/1874 cut-off events. For 1804/1804 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9514 event pairs, 331 based on Foata normal form. 77/1909 useless extension candidates. Maximal degree in co-relation 5585. Up to 630 conditions per place. [2023-08-29 20:22:00,521 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 64 selfloop transitions, 13 changer transitions 27/109 dead transitions. [2023-08-29 20:22:00,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 109 transitions, 640 flow [2023-08-29 20:22:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:22:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:22:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2023-08-29 20:22:00,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47937625754527163 [2023-08-29 20:22:00,525 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2023-08-29 20:22:00,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2023-08-29 20:22:00,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:00,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2023-08-29 20:22:00,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 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-29 20:22:00,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 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-29 20:22:00,533 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 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-29 20:22:00,533 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 180 flow. Second operand 7 states and 953 transitions. [2023-08-29 20:22:00,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 109 transitions, 640 flow [2023-08-29 20:22:00,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 578 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:22:00,547 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 230 flow [2023-08-29 20:22:00,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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-29 20:22:00,550 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-29 20:22:00,550 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 230 flow [2023-08-29 20:22:00,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-29 20:22:00,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:00,554 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] [2023-08-29 20:22:00,566 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-29 20:22:00,764 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-29 20:22:00,764 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-29 20:22:00,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -960287432, now seen corresponding path program 1 times [2023-08-29 20:22:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446049963] [2023-08-29 20:22:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:00,766 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-29 20:22:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:00,767 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-29 20:22:00,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:22:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:00,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:22:00,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:00,964 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-29 20:22:00,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:00,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446049963] [2023-08-29 20:22:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446049963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:22:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394014531] [2023-08-29 20:22:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:00,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:22:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:22:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:22:01,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 284 [2023-08-29 20:22:01,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 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-29 20:22:01,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:01,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 284 [2023-08-29 20:22:01,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:01,531 INFO L130 PetriNetUnfolder]: 1011/1568 cut-off events. [2023-08-29 20:22:01,531 INFO L131 PetriNetUnfolder]: For 1449/1449 co-relation queries the response was YES. [2023-08-29 20:22:01,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4520 conditions, 1568 events. 1011/1568 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7768 event pairs, 326 based on Foata normal form. 14/1553 useless extension candidates. Maximal degree in co-relation 4510. Up to 630 conditions per place. [2023-08-29 20:22:01,541 INFO L137 encePairwiseOnDemand]: 277/284 looper letters, 60 selfloop transitions, 17 changer transitions 14/96 dead transitions. [2023-08-29 20:22:01,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 576 flow [2023-08-29 20:22:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:22:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:22:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1061 transitions. [2023-08-29 20:22:01,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669894366197183 [2023-08-29 20:22:01,546 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1061 transitions. [2023-08-29 20:22:01,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1061 transitions. [2023-08-29 20:22:01,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:01,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1061 transitions. [2023-08-29 20:22:01,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.625) internal successors, (1061), 8 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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-29 20:22:01,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 284.0) internal successors, (2556), 9 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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-29 20:22:01,553 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 284.0) internal successors, (2556), 9 states have internal predecessors, (2556), 0 states have call successors, (0), 0 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-29 20:22:01,554 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 230 flow. Second operand 8 states and 1061 transitions. [2023-08-29 20:22:01,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 576 flow [2023-08-29 20:22:01,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 514 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:22:01,569 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 224 flow [2023-08-29 20:22:01,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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-29 20:22:01,570 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-29 20:22:01,570 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 224 flow [2023-08-29 20:22:01,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 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-29 20:22:01,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:01,571 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-29 20:22:01,581 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-29 20:22:01,781 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-29 20:22:01,781 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-29 20:22:01,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1139293467, now seen corresponding path program 1 times [2023-08-29 20:22:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613893700] [2023-08-29 20:22:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:01,783 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-29 20:22:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:01,784 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-29 20:22:01,809 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-29 20:22:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:01,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:22:01,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:02,420 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-29 20:22:02,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:02,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:02,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613893700] [2023-08-29 20:22:02,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613893700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:02,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:22:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830735500] [2023-08-29 20:22:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:02,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:22:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:22:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:22:02,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 284 [2023-08-29 20:22:02,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 224 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-29 20:22:02,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:02,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 284 [2023-08-29 20:22:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:02,910 INFO L130 PetriNetUnfolder]: 1159/1891 cut-off events. [2023-08-29 20:22:02,911 INFO L131 PetriNetUnfolder]: For 2136/2136 co-relation queries the response was YES. [2023-08-29 20:22:02,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5431 conditions, 1891 events. 1159/1891 cut-off events. For 2136/2136 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10582 event pairs, 145 based on Foata normal form. 0/1877 useless extension candidates. Maximal degree in co-relation 5420. Up to 773 conditions per place. [2023-08-29 20:22:02,921 INFO L137 encePairwiseOnDemand]: 278/284 looper letters, 101 selfloop transitions, 6 changer transitions 0/112 dead transitions. [2023-08-29 20:22:02,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 112 transitions, 816 flow [2023-08-29 20:22:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:22:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:22:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-08-29 20:22:02,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47283702213279677 [2023-08-29 20:22:02,925 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-08-29 20:22:02,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-08-29 20:22:02,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:02,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-08-29 20:22:02,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-29 20:22:02,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 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-29 20:22:02,931 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 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-29 20:22:02,931 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 224 flow. Second operand 7 states and 940 transitions. [2023-08-29 20:22:02,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 112 transitions, 816 flow [2023-08-29 20:22:02,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 660 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-29 20:22:02,943 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 184 flow [2023-08-29 20:22:02,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-29 20:22:02,944 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-29 20:22:02,944 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 184 flow [2023-08-29 20:22:02,945 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-29 20:22:02,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:02,945 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-29 20:22:02,962 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-29 20:22:03,155 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-29 20:22:03,156 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-29 20:22:03,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2070088153, now seen corresponding path program 2 times [2023-08-29 20:22:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046934476] [2023-08-29 20:22:03,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:22:03,157 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-29 20:22:03,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:03,158 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-29 20:22:03,161 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-29 20:22:03,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:22:03,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:22:03,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:22:03,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:03,297 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-29 20:22:03,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:03,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046934476] [2023-08-29 20:22:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046934476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:03,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:22:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207324719] [2023-08-29 20:22:03,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:03,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:22:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:03,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:22:03,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:22:03,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 284 [2023-08-29 20:22:03,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 184 flow. Second operand has 3 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-29 20:22:03,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:03,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 284 [2023-08-29 20:22:03,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:03,642 INFO L130 PetriNetUnfolder]: 2066/3238 cut-off events. [2023-08-29 20:22:03,643 INFO L131 PetriNetUnfolder]: For 2529/2529 co-relation queries the response was YES. [2023-08-29 20:22:03,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9199 conditions, 3238 events. 2066/3238 cut-off events. For 2529/2529 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18878 event pairs, 858 based on Foata normal form. 1/3173 useless extension candidates. Maximal degree in co-relation 9189. Up to 1777 conditions per place. [2023-08-29 20:22:03,659 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 75 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2023-08-29 20:22:03,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 494 flow [2023-08-29 20:22:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:22:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:22:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-29 20:22:03,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505868544600939 [2023-08-29 20:22:03,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-29 20:22:03,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-29 20:22:03,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:03,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-29 20:22:03,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-29 20:22:03,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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-29 20:22:03,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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-29 20:22:03,665 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 184 flow. Second operand 3 states and 431 transitions. [2023-08-29 20:22:03,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 494 flow [2023-08-29 20:22:03,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 486 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:22:03,700 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 190 flow [2023-08-29 20:22:03,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-29 20:22:03,701 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-29 20:22:03,701 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 190 flow [2023-08-29 20:22:03,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-29 20:22:03,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:03,702 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-29 20:22:03,715 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-29 20:22:03,912 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-29 20:22:03,912 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-29 20:22:03,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash -227812689, now seen corresponding path program 3 times [2023-08-29 20:22:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:03,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701370824] [2023-08-29 20:22:03,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:22:03,914 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-29 20:22:03,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:03,917 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-29 20:22:03,919 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-29 20:22:04,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:22:04,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:22:04,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:22:04,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:04,093 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-29 20:22:04,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:04,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701370824] [2023-08-29 20:22:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701370824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:04,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:22:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952929512] [2023-08-29 20:22:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:04,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:22:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:22:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:22:04,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 284 [2023-08-29 20:22:04,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 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-29 20:22:04,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:04,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 284 [2023-08-29 20:22:04,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:04,560 INFO L130 PetriNetUnfolder]: 3389/5406 cut-off events. [2023-08-29 20:22:04,560 INFO L131 PetriNetUnfolder]: For 4181/4181 co-relation queries the response was YES. [2023-08-29 20:22:04,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15550 conditions, 5406 events. 3389/5406 cut-off events. For 4181/4181 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 32921 event pairs, 528 based on Foata normal form. 1/5395 useless extension candidates. Maximal degree in co-relation 15539. Up to 2588 conditions per place. [2023-08-29 20:22:04,581 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 92 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2023-08-29 20:22:04,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 610 flow [2023-08-29 20:22:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:22:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:22:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-29 20:22:04,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49471830985915494 [2023-08-29 20:22:04,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-29 20:22:04,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-29 20:22:04,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:04,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-29 20:22:04,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-29 20:22:04,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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-29 20:22:04,588 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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-29 20:22:04,588 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 190 flow. Second operand 4 states and 562 transitions. [2023-08-29 20:22:04,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 610 flow [2023-08-29 20:22:04,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 607 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:22:04,647 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 201 flow [2023-08-29 20:22:04,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=188, 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=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-08-29 20:22:04,648 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-29 20:22:04,648 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 201 flow [2023-08-29 20:22:04,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 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-29 20:22:04,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:04,649 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-29 20:22:04,659 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-29 20:22:04,858 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-29 20:22:04,859 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-29 20:22:04,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash -549122465, now seen corresponding path program 4 times [2023-08-29 20:22:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833914334] [2023-08-29 20:22:04,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:22:04,860 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-29 20:22:04,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:04,861 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-29 20:22:04,864 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-29 20:22:04,977 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:22:04,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:22:04,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:22:04,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:04,998 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-29 20:22:04,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:04,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:04,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833914334] [2023-08-29 20:22:04,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833914334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:04,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:04,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:22:04,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531667024] [2023-08-29 20:22:04,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:05,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:22:05,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:22:05,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:22:05,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 284 [2023-08-29 20:22:05,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 201 flow. Second operand has 3 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-29 20:22:05,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:05,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 284 [2023-08-29 20:22:05,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:05,601 INFO L130 PetriNetUnfolder]: 5141/8054 cut-off events. [2023-08-29 20:22:05,601 INFO L131 PetriNetUnfolder]: For 7544/7555 co-relation queries the response was YES. [2023-08-29 20:22:05,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23931 conditions, 8054 events. 5141/8054 cut-off events. For 7544/7555 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 52770 event pairs, 1708 based on Foata normal form. 1/7942 useless extension candidates. Maximal degree in co-relation 23918. Up to 4126 conditions per place. [2023-08-29 20:22:05,633 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 73 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-29 20:22:05,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 80 transitions, 499 flow [2023-08-29 20:22:05,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:22:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:22:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-29 20:22:05,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011737089201878 [2023-08-29 20:22:05,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-29 20:22:05,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-29 20:22:05,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:05,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-29 20:22:05,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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-29 20:22:05,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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-29 20:22:05,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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-29 20:22:05,638 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 201 flow. Second operand 3 states and 427 transitions. [2023-08-29 20:22:05,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 80 transitions, 499 flow [2023-08-29 20:22:05,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:22:05,806 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 212 flow [2023-08-29 20:22:05,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-08-29 20:22:05,807 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-08-29 20:22:05,807 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 212 flow [2023-08-29 20:22:05,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-29 20:22:05,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:05,807 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-29 20:22:05,821 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-29 20:22:06,018 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-29 20:22:06,018 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-29 20:22:06,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1523326929, now seen corresponding path program 5 times [2023-08-29 20:22:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864330695] [2023-08-29 20:22:06,019 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:22:06,019 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-29 20:22:06,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:06,020 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-29 20:22:06,022 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-29 20:22:06,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:22:06,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:22:06,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:22:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:22:06,328 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:22:06,328 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:22:06,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:22:06,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:22:06,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:22:06,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:22:06,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:22:06,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:22:06,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:22:06,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:22:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:22:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:22:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:22:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:22:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:22:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:22:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:22:06,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:22:06,347 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-29 20:22:06,544 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-29 20:22:06,544 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-29 20:22:06,548 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:22:06,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:22:06,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:22:06 BasicIcfg [2023-08-29 20:22:06,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:22:06,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:22:06,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:22:06,628 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:22:06,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:21:47" (3/4) ... [2023-08-29 20:22:06,631 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:22:06,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:22:06,633 INFO L158 Benchmark]: Toolchain (without parser) took 21066.99ms. Allocated memory was 92.3MB in the beginning and 1.0GB in the end (delta: 943.7MB). Free memory was 68.2MB in the beginning and 671.3MB in the end (delta: -603.0MB). Peak memory consumption was 341.0MB. Max. memory is 16.1GB. [2023-08-29 20:22:06,633 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:22:06,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.91ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 64.3MB in the end (delta: 3.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2023-08-29 20:22:06,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.06ms. Allocated memory is still 92.3MB. Free memory was 64.3MB in the beginning and 61.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:22:06,633 INFO L158 Benchmark]: Boogie Preprocessor took 63.94ms. Allocated memory is still 92.3MB. Free memory was 61.8MB in the beginning and 59.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:22:06,634 INFO L158 Benchmark]: RCFGBuilder took 852.24ms. Allocated memory is still 92.3MB. Free memory was 59.3MB in the beginning and 45.8MB in the end (delta: 13.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-08-29 20:22:06,634 INFO L158 Benchmark]: TraceAbstraction took 19457.24ms. Allocated memory was 92.3MB in the beginning and 1.0GB in the end (delta: 943.7MB). Free memory was 44.8MB in the beginning and 671.3MB in the end (delta: -626.4MB). Peak memory consumption was 319.4MB. Max. memory is 16.1GB. [2023-08-29 20:22:06,634 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 1.0GB. Free memory is still 671.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:22:06,636 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 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.91ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 64.3MB in the end (delta: 3.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.06ms. Allocated memory is still 92.3MB. Free memory was 64.3MB in the beginning and 61.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.94ms. Allocated memory is still 92.3MB. Free memory was 61.8MB in the beginning and 59.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 852.24ms. Allocated memory is still 92.3MB. Free memory was 59.3MB in the beginning and 45.8MB in the end (delta: 13.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19457.24ms. Allocated memory was 92.3MB in the beginning and 1.0GB in the end (delta: 943.7MB). Free memory was 44.8MB in the beginning and 671.3MB in the end (delta: -626.4MB). Peak memory consumption was 319.4MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 1.0GB. Free memory is still 671.3MB. 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: 6.8s, 152 PlacesBefore, 54 PlacesAfterwards, 141 TransitionsBefore, 42 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 6 FixpointIterations, 57 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 10309 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4084, independent: 3855, independent conditional: 0, independent unconditional: 3855, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1912, independent: 1852, independent conditional: 0, independent unconditional: 1852, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4084, independent: 2003, independent conditional: 0, independent unconditional: 2003, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 1912, unknown conditional: 0, unknown unconditional: 1912] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_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 t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t601, ((void *)0), P0, ((void *)0))=0, t601={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_p1_EAX=0, __unbuffered_p1_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 t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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(&t602, ((void *)0), P1, ((void *)0))=1, t601={3:0}, t602={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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] [L791] 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) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 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 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 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_p1_EAX=2, __unbuffered_p1_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] [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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(&t603, ((void *)0), P2, ((void *)0))=2, t601={3:0}, t602={7:0}, t603={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, pthread_create(&t604, ((void *)0), P3, ((void *)0))=3, t601={3:0}, t602={7:0}, t603={11:0}, t604={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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, t601={3:0}, t602={7:0}, t603={11:0}, t604={15:0}, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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=1, z=2] - 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: 19.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1832 IncrementalHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 21 mSDtfsCounter, 1832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=5, InterpolantAutomatonStates: 48, 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.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 763 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1515 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:22:06,653 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