./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix019_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/mix019_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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --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:19:35,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:19:35,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:19:35,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:19:35,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:19:35,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:19:35,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:19:35,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:19:35,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:19:35,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:19:35,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:19:35,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:19:35,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:19:35,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:19:35,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:19:35,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:19:35,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:19:35,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:19:36,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:19:36,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:19:36,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:19:36,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:19:36,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:19:36,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:19:36,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:19:36,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:19:36,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:19:36,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:19:36,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:19:36,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:19:36,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:19:36,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:19:36,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:19:36,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:19:36,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:19:36,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:19:36,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:19:36,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:19:36,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:19:36,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:19:36,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:19:36,030 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:19:36,070 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:19:36,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:19:36,072 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:19:36,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:19:36,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:19:36,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:19:36,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:19:36,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:19:36,074 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:19:36,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:19:36,075 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:19:36,075 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:19:36,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:19:36,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:19:36,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:19:36,076 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:19:36,076 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:19:36,077 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:19:36,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:19:36,077 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:19:36,077 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:19:36,077 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:19:36,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:19:36,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:19:36,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:19:36,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:36,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:19:36,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:19:36,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:19:36,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:19:36,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:19:36,080 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:19:36,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:19:36,080 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:19:36,080 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 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:19:36,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:19:36,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:19:36,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:19:36,410 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:19:36,411 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:19:36,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:19:37,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:19:37,832 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:19:37,833 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:19:37,846 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606e08324/2d5dda466b7842cbb8a06fa8a5568092/FLAGe5014637e [2023-08-29 20:19:38,123 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606e08324/2d5dda466b7842cbb8a06fa8a5568092 [2023-08-29 20:19:38,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:19:38,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:19:38,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:38,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:19:38,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:19:38,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71aa8c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38, skipping insertion in model container [2023-08-29 20:19:38,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:19:38,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:19:38,337 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:19:38,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:38,556 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:19:38,570 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:19:38,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:38,667 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:38,667 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:38,672 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:19:38,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38 WrapperNode [2023-08-29 20:19:38,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:38,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:38,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:19:38,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:19:38,680 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:19:38" (1/1) ... [2023-08-29 20:19:38,710 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:19:38" (1/1) ... [2023-08-29 20:19:38,753 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-29 20:19:38,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:38,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:19:38,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:19:38,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:19:38,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,784 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:19:38,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:19:38,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:19:38,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:19:38,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (1/1) ... [2023-08-29 20:19:38,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:38,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:19:38,824 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:19:38,834 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:19:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:19:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:19:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:19:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:19:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:19:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:19:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:19:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:19:38,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:19:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:19:38,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:19:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:19:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:19:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:19:38,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:19:38,867 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:19:39,036 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:19:39,038 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:19:39,331 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:19:39,452 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:19:39,452 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:19:39,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:39 BoogieIcfgContainer [2023-08-29 20:19:39,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:19:39,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:19:39,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:19:39,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:19:39,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:19:38" (1/3) ... [2023-08-29 20:19:39,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab8ea88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:39, skipping insertion in model container [2023-08-29 20:19:39,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:38" (2/3) ... [2023-08-29 20:19:39,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab8ea88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:39, skipping insertion in model container [2023-08-29 20:19:39,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:39" (3/3) ... [2023-08-29 20:19:39,475 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:19:39,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:19:39,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:19:39,490 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:19:39,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:19:39,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2023-08-29 20:19:39,668 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-29 20:19:39,668 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:39,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-29 20:19:39,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2023-08-29 20:19:39,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2023-08-29 20:19:39,685 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:19:39,706 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-29 20:19:39,709 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-29 20:19:39,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2023-08-29 20:19:39,753 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-29 20:19:39,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:39,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-29 20:19:39,756 INFO L119 LiptonReduction]: Number of co-enabled transitions 2238 [2023-08-29 20:19:43,667 INFO L134 LiptonReduction]: Checked pairs total: 6029 [2023-08-29 20:19:43,668 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-29 20:19:43,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:19:43,686 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;@1a6c0b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:19:43,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:19:43,687 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:19:43,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:43,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:43,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:19:43,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:43,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash 518, now seen corresponding path program 1 times [2023-08-29 20:19:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100955433] [2023-08-29 20:19:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:43,810 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:19:43,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100955433] [2023-08-29 20:19:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100955433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:19:43,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420612906] [2023-08-29 20:19:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:43,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:19:43,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:19:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:19:43,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 230 [2023-08-29 20:19:43,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:19:43,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:43,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 230 [2023-08-29 20:19:43,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:44,270 INFO L130 PetriNetUnfolder]: 1851/2723 cut-off events. [2023-08-29 20:19:44,270 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 20:19:44,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5482 conditions, 2723 events. 1851/2723 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13240 event pairs, 1851 based on Foata normal form. 100/2313 useless extension candidates. Maximal degree in co-relation 5471. Up to 2703 conditions per place. [2023-08-29 20:19:44,287 INFO L137 encePairwiseOnDemand]: 223/230 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-29 20:19:44,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 111 flow [2023-08-29 20:19:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:19:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:19:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-08-29 20:19:44,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2023-08-29 20:19:44,300 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-08-29 20:19:44,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-08-29 20:19:44,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:44,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-08-29 20:19:44,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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:19:44,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:19:44,310 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:19:44,312 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 245 transitions. [2023-08-29 20:19:44,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 111 flow [2023-08-29 20:19:44,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:19:44,317 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-08-29 20:19:44,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-29 20:19:44,322 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-08-29 20:19:44,322 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-08-29 20:19:44,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:19:44,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:44,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:19:44,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:19:44,323 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:44,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash 510803, now seen corresponding path program 1 times [2023-08-29 20:19:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:44,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779470367] [2023-08-29 20:19:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:44,548 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:19:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779470367] [2023-08-29 20:19:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779470367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:44,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:19:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461454767] [2023-08-29 20:19:44,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:44,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:19:44,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:44,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:19:44,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:19:44,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 230 [2023-08-29 20:19:44,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:19:44,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:44,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 230 [2023-08-29 20:19:44,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:44,882 INFO L130 PetriNetUnfolder]: 1447/2302 cut-off events. [2023-08-29 20:19:44,882 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:44,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4475 conditions, 2302 events. 1447/2302 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12924 event pairs, 235 based on Foata normal form. 0/2054 useless extension candidates. Maximal degree in co-relation 4472. Up to 1723 conditions per place. [2023-08-29 20:19:44,893 INFO L137 encePairwiseOnDemand]: 227/230 looper letters, 35 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-29 20:19:44,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 180 flow [2023-08-29 20:19:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:19:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:19:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-29 20:19:44,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2023-08-29 20:19:44,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-29 20:19:44,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-29 20:19:44,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:44,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-29 20:19:44,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:44,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 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:19:44,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 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:19:44,906 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 360 transitions. [2023-08-29 20:19:44,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 180 flow [2023-08-29 20:19:44,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:19:44,907 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 58 flow [2023-08-29 20:19:44,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-29 20:19:44,908 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-08-29 20:19:44,908 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 58 flow [2023-08-29 20:19:44,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:19:44,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:44,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:44,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:19:44,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:44,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 312006758, now seen corresponding path program 1 times [2023-08-29 20:19:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140493481] [2023-08-29 20:19:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:44,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:45,228 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:19:45,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140493481] [2023-08-29 20:19:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140493481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:45,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:19:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221769079] [2023-08-29 20:19:45,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:45,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:45,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:45,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:45,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 230 [2023-08-29 20:19:45,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 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:19:45,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:45,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 230 [2023-08-29 20:19:45,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:45,963 INFO L130 PetriNetUnfolder]: 3725/5428 cut-off events. [2023-08-29 20:19:45,964 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2023-08-29 20:19:45,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11165 conditions, 5428 events. 3725/5428 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27124 event pairs, 908 based on Foata normal form. 0/5204 useless extension candidates. Maximal degree in co-relation 11161. Up to 2546 conditions per place. [2023-08-29 20:19:45,990 INFO L137 encePairwiseOnDemand]: 221/230 looper letters, 58 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2023-08-29 20:19:45,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 72 transitions, 306 flow [2023-08-29 20:19:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-29 20:19:45,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47739130434782606 [2023-08-29 20:19:45,993 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-29 20:19:45,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-29 20:19:45,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:45,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-29 20:19:45,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:45,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:45,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:45,998 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 58 flow. Second operand 5 states and 549 transitions. [2023-08-29 20:19:45,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 72 transitions, 306 flow [2023-08-29 20:19:45,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:46,000 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 166 flow [2023-08-29 20:19:46,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2023-08-29 20:19:46,001 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-29 20:19:46,001 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 166 flow [2023-08-29 20:19:46,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 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:19:46,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:46,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:46,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:19:46,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:46,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1082275949, now seen corresponding path program 1 times [2023-08-29 20:19:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:46,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520027305] [2023-08-29 20:19:46,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:46,322 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:19:46,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:46,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520027305] [2023-08-29 20:19:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520027305] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:46,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:46,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657148455] [2023-08-29 20:19:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:46,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:46,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:46,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 230 [2023-08-29 20:19:46,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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:19:46,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:46,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 230 [2023-08-29 20:19:46,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:47,014 INFO L130 PetriNetUnfolder]: 2436/3766 cut-off events. [2023-08-29 20:19:47,015 INFO L131 PetriNetUnfolder]: For 2989/3054 co-relation queries the response was YES. [2023-08-29 20:19:47,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9903 conditions, 3766 events. 2436/3766 cut-off events. For 2989/3054 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20294 event pairs, 596 based on Foata normal form. 471/4187 useless extension candidates. Maximal degree in co-relation 9896. Up to 2579 conditions per place. [2023-08-29 20:19:47,038 INFO L137 encePairwiseOnDemand]: 225/230 looper letters, 38 selfloop transitions, 5 changer transitions 8/55 dead transitions. [2023-08-29 20:19:47,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 310 flow [2023-08-29 20:19:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2023-08-29 20:19:47,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43043478260869567 [2023-08-29 20:19:47,041 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2023-08-29 20:19:47,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2023-08-29 20:19:47,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:47,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2023-08-29 20:19:47,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:19:47,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:19:47,046 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:19:47,046 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 166 flow. Second operand 6 states and 594 transitions. [2023-08-29 20:19:47,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 310 flow [2023-08-29 20:19:47,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:19:47,050 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 122 flow [2023-08-29 20:19:47,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-29 20:19:47,050 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-29 20:19:47,051 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 122 flow [2023-08-29 20:19:47,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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:19:47,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:47,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:47,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:19:47,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:47,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash -199896688, now seen corresponding path program 1 times [2023-08-29 20:19:47,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:47,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742382050] [2023-08-29 20:19:47,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:47,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:47,214 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:19:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742382050] [2023-08-29 20:19:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742382050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:47,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:47,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:19:47,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110236402] [2023-08-29 20:19:47,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:47,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:47,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:47,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:47,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:47,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 230 [2023-08-29 20:19:47,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:47,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:47,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 230 [2023-08-29 20:19:47,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:47,708 INFO L130 PetriNetUnfolder]: 2060/3222 cut-off events. [2023-08-29 20:19:47,708 INFO L131 PetriNetUnfolder]: For 2266/2323 co-relation queries the response was YES. [2023-08-29 20:19:47,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8431 conditions, 3222 events. 2060/3222 cut-off events. For 2266/2323 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16819 event pairs, 737 based on Foata normal form. 188/3359 useless extension candidates. Maximal degree in co-relation 8423. Up to 2103 conditions per place. [2023-08-29 20:19:47,733 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 29 selfloop transitions, 3 changer transitions 18/54 dead transitions. [2023-08-29 20:19:47,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 300 flow [2023-08-29 20:19:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-29 20:19:47,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-29 20:19:47,736 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-29 20:19:47,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-29 20:19:47,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:47,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-29 20:19:47,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:19:47,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:47,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:47,741 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 122 flow. Second operand 5 states and 552 transitions. [2023-08-29 20:19:47,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 300 flow [2023-08-29 20:19:47,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 270 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-29 20:19:47,750 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 115 flow [2023-08-29 20:19:47,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-29 20:19:47,751 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-29 20:19:47,751 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 115 flow [2023-08-29 20:19:47,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:47,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:47,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:47,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:19:47,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:47,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1664120887, now seen corresponding path program 1 times [2023-08-29 20:19:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:47,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122477477] [2023-08-29 20:19:47,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:47,940 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:19:47,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122477477] [2023-08-29 20:19:47,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122477477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:47,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:47,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:19:47,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125528281] [2023-08-29 20:19:47,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:47,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:47,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:47,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:47,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 230 [2023-08-29 20:19:47,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:19:47,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:47,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 230 [2023-08-29 20:19:47,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:48,352 INFO L130 PetriNetUnfolder]: 2005/3187 cut-off events. [2023-08-29 20:19:48,353 INFO L131 PetriNetUnfolder]: For 2606/2650 co-relation queries the response was YES. [2023-08-29 20:19:48,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8176 conditions, 3187 events. 2005/3187 cut-off events. For 2606/2650 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16885 event pairs, 1018 based on Foata normal form. 160/3307 useless extension candidates. Maximal degree in co-relation 8166. Up to 2609 conditions per place. [2023-08-29 20:19:48,374 INFO L137 encePairwiseOnDemand]: 225/230 looper letters, 33 selfloop transitions, 5 changer transitions 19/61 dead transitions. [2023-08-29 20:19:48,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 339 flow [2023-08-29 20:19:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-29 20:19:48,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808695652173913 [2023-08-29 20:19:48,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-29 20:19:48,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-29 20:19:48,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:48,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-29 20:19:48,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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:19:48,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:48,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:48,380 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 115 flow. Second operand 5 states and 553 transitions. [2023-08-29 20:19:48,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 339 flow [2023-08-29 20:19:48,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 327 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-29 20:19:48,393 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 148 flow [2023-08-29 20:19:48,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-29 20:19:48,394 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-29 20:19:48,394 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 148 flow [2023-08-29 20:19:48,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:19:48,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:48,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:48,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:19:48,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:48,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash -46551471, now seen corresponding path program 1 times [2023-08-29 20:19:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621972499] [2023-08-29 20:19:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:48,644 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:19:48,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:48,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621972499] [2023-08-29 20:19:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621972499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:48,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:48,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835038672] [2023-08-29 20:19:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:48,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:48,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:48,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 230 [2023-08-29 20:19:48,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:19:48,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:48,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 230 [2023-08-29 20:19:48,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:48,943 INFO L130 PetriNetUnfolder]: 1170/1978 cut-off events. [2023-08-29 20:19:48,944 INFO L131 PetriNetUnfolder]: For 1516/1620 co-relation queries the response was YES. [2023-08-29 20:19:48,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5258 conditions, 1978 events. 1170/1978 cut-off events. For 1516/1620 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10907 event pairs, 284 based on Foata normal form. 200/2120 useless extension candidates. Maximal degree in co-relation 5248. Up to 852 conditions per place. [2023-08-29 20:19:48,955 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 50 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-29 20:19:48,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 374 flow [2023-08-29 20:19:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-29 20:19:48,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4902173913043478 [2023-08-29 20:19:48,957 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-29 20:19:48,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-29 20:19:48,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:48,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-29 20:19:48,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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:19:48,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:19:48,960 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:19:48,960 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 148 flow. Second operand 4 states and 451 transitions. [2023-08-29 20:19:48,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 374 flow [2023-08-29 20:19:48,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 365 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:48,964 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 179 flow [2023-08-29 20:19:48,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=4, PETRI_FLOW=179, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-08-29 20:19:48,965 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-29 20:19:48,965 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 179 flow [2023-08-29 20:19:48,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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:19:48,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:48,966 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:19:48,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:19:48,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:48,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1355167754, now seen corresponding path program 1 times [2023-08-29 20:19:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412180882] [2023-08-29 20:19:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:49,171 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:19:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412180882] [2023-08-29 20:19:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412180882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:49,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:49,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234012604] [2023-08-29 20:19:49,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:49,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:49,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 230 [2023-08-29 20:19:49,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:49,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:49,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 230 [2023-08-29 20:19:49,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:49,586 INFO L130 PetriNetUnfolder]: 1650/2822 cut-off events. [2023-08-29 20:19:49,587 INFO L131 PetriNetUnfolder]: For 2989/3041 co-relation queries the response was YES. [2023-08-29 20:19:49,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9006 conditions, 2822 events. 1650/2822 cut-off events. For 2989/3041 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16589 event pairs, 655 based on Foata normal form. 80/2834 useless extension candidates. Maximal degree in co-relation 8995. Up to 1410 conditions per place. [2023-08-29 20:19:49,602 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 44 selfloop transitions, 5 changer transitions 17/70 dead transitions. [2023-08-29 20:19:49,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 454 flow [2023-08-29 20:19:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-08-29 20:19:49,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826086956521739 [2023-08-29 20:19:49,605 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-08-29 20:19:49,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-08-29 20:19:49,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:49,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-08-29 20:19:49,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:19:49,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:49,609 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:49,609 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 179 flow. Second operand 5 states and 555 transitions. [2023-08-29 20:19:49,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 454 flow [2023-08-29 20:19:49,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 447 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 20:19:49,612 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 196 flow [2023-08-29 20:19:49,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-08-29 20:19:49,615 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-29 20:19:49,615 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 196 flow [2023-08-29 20:19:49,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:49,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:49,616 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:19:49,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:19:49,616 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:49,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1591086828, now seen corresponding path program 1 times [2023-08-29 20:19:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768160733] [2023-08-29 20:19:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:49,827 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:19:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768160733] [2023-08-29 20:19:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768160733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311559002] [2023-08-29 20:19:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:49,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:49,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 230 [2023-08-29 20:19:49,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:19:49,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:49,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 230 [2023-08-29 20:19:49,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:50,405 INFO L130 PetriNetUnfolder]: 2359/4070 cut-off events. [2023-08-29 20:19:50,406 INFO L131 PetriNetUnfolder]: For 5769/5928 co-relation queries the response was YES. [2023-08-29 20:19:50,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13200 conditions, 4070 events. 2359/4070 cut-off events. For 5769/5928 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26226 event pairs, 482 based on Foata normal form. 98/4146 useless extension candidates. Maximal degree in co-relation 13186. Up to 1904 conditions per place. [2023-08-29 20:19:50,424 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 49 selfloop transitions, 3 changer transitions 18/75 dead transitions. [2023-08-29 20:19:50,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 513 flow [2023-08-29 20:19:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-29 20:19:50,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747826086956522 [2023-08-29 20:19:50,427 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-29 20:19:50,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-29 20:19:50,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:50,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-29 20:19:50,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:19:50,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:50,432 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:50,432 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 196 flow. Second operand 5 states and 546 transitions. [2023-08-29 20:19:50,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 513 flow [2023-08-29 20:19:50,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 493 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-29 20:19:50,448 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 212 flow [2023-08-29 20:19:50,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-29 20:19:50,449 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-08-29 20:19:50,449 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 212 flow [2023-08-29 20:19:50,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states 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:19:50,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:50,450 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:19:50,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:19:50,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:50,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1519137886, now seen corresponding path program 2 times [2023-08-29 20:19:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:50,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747893410] [2023-08-29 20:19:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:50,781 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:19:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:50,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747893410] [2023-08-29 20:19:50,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747893410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:50,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:50,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:50,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875478418] [2023-08-29 20:19:50,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:50,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:50,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:50,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:50,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:50,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 230 [2023-08-29 20:19:50,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:19:50,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:50,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 230 [2023-08-29 20:19:50,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:51,150 INFO L130 PetriNetUnfolder]: 1556/2832 cut-off events. [2023-08-29 20:19:51,151 INFO L131 PetriNetUnfolder]: For 2760/2852 co-relation queries the response was YES. [2023-08-29 20:19:51,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 2832 events. 1556/2832 cut-off events. For 2760/2852 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 18727 event pairs, 434 based on Foata normal form. 260/3048 useless extension candidates. Maximal degree in co-relation 8686. Up to 1133 conditions per place. [2023-08-29 20:19:51,165 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 57 selfloop transitions, 8 changer transitions 5/78 dead transitions. [2023-08-29 20:19:51,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 515 flow [2023-08-29 20:19:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2023-08-29 20:19:51,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49130434782608695 [2023-08-29 20:19:51,168 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2023-08-29 20:19:51,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2023-08-29 20:19:51,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:51,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2023-08-29 20:19:51,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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:19:51,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:51,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states 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:19:51,172 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 212 flow. Second operand 5 states and 565 transitions. [2023-08-29 20:19:51,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 515 flow [2023-08-29 20:19:51,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 509 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:51,179 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 247 flow [2023-08-29 20:19:51,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-29 20:19:51,179 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2023-08-29 20:19:51,180 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 247 flow [2023-08-29 20:19:51,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:19:51,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:51,180 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:19:51,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:19:51,181 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:51,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1534604598, now seen corresponding path program 1 times [2023-08-29 20:19:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:51,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994782464] [2023-08-29 20:19:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:51,547 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:19:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:51,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994782464] [2023-08-29 20:19:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994782464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:51,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:51,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:51,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656598196] [2023-08-29 20:19:51,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:51,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:51,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:51,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:51,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 230 [2023-08-29 20:19:51,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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:19:51,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:51,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 230 [2023-08-29 20:19:51,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:51,905 INFO L130 PetriNetUnfolder]: 1439/2612 cut-off events. [2023-08-29 20:19:51,905 INFO L131 PetriNetUnfolder]: For 4930/5015 co-relation queries the response was YES. [2023-08-29 20:19:51,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 2612 events. 1439/2612 cut-off events. For 4930/5015 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17140 event pairs, 424 based on Foata normal form. 98/2666 useless extension candidates. Maximal degree in co-relation 9252. Up to 1112 conditions per place. [2023-08-29 20:19:51,920 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 32 selfloop transitions, 11 changer transitions 18/64 dead transitions. [2023-08-29 20:19:51,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 456 flow [2023-08-29 20:19:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-08-29 20:19:51,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47608695652173916 [2023-08-29 20:19:51,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-08-29 20:19:51,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-08-29 20:19:51,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:51,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-08-29 20:19:51,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:19:51,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:19:51,928 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states 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:19:51,928 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 247 flow. Second operand 6 states and 657 transitions. [2023-08-29 20:19:51,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 456 flow [2023-08-29 20:19:51,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 430 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:51,935 INFO L231 Difference]: Finished difference. Result has 58 places, 29 transitions, 193 flow [2023-08-29 20:19:51,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=58, PETRI_TRANSITIONS=29} [2023-08-29 20:19:51,936 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-08-29 20:19:51,936 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 29 transitions, 193 flow [2023-08-29 20:19:51,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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:19:51,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:51,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:51,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:19:51,937 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:51,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:51,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2014621755, now seen corresponding path program 1 times [2023-08-29 20:19:51,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:51,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923361505] [2023-08-29 20:19:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:52,594 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:19:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923361505] [2023-08-29 20:19:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923361505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:52,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:52,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:19:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783495327] [2023-08-29 20:19:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:19:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:19:52,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:19:52,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-08-29 20:19:52,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 29 transitions, 193 flow. Second operand has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:52,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:52,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-08-29 20:19:52,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:52,818 INFO L130 PetriNetUnfolder]: 126/268 cut-off events. [2023-08-29 20:19:52,819 INFO L131 PetriNetUnfolder]: For 684/698 co-relation queries the response was YES. [2023-08-29 20:19:52,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 268 events. 126/268 cut-off events. For 684/698 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1013 event pairs, 7 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 1014. Up to 145 conditions per place. [2023-08-29 20:19:52,820 INFO L137 encePairwiseOnDemand]: 223/230 looper letters, 32 selfloop transitions, 4 changer transitions 22/61 dead transitions. [2023-08-29 20:19:52,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 517 flow [2023-08-29 20:19:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:19:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:19:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 821 transitions. [2023-08-29 20:19:52,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44619565217391305 [2023-08-29 20:19:52,823 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 821 transitions. [2023-08-29 20:19:52,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 821 transitions. [2023-08-29 20:19:52,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:52,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 821 transitions. [2023-08-29 20:19:52,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.625) internal successors, (821), 8 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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:19:52,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 230.0) internal successors, (2070), 9 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states 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:19:52,828 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 230.0) internal successors, (2070), 9 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states 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:19:52,829 INFO L175 Difference]: Start difference. First operand has 58 places, 29 transitions, 193 flow. Second operand 8 states and 821 transitions. [2023-08-29 20:19:52,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 517 flow [2023-08-29 20:19:52,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 313 flow, removed 37 selfloop flow, removed 18 redundant places. [2023-08-29 20:19:52,832 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 111 flow [2023-08-29 20:19:52,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2023-08-29 20:19:52,832 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-29 20:19:52,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 111 flow [2023-08-29 20:19:52,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:52,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:52,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:19:52,834 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:52,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 460320277, now seen corresponding path program 2 times [2023-08-29 20:19:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160994503] [2023-08-29 20:19:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:52,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:19:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:52,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:19:52,933 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:19:52,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:19:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:19:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:19:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:19:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:19:52,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:19:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:19:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:19:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:19:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:19:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:19:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:19:52,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:19:52,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:19:52,938 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:52,943 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:19:52,943 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:19:52,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:19:52 BasicIcfg [2023-08-29 20:19:53,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:19:53,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:19:53,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:19:53,002 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:19:53,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:39" (3/4) ... [2023-08-29 20:19:53,005 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:19:53,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:19:53,006 INFO L158 Benchmark]: Toolchain (without parser) took 14879.53ms. Allocated memory was 88.1MB in the beginning and 763.4MB in the end (delta: 675.3MB). Free memory was 63.4MB in the beginning and 561.2MB in the end (delta: -497.7MB). Peak memory consumption was 180.0MB. Max. memory is 16.1GB. [2023-08-29 20:19:53,006 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 38.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:53,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.13ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 40.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:53,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.82ms. Allocated memory is still 88.1MB. Free memory was 40.0MB in the beginning and 66.6MB in the end (delta: -26.6MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-08-29 20:19:53,007 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 64.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:53,007 INFO L158 Benchmark]: RCFGBuilder took 672.93ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 58.6MB in the end (delta: 5.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-08-29 20:19:53,008 INFO L158 Benchmark]: TraceAbstraction took 13533.16ms. Allocated memory was 88.1MB in the beginning and 763.4MB in the end (delta: 675.3MB). Free memory was 58.1MB in the beginning and 561.2MB in the end (delta: -503.1MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. [2023-08-29 20:19:53,008 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 763.4MB. Free memory is still 561.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:53,009 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.18ms. Allocated memory is still 60.8MB. Free memory is still 38.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 546.13ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 40.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.82ms. Allocated memory is still 88.1MB. Free memory was 40.0MB in the beginning and 66.6MB in the end (delta: -26.6MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 64.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 672.93ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 58.6MB in the end (delta: 5.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13533.16ms. Allocated memory was 88.1MB in the beginning and 763.4MB in the end (delta: 675.3MB). Free memory was 58.1MB in the beginning and 561.2MB in the end (delta: -503.1MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 763.4MB. Free memory is still 561.2MB. 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.0s, 125 PlacesBefore, 43 PlacesAfterwards, 117 TransitionsBefore, 34 TransitionsAfterwards, 2238 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 6029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2776, independent: 2600, independent conditional: 0, independent unconditional: 2600, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1209, independent: 1175, independent conditional: 0, independent unconditional: 1175, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2776, independent: 1425, independent conditional: 0, independent unconditional: 1425, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1209, unknown conditional: 0, unknown unconditional: 1209] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=-2, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=-1, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t499, ((void *)0), P2, ((void *)0))=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 13 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: 13.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 47 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:19:53,041 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/mix019_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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --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:19:55,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:19:55,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:19:55,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:19:55,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:19:55,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:19:55,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:19:55,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:19:55,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:19:55,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:19:55,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:19:55,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:19:55,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:19:55,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:19:55,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:19:55,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:19:55,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:19:55,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:19:55,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:19:55,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:19:55,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:19:55,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:19:55,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:19:55,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:19:55,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:19:55,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:19:55,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:19:55,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:19:55,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:19:55,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:19:55,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:19:55,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:19:55,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:19:55,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:19:55,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:19:55,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:19:55,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:19:55,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:19:55,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:19:55,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:19:55,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:19:55,132 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:19:55,151 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:19:55,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:19:55,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:19:55,152 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:19:55,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:19:55,153 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:19:55,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:19:55,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:19:55,154 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:19:55,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:19:55,154 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:19:55,154 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:19:55,155 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:19:55,156 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:19:55,156 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:19:55,156 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:19:55,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:19:55,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:19:55,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:19:55,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:55,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:19:55,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:19:55,157 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:19:55,157 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:19:55,157 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:19:55,157 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:19:55,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:19:55,158 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:19:55,158 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:19:55,158 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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 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:19:55,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:19:55,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:19:55,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:19:55,498 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:19:55,499 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:19:55,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:19:56,767 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:19:57,000 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:19:57,001 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:19:57,013 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6503e1b/1337b87ac1c84db3a228b845bfd71532/FLAG54b88d1f7 [2023-08-29 20:19:57,024 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6503e1b/1337b87ac1c84db3a228b845bfd71532 [2023-08-29 20:19:57,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:19:57,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:19:57,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:57,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:19:57,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:19:57,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39faabbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57, skipping insertion in model container [2023-08-29 20:19:57,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:19:57,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:19:57,223 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:19:57,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:57,459 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:19:57,474 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:19:57,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:57,578 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:57,578 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:57,584 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:19:57,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57 WrapperNode [2023-08-29 20:19:57,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:57,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:57,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:19:57,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:19:57,592 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:19:57" (1/1) ... [2023-08-29 20:19:57,617 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:19:57" (1/1) ... [2023-08-29 20:19:57,637 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-08-29 20:19:57,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:57,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:19:57,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:19:57,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:19:57,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,667 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:19:57,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:19:57,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:19:57,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:19:57,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (1/1) ... [2023-08-29 20:19:57,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:19:57,708 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:19:57,732 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:19:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:19:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:19:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:19:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:19:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:19:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:19:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:19:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:19:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:19:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:19:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:19:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:19:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:19:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:19:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:19:57,751 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:19:57,884 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:19:57,886 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:19:58,321 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:19:58,476 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:19:58,476 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:19:58,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:58 BoogieIcfgContainer [2023-08-29 20:19:58,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:19:58,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:19:58,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:19:58,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:19:58,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:19:57" (1/3) ... [2023-08-29 20:19:58,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdafa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:58, skipping insertion in model container [2023-08-29 20:19:58,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:57" (2/3) ... [2023-08-29 20:19:58,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdafa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:58, skipping insertion in model container [2023-08-29 20:19:58,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:58" (3/3) ... [2023-08-29 20:19:58,487 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:19:58,502 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:19:58,503 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:19:58,503 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:19:58,570 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:19:58,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2023-08-29 20:19:58,673 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-29 20:19:58,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:58,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-29 20:19:58,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2023-08-29 20:19:58,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2023-08-29 20:19:58,687 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:19:58,705 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-29 20:19:58,707 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-29 20:19:58,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2023-08-29 20:19:58,750 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-29 20:19:58,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:58,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-29 20:19:58,754 INFO L119 LiptonReduction]: Number of co-enabled transitions 2238 [2023-08-29 20:20:04,288 INFO L134 LiptonReduction]: Checked pairs total: 6686 [2023-08-29 20:20:04,288 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-29 20:20:04,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:20:04,305 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;@5cd7406, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:20:04,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:20:04,307 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:20:04,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:04,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:04,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:20:04,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:04,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash 521, now seen corresponding path program 1 times [2023-08-29 20:20:04,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:04,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296854132] [2023-08-29 20:20:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:04,323 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:20:04,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:04,331 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:20:04,360 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:20:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:04,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:20:04,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:04,403 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:04,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:04,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296854132] [2023-08-29 20:20:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296854132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:04,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:04,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:20:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132751748] [2023-08-29 20:20:04,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:04,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:20:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:04,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:20:04,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:20:04,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 232 [2023-08-29 20:20:04,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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:04,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:04,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 232 [2023-08-29 20:20:04,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:04,952 INFO L130 PetriNetUnfolder]: 1851/2722 cut-off events. [2023-08-29 20:20:04,952 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-29 20:20:04,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5481 conditions, 2722 events. 1851/2722 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13263 event pairs, 1851 based on Foata normal form. 100/2311 useless extension candidates. Maximal degree in co-relation 5470. Up to 2703 conditions per place. [2023-08-29 20:20:04,972 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-29 20:20:04,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 111 flow [2023-08-29 20:20:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:20:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:20:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 247 transitions. [2023-08-29 20:20:04,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5323275862068966 [2023-08-29 20:20:04,997 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 247 transitions. [2023-08-29 20:20:04,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 247 transitions. [2023-08-29 20:20:04,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:05,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 247 transitions. [2023-08-29 20:20:05,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:05,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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:05,012 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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:05,014 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 2 states and 247 transitions. [2023-08-29 20:20:05,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 111 flow [2023-08-29 20:20:05,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:05,022 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-08-29 20:20:05,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-29 20:20:05,027 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -8 predicate places. [2023-08-29 20:20:05,028 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-08-29 20:20:05,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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:05,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:05,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:20:05,046 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:20:05,240 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:20:05,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:05,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash 514711, now seen corresponding path program 1 times [2023-08-29 20:20:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286291984] [2023-08-29 20:20:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:05,242 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:20:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:05,243 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:20:05,245 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:20:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:05,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:20:05,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:05,365 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:05,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:05,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286291984] [2023-08-29 20:20:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286291984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:05,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:05,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:20:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286922935] [2023-08-29 20:20:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:05,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:20:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:20:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:20:05,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 232 [2023-08-29 20:20:05,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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:05,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:05,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 232 [2023-08-29 20:20:05,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:05,751 INFO L130 PetriNetUnfolder]: 1447/2302 cut-off events. [2023-08-29 20:20:05,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:05,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4475 conditions, 2302 events. 1447/2302 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13045 event pairs, 235 based on Foata normal form. 0/2054 useless extension candidates. Maximal degree in co-relation 4472. Up to 1723 conditions per place. [2023-08-29 20:20:05,761 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 35 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-29 20:20:05,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 180 flow [2023-08-29 20:20:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:20:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:20:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-29 20:20:05,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521551724137931 [2023-08-29 20:20:05,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-29 20:20:05,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-29 20:20:05,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:05,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-29 20:20:05,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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:05,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:05,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states 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:05,774 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 363 transitions. [2023-08-29 20:20:05,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 180 flow [2023-08-29 20:20:05,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:20:05,775 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 58 flow [2023-08-29 20:20:05,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-29 20:20:05,777 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2023-08-29 20:20:05,777 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 58 flow [2023-08-29 20:20:05,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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:05,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:05,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:05,793 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:20:05,986 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:20:05,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:05,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash -396772626, now seen corresponding path program 1 times [2023-08-29 20:20:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:05,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144422264] [2023-08-29 20:20:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:05,993 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:20:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:05,994 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:20:05,997 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:20:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:06,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:20:06,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:06,121 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:06,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:06,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144422264] [2023-08-29 20:20:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144422264] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211045968] [2023-08-29 20:20:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:06,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:20:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:20:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:20:06,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-08-29 20:20:06,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:06,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:06,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-08-29 20:20:06,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:06,441 INFO L130 PetriNetUnfolder]: 679/1114 cut-off events. [2023-08-29 20:20:06,442 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2023-08-29 20:20:06,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 1114 events. 679/1114 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5318 event pairs, 130 based on Foata normal form. 80/1145 useless extension candidates. Maximal degree in co-relation 2347. Up to 752 conditions per place. [2023-08-29 20:20:06,447 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 31 selfloop transitions, 4 changer transitions 21/59 dead transitions. [2023-08-29 20:20:06,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 250 flow [2023-08-29 20:20:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:20:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:20:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2023-08-29 20:20:06,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810344827586207 [2023-08-29 20:20:06,450 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2023-08-29 20:20:06,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2023-08-29 20:20:06,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:06,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2023-08-29 20:20:06,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:06,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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:06,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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:06,455 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 58 flow. Second operand 5 states and 558 transitions. [2023-08-29 20:20:06,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 250 flow [2023-08-29 20:20:06,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:20:06,457 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow [2023-08-29 20:20:06,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-29 20:20:06,458 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2023-08-29 20:20:06,458 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 90 flow [2023-08-29 20:20:06,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:06,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:06,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:06,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:20:06,672 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:20:06,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:06,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash -553774961, now seen corresponding path program 1 times [2023-08-29 20:20:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024252035] [2023-08-29 20:20:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:06,674 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:20:06,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:06,675 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:20:06,711 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:20:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:06,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:20:06,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:20:06,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:06,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024252035] [2023-08-29 20:20:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024252035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:06,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:06,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219278946] [2023-08-29 20:20:06,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:06,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:06,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:06,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-08-29 20:20:06,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 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:20:06,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:06,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-08-29 20:20:06,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:07,108 INFO L130 PetriNetUnfolder]: 274/507 cut-off events. [2023-08-29 20:20:07,108 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2023-08-29 20:20:07,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 507 events. 274/507 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2206 event pairs, 73 based on Foata normal form. 44/535 useless extension candidates. Maximal degree in co-relation 1334. Up to 157 conditions per place. [2023-08-29 20:20:07,111 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 40 selfloop transitions, 7 changer transitions 21/71 dead transitions. [2023-08-29 20:20:07,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 358 flow [2023-08-29 20:20:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions. [2023-08-29 20:20:07,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4813218390804598 [2023-08-29 20:20:07,114 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 670 transitions. [2023-08-29 20:20:07,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions. [2023-08-29 20:20:07,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:07,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions. [2023-08-29 20:20:07,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:07,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:07,119 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:07,119 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 90 flow. Second operand 6 states and 670 transitions. [2023-08-29 20:20:07,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 358 flow [2023-08-29 20:20:07,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 352 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:20:07,122 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 140 flow [2023-08-29 20:20:07,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-29 20:20:07,123 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-29 20:20:07,123 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 140 flow [2023-08-29 20:20:07,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 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:20:07,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:07,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:07,136 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:20:07,333 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:20:07,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:07,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -469777302, now seen corresponding path program 1 times [2023-08-29 20:20:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574884147] [2023-08-29 20:20:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:07,335 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:20:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:07,336 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:20:07,339 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:20:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:07,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:20:07,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:07,471 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:07,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:07,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:07,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574884147] [2023-08-29 20:20:07,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574884147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:07,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:07,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:20:07,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860996576] [2023-08-29 20:20:07,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:07,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:20:07,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:20:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:20:07,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-08-29 20:20:07,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:07,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:07,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-08-29 20:20:07,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:07,736 INFO L130 PetriNetUnfolder]: 168/318 cut-off events. [2023-08-29 20:20:07,736 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-08-29 20:20:07,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 318 events. 168/318 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1274 event pairs, 68 based on Foata normal form. 11/323 useless extension candidates. Maximal degree in co-relation 906. Up to 129 conditions per place. [2023-08-29 20:20:07,738 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 37 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2023-08-29 20:20:07,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 352 flow [2023-08-29 20:20:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions. [2023-08-29 20:20:07,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46798029556650245 [2023-08-29 20:20:07,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 760 transitions. [2023-08-29 20:20:07,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 760 transitions. [2023-08-29 20:20:07,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:07,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 760 transitions. [2023-08-29 20:20:07,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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:07,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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:07,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states 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:07,746 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 140 flow. Second operand 7 states and 760 transitions. [2023-08-29 20:20:07,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 352 flow [2023-08-29 20:20:07,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 316 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:20:07,750 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 142 flow [2023-08-29 20:20:07,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-08-29 20:20:07,751 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-08-29 20:20:07,751 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 142 flow [2023-08-29 20:20:07,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:07,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:07,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:07,761 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:20:07,960 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:20:07,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:07,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1248838022, now seen corresponding path program 1 times [2023-08-29 20:20:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084928531] [2023-08-29 20:20:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:07,962 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:20:07,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:07,963 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:20:07,964 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:20:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:08,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:20:08,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:08,332 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:08,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:08,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084928531] [2023-08-29 20:20:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084928531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:08,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:08,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:20:08,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111689236] [2023-08-29 20:20:08,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:08,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:20:08,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:08,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:20:08,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:20:08,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-29 20:20:08,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 103.5) internal successors, (828), 8 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:08,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:08,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-29 20:20:08,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:08,699 INFO L130 PetriNetUnfolder]: 181/369 cut-off events. [2023-08-29 20:20:08,699 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2023-08-29 20:20:08,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 369 events. 181/369 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1633 event pairs, 17 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 1036. Up to 147 conditions per place. [2023-08-29 20:20:08,702 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 62 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2023-08-29 20:20:08,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 488 flow [2023-08-29 20:20:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:20:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:20:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 862 transitions. [2023-08-29 20:20:08,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644396551724138 [2023-08-29 20:20:08,705 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 862 transitions. [2023-08-29 20:20:08,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 862 transitions. [2023-08-29 20:20:08,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:08,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 862 transitions. [2023-08-29 20:20:08,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states 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:08,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:08,710 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:08,710 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 142 flow. Second operand 8 states and 862 transitions. [2023-08-29 20:20:08,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 488 flow [2023-08-29 20:20:08,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 402 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-29 20:20:08,713 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 136 flow [2023-08-29 20:20:08,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-29 20:20:08,714 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-08-29 20:20:08,714 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 136 flow [2023-08-29 20:20:08,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.5) internal successors, (828), 8 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:08,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:08,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:08,731 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:20:08,932 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:20:08,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:08,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1684656378, now seen corresponding path program 2 times [2023-08-29 20:20:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567354198] [2023-08-29 20:20:08,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:20:08,933 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:20:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:08,934 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:20:08,976 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:20:09,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:20:09,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:20:09,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:20:09,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:09,068 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:09,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:09,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567354198] [2023-08-29 20:20:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567354198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:09,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:09,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813356677] [2023-08-29 20:20:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:09,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:20:09,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:09,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:20:09,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:20:09,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-08-29 20:20:09,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 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:20:09,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:09,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-08-29 20:20:09,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:09,251 INFO L130 PetriNetUnfolder]: 318/613 cut-off events. [2023-08-29 20:20:09,251 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2023-08-29 20:20:09,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 613 events. 318/613 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2997 event pairs, 121 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 1779. Up to 334 conditions per place. [2023-08-29 20:20:09,255 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 53 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-08-29 20:20:09,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 362 flow [2023-08-29 20:20:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:20:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:20:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-29 20:20:09,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2023-08-29 20:20:09,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-29 20:20:09,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-29 20:20:09,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:09,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-29 20:20:09,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:09,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:09,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states 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:09,261 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 136 flow. Second operand 4 states and 456 transitions. [2023-08-29 20:20:09,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 362 flow [2023-08-29 20:20:09,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:09,265 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 164 flow [2023-08-29 20:20:09,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-29 20:20:09,266 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-29 20:20:09,266 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 164 flow [2023-08-29 20:20:09,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 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:20:09,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:09,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:09,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:20:09,476 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:20:09,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:09,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash -945117186, now seen corresponding path program 1 times [2023-08-29 20:20:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419657361] [2023-08-29 20:20:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:09,478 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:20:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:09,479 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:20:09,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:20:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:09,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:20:09,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:09,975 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:09,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:09,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419657361] [2023-08-29 20:20:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419657361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:09,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:09,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:09,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919980053] [2023-08-29 20:20:09,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:09,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:10,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-29 20:20:10,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:10,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:10,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-29 20:20:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:10,433 INFO L130 PetriNetUnfolder]: 278/542 cut-off events. [2023-08-29 20:20:10,433 INFO L131 PetriNetUnfolder]: For 424/424 co-relation queries the response was YES. [2023-08-29 20:20:10,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 542 events. 278/542 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2542 event pairs, 103 based on Foata normal form. 4/546 useless extension candidates. Maximal degree in co-relation 1642. Up to 464 conditions per place. [2023-08-29 20:20:10,436 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 28 selfloop transitions, 3 changer transitions 13/47 dead transitions. [2023-08-29 20:20:10,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 303 flow [2023-08-29 20:20:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:20:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:20:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2023-08-29 20:20:10,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4224137931034483 [2023-08-29 20:20:10,438 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 490 transitions. [2023-08-29 20:20:10,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 490 transitions. [2023-08-29 20:20:10,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:10,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 490 transitions. [2023-08-29 20:20:10,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:10,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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:10,442 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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:10,442 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 164 flow. Second operand 5 states and 490 transitions. [2023-08-29 20:20:10,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 303 flow [2023-08-29 20:20:10,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:20:10,446 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 126 flow [2023-08-29 20:20:10,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2023-08-29 20:20:10,446 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-08-29 20:20:10,446 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 126 flow [2023-08-29 20:20:10,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:10,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:10,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:10,457 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:20:10,657 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:20:10,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:20:10,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1960848066, now seen corresponding path program 3 times [2023-08-29 20:20:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252850165] [2023-08-29 20:20:10,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:20:10,659 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:20:10,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:10,659 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:20:10,661 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:20:10,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:20:10,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:20:10,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:20:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:20:10,896 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:20:10,896 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:20:10,897 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:20:10,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:20:10,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:20:10,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:20:10,912 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:20:11,109 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:20:11,110 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:11,114 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:20:11,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:20:11,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:20:11 BasicIcfg [2023-08-29 20:20:11,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:20:11,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:20:11,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:20:11,182 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:20:11,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:58" (3/4) ... [2023-08-29 20:20:11,185 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:20:11,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:20:11,186 INFO L158 Benchmark]: Toolchain (without parser) took 14158.11ms. Allocated memory was 60.8MB in the beginning and 239.1MB in the end (delta: 178.3MB). Free memory was 38.3MB in the beginning and 124.0MB in the end (delta: -85.6MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2023-08-29 20:20:11,186 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:20:11,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.19ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 38.1MB in the beginning and 46.0MB in the end (delta: -7.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-08-29 20:20:11,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.60ms. Allocated memory is still 77.6MB. Free memory was 46.0MB in the beginning and 43.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:20:11,187 INFO L158 Benchmark]: Boogie Preprocessor took 32.89ms. Allocated memory is still 77.6MB. Free memory was 43.4MB in the beginning and 41.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:20:11,188 INFO L158 Benchmark]: RCFGBuilder took 806.53ms. Allocated memory is still 77.6MB. Free memory was 41.3MB in the beginning and 42.8MB in the end (delta: -1.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-29 20:20:11,189 INFO L158 Benchmark]: TraceAbstraction took 12699.47ms. Allocated memory was 77.6MB in the beginning and 239.1MB in the end (delta: 161.5MB). Free memory was 42.3MB in the beginning and 124.0MB in the end (delta: -81.6MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2023-08-29 20:20:11,189 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 239.1MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:20:11,191 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.20ms. Allocated memory is still 60.8MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.19ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 38.1MB in the beginning and 46.0MB in the end (delta: -7.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.60ms. Allocated memory is still 77.6MB. Free memory was 46.0MB in the beginning and 43.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.89ms. Allocated memory is still 77.6MB. Free memory was 43.4MB in the beginning and 41.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 806.53ms. Allocated memory is still 77.6MB. Free memory was 41.3MB in the beginning and 42.8MB in the end (delta: -1.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12699.47ms. Allocated memory was 77.6MB in the beginning and 239.1MB in the end (delta: 161.5MB). Free memory was 42.3MB in the beginning and 124.0MB in the end (delta: -81.6MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 239.1MB. Free memory is still 124.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: 5.6s, 126 PlacesBefore, 43 PlacesAfterwards, 118 TransitionsBefore, 34 TransitionsAfterwards, 2238 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 6686 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2759, independent: 2553, independent conditional: 0, independent unconditional: 2553, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1201, independent: 1170, independent conditional: 0, independent unconditional: 1170, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2759, independent: 1383, independent conditional: 0, independent unconditional: 1383, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 1201, unknown conditional: 0, unknown unconditional: 1201] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=0, t497={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=1, t497={3:0}, t498={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t499, ((void *)0), P2, ((void *)0))=2, t497={3:0}, t498={7:0}, t499={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={3:0}, t498={7:0}, t499={11:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 841]: 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 13 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: 12.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1199 IncrementalHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 37 mSDtfsCounter, 1199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=7, InterpolantAutomatonStates: 40, 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.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 14 QuantifiedInterpolants, 1074 SizeOfPredicates, 13 NumberOfNonLiveVariables, 947 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:20:11,216 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