./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:04:57,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:04:57,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:04:57,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:04:57,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:04:57,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:04:57,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:04:57,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:04:57,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:04:57,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:04:57,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:04:57,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:04:57,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:04:57,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:04:57,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:04:57,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:04:57,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:04:57,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:04:57,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:04:57,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:04:57,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:04:57,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:04:57,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:04:57,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:04:57,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:04:57,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:04:57,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:04:57,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:04:57,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:04:57,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:04:57,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:04:57,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:04:57,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:04:57,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:04:57,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:04:57,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:04:57,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:04:57,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:04:57,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:04:57,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:04:57,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:04:57,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:04:57,841 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:04:57,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:04:57,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:04:57,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:04:57,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:04:57,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:04:57,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:04:57,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:04:57,844 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:04:57,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:04:57,845 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:04:57,845 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:04:57,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:04:57,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:04:57,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:04:57,846 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:04:57,846 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:04:57,846 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:04:57,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:04:57,847 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:04:57,847 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:04:57,847 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:04:57,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:04:57,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:04:57,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:04:57,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:04:57,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:04:57,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:04:57,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:04:57,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:04:57,849 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:04:57,849 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:04:57,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:04:57,850 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:04:57,850 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:04:58,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:04:58,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:04:58,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:04:58,179 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:04:58,179 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:04:58,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-30 03:04:59,298 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:04:59,516 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:04:59,516 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-30 03:04:59,540 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c734a4d4b/52a548307dd940fe985c47f32e4b21f3/FLAG23a744126 [2023-08-30 03:04:59,552 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c734a4d4b/52a548307dd940fe985c47f32e4b21f3 [2023-08-30 03:04:59,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:04:59,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:04:59,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:04:59,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:04:59,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:04:59,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:04:59" (1/1) ... [2023-08-30 03:04:59,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661a9aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:04:59, skipping insertion in model container [2023-08-30 03:04:59,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:04:59" (1/1) ... [2023-08-30 03:04:59,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:04:59,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:04:59,730 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 03:04:59,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:04:59,941 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:04:59,952 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 03:04:59,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:05:00,025 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:05:00,025 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:05:00,031 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:05:00,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00 WrapperNode [2023-08-30 03:05:00,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:05:00,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:05:00,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:05:00,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:05:00,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,102 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 03:05:00,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:05:00,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:05:00,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:05:00,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:05:00,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,158 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:05:00,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:05:00,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:05:00,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:05:00,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (1/1) ... [2023-08-30 03:05:00,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:05:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:05:00,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:05:00,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:05:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:05:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:05:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:05:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:05:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:05:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:05:00,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:05:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:05:00,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:05:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:05:00,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:05:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:05:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:05:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:05:00,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:05:00,234 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:05:00,418 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:05:00,420 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:05:00,766 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:05:00,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:05:00,899 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:05:00,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:00 BoogieIcfgContainer [2023-08-30 03:05:00,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:05:00,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:05:00,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:05:00,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:05:00,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:04:59" (1/3) ... [2023-08-30 03:05:00,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f904e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:05:00, skipping insertion in model container [2023-08-30 03:05:00,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:00" (2/3) ... [2023-08-30 03:05:00,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f904e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:05:00, skipping insertion in model container [2023-08-30 03:05:00,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:00" (3/3) ... [2023-08-30 03:05:00,909 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2023-08-30 03:05:00,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:05:00,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 03:05:00,924 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:05:00,990 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:05:01,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-08-30 03:05:01,058 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-30 03:05:01,059 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:01,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:05:01,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-08-30 03:05:01,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-08-30 03:05:01,071 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:05:01,083 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-30 03:05:01,090 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-30 03:05:01,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-08-30 03:05:01,132 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-30 03:05:01,133 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:01,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:05:01,136 INFO L119 LiptonReduction]: Number of co-enabled transitions 2126 [2023-08-30 03:05:06,400 INFO L134 LiptonReduction]: Checked pairs total: 5516 [2023-08-30 03:05:06,400 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-30 03:05:06,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:05:06,418 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;@4641d92a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:05:06,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 03:05:06,419 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:05:06,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:06,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:06,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:05:06,420 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:06,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 515, now seen corresponding path program 1 times [2023-08-30 03:05:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:06,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620248081] [2023-08-30 03:05:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:06,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620248081] [2023-08-30 03:05:06,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620248081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:06,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:05:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097861053] [2023-08-30 03:05:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:06,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:05:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:05:06,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:05:06,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 231 [2023-08-30 03:05:06,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:06,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:06,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 231 [2023-08-30 03:05:06,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:07,028 INFO L130 PetriNetUnfolder]: 1093/1645 cut-off events. [2023-08-30 03:05:07,028 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 03:05:07,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 1645 events. 1093/1645 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7734 event pairs, 1093 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 3311. Up to 1623 conditions per place. [2023-08-30 03:05:07,044 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-30 03:05:07,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-08-30 03:05:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:05:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:05:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 235 transitions. [2023-08-30 03:05:07,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5086580086580087 [2023-08-30 03:05:07,060 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 235 transitions. [2023-08-30 03:05:07,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 235 transitions. [2023-08-30 03:05:07,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:07,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 235 transitions. [2023-08-30 03:05:07,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,069 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,071 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 235 transitions. [2023-08-30 03:05:07,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-08-30 03:05:07,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:05:07,074 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-30 03:05:07,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-30 03:05:07,079 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-30 03:05:07,079 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-30 03:05:07,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:07,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:05:07,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:05:07,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:07,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash 486112658, now seen corresponding path program 1 times [2023-08-30 03:05:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469416445] [2023-08-30 03:05:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:07,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:07,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469416445] [2023-08-30 03:05:07,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469416445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:05:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159212534] [2023-08-30 03:05:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:07,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:05:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:05:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:05:07,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 231 [2023-08-30 03:05:07,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:07,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 231 [2023-08-30 03:05:07,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:07,595 INFO L130 PetriNetUnfolder]: 855/1341 cut-off events. [2023-08-30 03:05:07,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:07,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1341 events. 855/1341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6374 event pairs, 237 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 2663. Up to 1027 conditions per place. [2023-08-30 03:05:07,602 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-30 03:05:07,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 146 flow [2023-08-30 03:05:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:05:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:05:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-30 03:05:07,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2023-08-30 03:05:07,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-30 03:05:07,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-30 03:05:07,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:07,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-30 03:05:07,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,610 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 343 transitions. [2023-08-30 03:05:07,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 146 flow [2023-08-30 03:05:07,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:05:07,611 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-30 03:05:07,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 03:05:07,612 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-30 03:05:07,612 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-30 03:05:07,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:07,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:07,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:07,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:05:07,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:07,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash -458827342, now seen corresponding path program 1 times [2023-08-30 03:05:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937935509] [2023-08-30 03:05:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:08,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:08,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937935509] [2023-08-30 03:05:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937935509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:08,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:05:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901921916] [2023-08-30 03:05:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:08,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:05:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:05:08,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:05:08,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 231 [2023-08-30 03:05:08,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:08,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 231 [2023-08-30 03:05:08,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:08,229 INFO L130 PetriNetUnfolder]: 671/1087 cut-off events. [2023-08-30 03:05:08,230 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2023-08-30 03:05:08,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 1087 events. 671/1087 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5181 event pairs, 167 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 2230. Up to 777 conditions per place. [2023-08-30 03:05:08,235 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-30 03:05:08,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 130 flow [2023-08-30 03:05:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:05:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:05:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-30 03:05:08,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834054834054834 [2023-08-30 03:05:08,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-30 03:05:08,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-30 03:05:08,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:08,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-30 03:05:08,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,242 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 335 transitions. [2023-08-30 03:05:08,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 130 flow [2023-08-30 03:05:08,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:08,244 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 58 flow [2023-08-30 03:05:08,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 03:05:08,245 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-30 03:05:08,245 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 58 flow [2023-08-30 03:05:08,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:08,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:08,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:05:08,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:08,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash -458827328, now seen corresponding path program 1 times [2023-08-30 03:05:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:08,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726250568] [2023-08-30 03:05:08,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726250568] [2023-08-30 03:05:08,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726250568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:08,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882988175] [2023-08-30 03:05:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:08,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:05:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:05:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:05:08,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 231 [2023-08-30 03:05:08,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:08,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 231 [2023-08-30 03:05:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:08,948 INFO L130 PetriNetUnfolder]: 735/1116 cut-off events. [2023-08-30 03:05:08,949 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-30 03:05:08,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 1116 events. 735/1116 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4854 event pairs, 104 based on Foata normal form. 48/1164 useless extension candidates. Maximal degree in co-relation 2415. Up to 761 conditions per place. [2023-08-30 03:05:08,954 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 33 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-30 03:05:08,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 166 flow [2023-08-30 03:05:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2023-08-30 03:05:08,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42337662337662335 [2023-08-30 03:05:08,957 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2023-08-30 03:05:08,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2023-08-30 03:05:08,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:08,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2023-08-30 03:05:08,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,962 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,962 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 58 flow. Second operand 5 states and 489 transitions. [2023-08-30 03:05:08,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 166 flow [2023-08-30 03:05:08,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:08,964 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 68 flow [2023-08-30 03:05:08,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-30 03:05:08,965 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-30 03:05:08,965 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 68 flow [2023-08-30 03:05:08,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:08,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:08,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:08,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:05:08,966 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:08,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1400243649, now seen corresponding path program 1 times [2023-08-30 03:05:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68420735] [2023-08-30 03:05:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68420735] [2023-08-30 03:05:09,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68420735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:09,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:05:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540696469] [2023-08-30 03:05:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:09,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:05:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:09,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:05:09,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:05:09,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 231 [2023-08-30 03:05:09,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:09,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:09,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 231 [2023-08-30 03:05:09,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:09,908 INFO L130 PetriNetUnfolder]: 1205/1843 cut-off events. [2023-08-30 03:05:09,909 INFO L131 PetriNetUnfolder]: For 499/499 co-relation queries the response was YES. [2023-08-30 03:05:09,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4090 conditions, 1843 events. 1205/1843 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8502 event pairs, 776 based on Foata normal form. 120/1963 useless extension candidates. Maximal degree in co-relation 4084. Up to 1270 conditions per place. [2023-08-30 03:05:09,916 INFO L137 encePairwiseOnDemand]: 223/231 looper letters, 27 selfloop transitions, 8 changer transitions 19/55 dead transitions. [2023-08-30 03:05:09,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 255 flow [2023-08-30 03:05:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:05:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:05:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 646 transitions. [2023-08-30 03:05:09,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3995052566481138 [2023-08-30 03:05:09,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 646 transitions. [2023-08-30 03:05:09,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 646 transitions. [2023-08-30 03:05:09,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:09,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 646 transitions. [2023-08-30 03:05:09,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:09,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:09,925 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:09,925 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 68 flow. Second operand 7 states and 646 transitions. [2023-08-30 03:05:09,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 255 flow [2023-08-30 03:05:09,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 241 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 03:05:09,927 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 119 flow [2023-08-30 03:05:09,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-30 03:05:09,928 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-30 03:05:09,928 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 119 flow [2023-08-30 03:05:09,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:09,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:09,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:09,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:05:09,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:09,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1255121816, now seen corresponding path program 1 times [2023-08-30 03:05:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792088858] [2023-08-30 03:05:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:10,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792088858] [2023-08-30 03:05:10,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792088858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:10,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:10,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574721878] [2023-08-30 03:05:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:10,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:05:10,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:05:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:05:10,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 231 [2023-08-30 03:05:10,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 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-30 03:05:10,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:10,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 231 [2023-08-30 03:05:10,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:10,515 INFO L130 PetriNetUnfolder]: 613/956 cut-off events. [2023-08-30 03:05:10,515 INFO L131 PetriNetUnfolder]: For 758/758 co-relation queries the response was YES. [2023-08-30 03:05:10,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 956 events. 613/956 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4266 event pairs, 231 based on Foata normal form. 54/990 useless extension candidates. Maximal degree in co-relation 2360. Up to 892 conditions per place. [2023-08-30 03:05:10,520 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 26 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-30 03:05:10,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 191 flow [2023-08-30 03:05:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2023-08-30 03:05:10,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2023-08-30 03:05:10,523 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 473 transitions. [2023-08-30 03:05:10,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 473 transitions. [2023-08-30 03:05:10,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:10,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 473 transitions. [2023-08-30 03:05:10,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:10,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:10,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:10,527 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 119 flow. Second operand 5 states and 473 transitions. [2023-08-30 03:05:10,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 191 flow [2023-08-30 03:05:10,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 187 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:10,530 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 117 flow [2023-08-30 03:05:10,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-30 03:05:10,531 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-30 03:05:10,531 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 117 flow [2023-08-30 03:05:10,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 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-30 03:05:10,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:10,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:10,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:05:10,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:10,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:10,532 INFO L85 PathProgramCache]: Analyzing trace with hash -701412086, now seen corresponding path program 1 times [2023-08-30 03:05:10,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:10,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466852841] [2023-08-30 03:05:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:10,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466852841] [2023-08-30 03:05:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466852841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389686782] [2023-08-30 03:05:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:10,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:10,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:10,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 03:05:10,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:10,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:10,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 03:05:10,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:11,055 INFO L130 PetriNetUnfolder]: 1271/2057 cut-off events. [2023-08-30 03:05:11,056 INFO L131 PetriNetUnfolder]: For 746/746 co-relation queries the response was YES. [2023-08-30 03:05:11,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 2057 events. 1271/2057 cut-off events. For 746/746 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11208 event pairs, 321 based on Foata normal form. 72/2120 useless extension candidates. Maximal degree in co-relation 4707. Up to 765 conditions per place. [2023-08-30 03:05:11,065 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 34 selfloop transitions, 6 changer transitions 19/61 dead transitions. [2023-08-30 03:05:11,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 319 flow [2023-08-30 03:05:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-08-30 03:05:11,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47705627705627707 [2023-08-30 03:05:11,067 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-08-30 03:05:11,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-08-30 03:05:11,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:11,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-08-30 03:05:11,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:11,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:11,071 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:11,072 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 117 flow. Second operand 5 states and 551 transitions. [2023-08-30 03:05:11,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 319 flow [2023-08-30 03:05:11,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 310 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:05:11,075 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 153 flow [2023-08-30 03:05:11,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-30 03:05:11,075 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-30 03:05:11,075 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 153 flow [2023-08-30 03:05:11,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:11,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:11,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:11,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:05:11,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:11,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:11,079 INFO L85 PathProgramCache]: Analyzing trace with hash -285851190, now seen corresponding path program 1 times [2023-08-30 03:05:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246492536] [2023-08-30 03:05:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:11,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:11,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:11,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246492536] [2023-08-30 03:05:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246492536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:11,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:11,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:11,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229457421] [2023-08-30 03:05:11,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:11,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:11,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 03:05:11,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 153 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-30 03:05:11,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:11,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 03:05:11,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:11,639 INFO L130 PetriNetUnfolder]: 1220/1960 cut-off events. [2023-08-30 03:05:11,639 INFO L131 PetriNetUnfolder]: For 2346/2346 co-relation queries the response was YES. [2023-08-30 03:05:11,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 1960 events. 1220/1960 cut-off events. For 2346/2346 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10170 event pairs, 285 based on Foata normal form. 72/2032 useless extension candidates. Maximal degree in co-relation 4933. Up to 675 conditions per place. [2023-08-30 03:05:11,671 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 35 selfloop transitions, 6 changer transitions 19/61 dead transitions. [2023-08-30 03:05:11,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 352 flow [2023-08-30 03:05:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-30 03:05:11,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779220779220779 [2023-08-30 03:05:11,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-30 03:05:11,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-30 03:05:11,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:11,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-30 03:05:11,676 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-30 03:05:11,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:11,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:11,678 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 153 flow. Second operand 5 states and 552 transitions. [2023-08-30 03:05:11,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 352 flow [2023-08-30 03:05:11,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 328 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 03:05:11,685 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 155 flow [2023-08-30 03:05:11,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-30 03:05:11,688 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-30 03:05:11,688 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 155 flow [2023-08-30 03:05:11,688 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-30 03:05:11,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:11,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:11,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:05:11,689 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:11,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash -285900480, now seen corresponding path program 2 times [2023-08-30 03:05:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100761194] [2023-08-30 03:05:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:11,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100761194] [2023-08-30 03:05:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100761194] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:12,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040728092] [2023-08-30 03:05:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:12,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:05:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:12,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:05:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:05:12,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 231 [2023-08-30 03:05:12,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:12,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:12,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 231 [2023-08-30 03:05:12,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:12,558 INFO L130 PetriNetUnfolder]: 966/1571 cut-off events. [2023-08-30 03:05:12,559 INFO L131 PetriNetUnfolder]: For 2025/2035 co-relation queries the response was YES. [2023-08-30 03:05:12,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4129 conditions, 1571 events. 966/1571 cut-off events. For 2025/2035 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7462 event pairs, 255 based on Foata normal form. 8/1572 useless extension candidates. Maximal degree in co-relation 4116. Up to 1349 conditions per place. [2023-08-30 03:05:12,568 INFO L137 encePairwiseOnDemand]: 223/231 looper letters, 50 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-08-30 03:05:12,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 427 flow [2023-08-30 03:05:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-30 03:05:12,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2023-08-30 03:05:12,571 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-30 03:05:12,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-30 03:05:12,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:12,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-30 03:05:12,573 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-30 03:05:12,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:12,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:12,577 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 155 flow. Second operand 5 states and 553 transitions. [2023-08-30 03:05:12,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 427 flow [2023-08-30 03:05:12,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 403 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 03:05:12,583 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 220 flow [2023-08-30 03:05:12,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-30 03:05:12,584 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-30 03:05:12,584 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 220 flow [2023-08-30 03:05:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:12,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:12,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:12,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:05:12,585 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:12,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1985267902, now seen corresponding path program 3 times [2023-08-30 03:05:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95503492] [2023-08-30 03:05:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:12,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:12,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95503492] [2023-08-30 03:05:12,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95503492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:05:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373812256] [2023-08-30 03:05:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:12,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:12,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:12,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 03:05:12,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:12,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:12,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 03:05:12,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:13,086 INFO L130 PetriNetUnfolder]: 1380/2283 cut-off events. [2023-08-30 03:05:13,087 INFO L131 PetriNetUnfolder]: For 4442/4527 co-relation queries the response was YES. [2023-08-30 03:05:13,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6895 conditions, 2283 events. 1380/2283 cut-off events. For 4442/4527 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12186 event pairs, 512 based on Foata normal form. 112/2372 useless extension candidates. Maximal degree in co-relation 6880. Up to 1186 conditions per place. [2023-08-30 03:05:13,100 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 45 selfloop transitions, 7 changer transitions 6/62 dead transitions. [2023-08-30 03:05:13,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 428 flow [2023-08-30 03:05:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:05:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:05:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-30 03:05:13,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707792207792208 [2023-08-30 03:05:13,102 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-30 03:05:13,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-30 03:05:13,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:13,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-30 03:05:13,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,107 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 220 flow. Second operand 4 states and 435 transitions. [2023-08-30 03:05:13,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 428 flow [2023-08-30 03:05:13,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:05:13,112 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 244 flow [2023-08-30 03:05:13,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-30 03:05:13,113 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-30 03:05:13,114 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 244 flow [2023-08-30 03:05:13,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:13,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:13,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:05:13,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:13,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1213180562, now seen corresponding path program 4 times [2023-08-30 03:05:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:13,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399576409] [2023-08-30 03:05:13,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:13,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399576409] [2023-08-30 03:05:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399576409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:13,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664291249] [2023-08-30 03:05:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:13,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:05:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:05:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:05:13,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 231 [2023-08-30 03:05:13,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:13,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 231 [2023-08-30 03:05:13,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:13,770 INFO L130 PetriNetUnfolder]: 911/1474 cut-off events. [2023-08-30 03:05:13,770 INFO L131 PetriNetUnfolder]: For 3415/3452 co-relation queries the response was YES. [2023-08-30 03:05:13,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4917 conditions, 1474 events. 911/1474 cut-off events. For 3415/3452 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6842 event pairs, 289 based on Foata normal form. 17/1481 useless extension candidates. Maximal degree in co-relation 4900. Up to 1343 conditions per place. [2023-08-30 03:05:13,780 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 44 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2023-08-30 03:05:13,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 460 flow [2023-08-30 03:05:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:05:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:05:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 442 transitions. [2023-08-30 03:05:13,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47835497835497837 [2023-08-30 03:05:13,782 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 442 transitions. [2023-08-30 03:05:13,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 442 transitions. [2023-08-30 03:05:13,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:13,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 442 transitions. [2023-08-30 03:05:13,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,786 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,786 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 244 flow. Second operand 4 states and 442 transitions. [2023-08-30 03:05:13,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 460 flow [2023-08-30 03:05:13,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 429 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-30 03:05:13,791 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 293 flow [2023-08-30 03:05:13,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-30 03:05:13,791 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-30 03:05:13,791 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 293 flow [2023-08-30 03:05:13,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:13,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:13,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:05:13,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:13,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1804154708, now seen corresponding path program 1 times [2023-08-30 03:05:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:13,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021747941] [2023-08-30 03:05:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021747941] [2023-08-30 03:05:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021747941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:13,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:13,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749127447] [2023-08-30 03:05:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:13,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:13,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 03:05:13,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:13,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:13,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 03:05:13,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:14,222 INFO L130 PetriNetUnfolder]: 655/1162 cut-off events. [2023-08-30 03:05:14,222 INFO L131 PetriNetUnfolder]: For 2643/2676 co-relation queries the response was YES. [2023-08-30 03:05:14,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3882 conditions, 1162 events. 655/1162 cut-off events. For 2643/2676 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6009 event pairs, 131 based on Foata normal form. 138/1288 useless extension candidates. Maximal degree in co-relation 3865. Up to 669 conditions per place. [2023-08-30 03:05:14,237 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 55 selfloop transitions, 7 changer transitions 10/79 dead transitions. [2023-08-30 03:05:14,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 583 flow [2023-08-30 03:05:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2023-08-30 03:05:14,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47359307359307357 [2023-08-30 03:05:14,240 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2023-08-30 03:05:14,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2023-08-30 03:05:14,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:14,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2023-08-30 03:05:14,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,244 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,244 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 293 flow. Second operand 5 states and 547 transitions. [2023-08-30 03:05:14,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 583 flow [2023-08-30 03:05:14,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 564 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 03:05:14,250 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 288 flow [2023-08-30 03:05:14,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-08-30 03:05:14,251 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-08-30 03:05:14,251 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 288 flow [2023-08-30 03:05:14,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:14,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:14,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:05:14,252 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:14,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -711004541, now seen corresponding path program 1 times [2023-08-30 03:05:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551333344] [2023-08-30 03:05:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:14,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551333344] [2023-08-30 03:05:14,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551333344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:14,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:05:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375132985] [2023-08-30 03:05:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:14,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:05:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:05:14,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:05:14,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 03:05:14,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:14,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 03:05:14,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:14,724 INFO L130 PetriNetUnfolder]: 474/912 cut-off events. [2023-08-30 03:05:14,725 INFO L131 PetriNetUnfolder]: For 2049/2071 co-relation queries the response was YES. [2023-08-30 03:05:14,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3656 conditions, 912 events. 474/912 cut-off events. For 2049/2071 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4928 event pairs, 43 based on Foata normal form. 85/986 useless extension candidates. Maximal degree in co-relation 3636. Up to 339 conditions per place. [2023-08-30 03:05:14,730 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 61 selfloop transitions, 13 changer transitions 16/97 dead transitions. [2023-08-30 03:05:14,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 760 flow [2023-08-30 03:05:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:05:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:05:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2023-08-30 03:05:14,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47186147186147187 [2023-08-30 03:05:14,733 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 763 transitions. [2023-08-30 03:05:14,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 763 transitions. [2023-08-30 03:05:14,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:14,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 763 transitions. [2023-08-30 03:05:14,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,739 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 288 flow. Second operand 7 states and 763 transitions. [2023-08-30 03:05:14,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 760 flow [2023-08-30 03:05:14,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:05:14,744 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 372 flow [2023-08-30 03:05:14,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-08-30 03:05:14,745 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-08-30 03:05:14,745 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 372 flow [2023-08-30 03:05:14,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:14,746 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-30 03:05:14,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:05:14,746 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:14,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1834959498, now seen corresponding path program 1 times [2023-08-30 03:05:14,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:14,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122062999] [2023-08-30 03:05:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:14,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:05:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122062999] [2023-08-30 03:05:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122062999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:14,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:14,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:05:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872923756] [2023-08-30 03:05:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:14,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:05:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:05:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:05:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:05:14,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 03:05:14,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:14,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:14,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 03:05:14,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:15,227 INFO L130 PetriNetUnfolder]: 417/820 cut-off events. [2023-08-30 03:05:15,228 INFO L131 PetriNetUnfolder]: For 2289/2310 co-relation queries the response was YES. [2023-08-30 03:05:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 820 events. 417/820 cut-off events. For 2289/2310 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4482 event pairs, 38 based on Foata normal form. 32/841 useless extension candidates. Maximal degree in co-relation 3601. Up to 300 conditions per place. [2023-08-30 03:05:15,233 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 57 selfloop transitions, 17 changer transitions 15/96 dead transitions. [2023-08-30 03:05:15,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 812 flow [2023-08-30 03:05:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 03:05:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 03:05:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 961 transitions. [2023-08-30 03:05:15,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46224146224146223 [2023-08-30 03:05:15,237 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 961 transitions. [2023-08-30 03:05:15,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 961 transitions. [2023-08-30 03:05:15,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:15,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 961 transitions. [2023-08-30 03:05:15,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:15,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:15,243 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:15,243 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 372 flow. Second operand 9 states and 961 transitions. [2023-08-30 03:05:15,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 812 flow [2023-08-30 03:05:15,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 96 transitions, 750 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-08-30 03:05:15,265 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 369 flow [2023-08-30 03:05:15,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=369, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-08-30 03:05:15,265 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-08-30 03:05:15,266 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 369 flow [2023-08-30 03:05:15,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:15,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:15,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] [2023-08-30 03:05:15,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:05:15,267 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:15,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 696200661, now seen corresponding path program 1 times [2023-08-30 03:05:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:05:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596682036] [2023-08-30 03:05:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:05:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:05:15,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:05:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:05:15,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:05:15,382 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:05:15,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 03:05:15,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 03:05:15,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 03:05:15,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 03:05:15,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 03:05:15,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 03:05:15,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 03:05:15,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 03:05:15,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 03:05:15,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 03:05:15,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 03:05:15,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 03:05:15,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 03:05:15,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:05:15,388 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:15,394 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:05:15,394 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:05:15,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:05:15 BasicIcfg [2023-08-30 03:05:15,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:05:15,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:05:15,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:05:15,470 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:05:15,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:00" (3/4) ... [2023-08-30 03:05:15,473 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:05:15,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:05:15,473 INFO L158 Benchmark]: Toolchain (without parser) took 15919.02ms. Allocated memory was 71.3MB in the beginning and 348.1MB in the end (delta: 276.8MB). Free memory was 39.0MB in the beginning and 252.2MB in the end (delta: -213.2MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2023-08-30 03:05:15,474 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:05:15,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.18ms. Allocated memory is still 71.3MB. Free memory was 38.8MB in the beginning and 32.6MB in the end (delta: 6.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-08-30 03:05:15,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.02ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 29.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:05:15,474 INFO L158 Benchmark]: Boogie Preprocessor took 62.26ms. Allocated memory is still 71.3MB. Free memory was 29.9MB in the beginning and 49.5MB in the end (delta: -19.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:05:15,475 INFO L158 Benchmark]: RCFGBuilder took 734.82ms. Allocated memory is still 71.3MB. Free memory was 49.5MB in the beginning and 32.2MB in the end (delta: 17.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2023-08-30 03:05:15,475 INFO L158 Benchmark]: TraceAbstraction took 14566.00ms. Allocated memory was 71.3MB in the beginning and 348.1MB in the end (delta: 276.8MB). Free memory was 31.4MB in the beginning and 252.2MB in the end (delta: -220.8MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2023-08-30 03:05:15,475 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 348.1MB. Free memory is still 252.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:05:15,477 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 54.5MB. Free memory was 32.2MB in the beginning and 32.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.18ms. Allocated memory is still 71.3MB. Free memory was 38.8MB in the beginning and 32.6MB in the end (delta: 6.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.02ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 29.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.26ms. Allocated memory is still 71.3MB. Free memory was 29.9MB in the beginning and 49.5MB in the end (delta: -19.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 734.82ms. Allocated memory is still 71.3MB. Free memory was 49.5MB in the beginning and 32.2MB in the end (delta: 17.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14566.00ms. Allocated memory was 71.3MB in the beginning and 348.1MB in the end (delta: 276.8MB). Free memory was 31.4MB in the beginning and 252.2MB in the end (delta: -220.8MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 348.1MB. Free memory is still 252.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: 5.3s, 122 PlacesBefore, 40 PlacesAfterwards, 114 TransitionsBefore, 30 TransitionsAfterwards, 2126 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 TotalNumberOfCompositions, 5516 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2789, independent: 2629, independent conditional: 0, independent unconditional: 2629, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1143, independent: 1096, independent conditional: 0, independent unconditional: 1096, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2789, independent: 1533, independent conditional: 0, independent unconditional: 1533, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 1143, unknown conditional: 0, unknown unconditional: 1143] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-3, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-2, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t1878, ((void *)0), P2, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] 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_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: 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, 144 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: 14.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 675 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 458 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1842 IncrementalHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 118 mSDtfsCounter, 1842 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=13, InterpolantAutomatonStates: 69, 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, 3.5s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:05:15,498 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/safe004_power.opt_pso.opt_rmo.opt.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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:05:17,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:05:17,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:05:17,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:05:17,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:05:17,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:05:17,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:05:17,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:05:17,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:05:17,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:05:17,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:05:17,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:05:17,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:05:17,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:05:17,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:05:17,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:05:17,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:05:17,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:05:17,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:05:17,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:05:17,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:05:17,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:05:17,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:05:17,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:05:17,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:05:17,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:05:17,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:05:17,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:05:17,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:05:17,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:05:17,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:05:17,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:05:17,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:05:17,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:05:17,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:05:17,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:05:17,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:05:17,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:05:17,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:05:17,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:05:17,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:05:17,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:05:17,531 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:05:17,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:05:17,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:05:17,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:05:17,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:05:17,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:05:17,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:05:17,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:05:17,535 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:05:17,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:05:17,536 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:05:17,537 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:05:17,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:05:17,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:05:17,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:05:17,537 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:05:17,537 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:05:17,538 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:05:17,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:05:17,538 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:05:17,538 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:05:17,538 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:05:17,539 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:05:17,539 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:05:17,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:05:17,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:05:17,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:05:17,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:05:17,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:05:17,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:05:17,540 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:05:17,540 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:05:17,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:05:17,541 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:05:17,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:05:17,541 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:05:17,541 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:05:17,542 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:05:17,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:05:17,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:05:17,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:05:17,896 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:05:17,896 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:05:17,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-30 03:05:19,114 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:05:19,391 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:05:19,392 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-30 03:05:19,402 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a08d5258/0926a46a9f874f0b91c8cb87d127a651/FLAGb4a578d0a [2023-08-30 03:05:19,416 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a08d5258/0926a46a9f874f0b91c8cb87d127a651 [2023-08-30 03:05:19,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:05:19,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:05:19,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:05:19,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:05:19,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:05:19,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:19,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee038d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19, skipping insertion in model container [2023-08-30 03:05:19,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:19,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:05:19,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:05:19,647 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 03:05:19,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:05:19,836 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:05:19,848 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 03:05:19,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:05:19,953 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:05:19,954 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:05:19,959 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:05:19,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19 WrapperNode [2023-08-30 03:05:19,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:05:19,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:05:19,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:05:19,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:05:19,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:19,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,008 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 03:05:20,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:05:20,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:05:20,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:05:20,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:05:20,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:05:20,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:05:20,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:05:20,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:05:20,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (1/1) ... [2023-08-30 03:05:20,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:05:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:05:20,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:05:20,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:05:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:05:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:05:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:05:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:05:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:05:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:05:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:05:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:05:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:05:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:05:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:05:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:05:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:05:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:05:20,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:05:20,111 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:05:20,318 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:05:20,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:05:20,585 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:05:20,702 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:05:20,702 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:05:20,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:20 BoogieIcfgContainer [2023-08-30 03:05:20,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:05:20,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:05:20,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:05:20,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:05:20,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:05:19" (1/3) ... [2023-08-30 03:05:20,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9b2afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:05:20, skipping insertion in model container [2023-08-30 03:05:20,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:05:19" (2/3) ... [2023-08-30 03:05:20,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9b2afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:05:20, skipping insertion in model container [2023-08-30 03:05:20,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:20" (3/3) ... [2023-08-30 03:05:20,712 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2023-08-30 03:05:20,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:05:20,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 03:05:20,727 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:05:20,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:05:20,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-30 03:05:20,867 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-30 03:05:20,867 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:20,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:05:20,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-30 03:05:20,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-30 03:05:20,878 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:05:20,889 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-30 03:05:20,893 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-30 03:05:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-30 03:05:20,928 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-30 03:05:20,928 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:20,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:05:20,932 INFO L119 LiptonReduction]: Number of co-enabled transitions 2126 [2023-08-30 03:05:27,545 INFO L134 LiptonReduction]: Checked pairs total: 6070 [2023-08-30 03:05:27,546 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-30 03:05:27,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:05:27,562 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;@119a913a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:05:27,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 03:05:27,564 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 03:05:27,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:27,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:27,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:05:27,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:27,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash 520, now seen corresponding path program 1 times [2023-08-30 03:05:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937273485] [2023-08-30 03:05:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:27,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:27,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:27,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:27,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:05:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:27,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:05:27,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:27,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:27,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937273485] [2023-08-30 03:05:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937273485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:05:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677516083] [2023-08-30 03:05:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:27,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:05:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:05:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:05:27,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-30 03:05:27,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:27,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:27,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-30 03:05:27,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:28,165 INFO L130 PetriNetUnfolder]: 1093/1646 cut-off events. [2023-08-30 03:05:28,166 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 03:05:28,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1646 events. 1093/1646 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7706 event pairs, 1093 based on Foata normal form. 0/1362 useless extension candidates. Maximal degree in co-relation 3312. Up to 1623 conditions per place. [2023-08-30 03:05:28,177 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-30 03:05:28,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-08-30 03:05:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:05:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:05:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions. [2023-08-30 03:05:28,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085836909871244 [2023-08-30 03:05:28,192 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 237 transitions. [2023-08-30 03:05:28,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions. [2023-08-30 03:05:28,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:28,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions. [2023-08-30 03:05:28,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,207 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,209 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 237 transitions. [2023-08-30 03:05:28,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-08-30 03:05:28,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:05:28,215 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-30 03:05:28,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-30 03:05:28,220 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-30 03:05:28,221 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-30 03:05:28,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:28,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 03:05:28,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-30 03:05:28,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:28,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:28,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash 490793754, now seen corresponding path program 1 times [2023-08-30 03:05:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247289706] [2023-08-30 03:05:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:28,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:28,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:28,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:05:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:28,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:05:28,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:28,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:28,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:28,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247289706] [2023-08-30 03:05:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247289706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:28,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:05:28,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289638550] [2023-08-30 03:05:28,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:28,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:05:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:05:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:05:28,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-30 03:05:28,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:28,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-30 03:05:28,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:28,815 INFO L130 PetriNetUnfolder]: 855/1342 cut-off events. [2023-08-30 03:05:28,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:05:28,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 1342 events. 855/1342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6356 event pairs, 237 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 2664. Up to 1027 conditions per place. [2023-08-30 03:05:28,821 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-30 03:05:28,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 146 flow [2023-08-30 03:05:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:05:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:05:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-30 03:05:28,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4949928469241774 [2023-08-30 03:05:28,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-30 03:05:28,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-30 03:05:28,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:28,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-30 03:05:28,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,829 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 346 transitions. [2023-08-30 03:05:28,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 146 flow [2023-08-30 03:05:28,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:05:28,830 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-30 03:05:28,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 03:05:28,831 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-30 03:05:28,831 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-30 03:05:28,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:28,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:28,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:28,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:29,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:29,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:29,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:29,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1900126005, now seen corresponding path program 1 times [2023-08-30 03:05:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564528506] [2023-08-30 03:05:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:29,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:29,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:29,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:29,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:05:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:29,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:05:29,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:29,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:29,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:29,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564528506] [2023-08-30 03:05:29,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564528506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:29,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:29,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689390194] [2023-08-30 03:05:29,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:29,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:29,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:29,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:29,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:29,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:29,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:29,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:29,388 INFO L130 PetriNetUnfolder]: 494/828 cut-off events. [2023-08-30 03:05:29,388 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2023-08-30 03:05:29,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 828 events. 494/828 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3854 event pairs, 102 based on Foata normal form. 64/851 useless extension candidates. Maximal degree in co-relation 1750. Up to 533 conditions per place. [2023-08-30 03:05:29,392 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 28 selfloop transitions, 4 changer transitions 19/54 dead transitions. [2023-08-30 03:05:29,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 230 flow [2023-08-30 03:05:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-30 03:05:29,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47467811158798284 [2023-08-30 03:05:29,395 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-30 03:05:29,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-30 03:05:29,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:29,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-30 03:05:29,397 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-30 03:05:29,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,400 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,400 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 553 transitions. [2023-08-30 03:05:29,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 230 flow [2023-08-30 03:05:29,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:29,402 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-08-30 03:05:29,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-30 03:05:29,403 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-30 03:05:29,403 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-08-30 03:05:29,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:29,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:29,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-30 03:05:29,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:29,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:29,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1933636071, now seen corresponding path program 1 times [2023-08-30 03:05:29,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:29,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512475673] [2023-08-30 03:05:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:29,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:29,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:05:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:29,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:05:29,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:29,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:29,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:29,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512475673] [2023-08-30 03:05:29,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512475673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:29,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:05:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342722803] [2023-08-30 03:05:29,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:29,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:05:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:05:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:05:29,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:29,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:29,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:29,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:29,982 INFO L130 PetriNetUnfolder]: 224/423 cut-off events. [2023-08-30 03:05:29,982 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2023-08-30 03:05:29,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 423 events. 224/423 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1814 event pairs, 60 based on Foata normal form. 37/446 useless extension candidates. Maximal degree in co-relation 1127. Up to 137 conditions per place. [2023-08-30 03:05:29,985 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 36 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2023-08-30 03:05:29,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 334 flow [2023-08-30 03:05:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:05:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:05:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 664 transitions. [2023-08-30 03:05:29,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474964234620887 [2023-08-30 03:05:29,988 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 664 transitions. [2023-08-30 03:05:29,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 664 transitions. [2023-08-30 03:05:29,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:29,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 664 transitions. [2023-08-30 03:05:29,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,993 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,993 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 664 transitions. [2023-08-30 03:05:29,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 334 flow [2023-08-30 03:05:29,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:29,996 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2023-08-30 03:05:29,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 03:05:29,997 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-30 03:05:29,998 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2023-08-30 03:05:29,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:29,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:29,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:30,009 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-30 03:05:30,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:30,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:30,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1206407363, now seen corresponding path program 1 times [2023-08-30 03:05:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735806959] [2023-08-30 03:05:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:30,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:30,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:30,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:05:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:30,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:05:30,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:30,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-30 03:05:30,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:30,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735806959] [2023-08-30 03:05:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735806959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:30,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:05:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108481534] [2023-08-30 03:05:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:30,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:05:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:30,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:05:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:05:30,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:30,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:30,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:30,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:30,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:30,598 INFO L130 PetriNetUnfolder]: 143/279 cut-off events. [2023-08-30 03:05:30,598 INFO L131 PetriNetUnfolder]: For 260/260 co-relation queries the response was YES. [2023-08-30 03:05:30,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 279 events. 143/279 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1080 event pairs, 56 based on Foata normal form. 10/284 useless extension candidates. Maximal degree in co-relation 802. Up to 108 conditions per place. [2023-08-30 03:05:30,600 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 33 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2023-08-30 03:05:30,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 332 flow [2023-08-30 03:05:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:05:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:05:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 755 transitions. [2023-08-30 03:05:30,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46290619251992643 [2023-08-30 03:05:30,603 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 755 transitions. [2023-08-30 03:05:30,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 755 transitions. [2023-08-30 03:05:30,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:30,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 755 transitions. [2023-08-30 03:05:30,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:30,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:30,608 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:30,608 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 755 transitions. [2023-08-30 03:05:30,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 332 flow [2023-08-30 03:05:30,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 296 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-30 03:05:30,612 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2023-08-30 03:05:30,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-30 03:05:30,612 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-30 03:05:30,613 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2023-08-30 03:05:30,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:30,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:30,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:30,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:30,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:30,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:30,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1091846192, now seen corresponding path program 1 times [2023-08-30 03:05:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:30,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709015723] [2023-08-30 03:05:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:30,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:30,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:30,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:30,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:05:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:30,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:05:30,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:30,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:30,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709015723] [2023-08-30 03:05:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709015723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:05:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841974774] [2023-08-30 03:05:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:30,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:05:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:05:30,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:05:30,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 233 [2023-08-30 03:05:30,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:30,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:30,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 233 [2023-08-30 03:05:30,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:31,076 INFO L130 PetriNetUnfolder]: 236/453 cut-off events. [2023-08-30 03:05:31,076 INFO L131 PetriNetUnfolder]: For 482/482 co-relation queries the response was YES. [2023-08-30 03:05:31,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 453 events. 236/453 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2048 event pairs, 98 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 1294. Up to 256 conditions per place. [2023-08-30 03:05:31,079 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 43 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-30 03:05:31,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 340 flow [2023-08-30 03:05:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:05:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:05:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-30 03:05:31,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864091559370529 [2023-08-30 03:05:31,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-30 03:05:31,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-30 03:05:31,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:31,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-30 03:05:31,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:31,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:31,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:31,084 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 3 states and 340 transitions. [2023-08-30 03:05:31,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 340 flow [2023-08-30 03:05:31,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 266 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-30 03:05:31,087 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 112 flow [2023-08-30 03:05:31,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 03:05:31,088 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-30 03:05:31,088 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 112 flow [2023-08-30 03:05:31,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:31,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:31,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:31,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:31,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:31,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:31,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1567204680, now seen corresponding path program 1 times [2023-08-30 03:05:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554499635] [2023-08-30 03:05:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:05:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:31,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:31,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:05:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:05:31,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 03:05:31,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:31,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:31,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:31,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554499635] [2023-08-30 03:05:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554499635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:31,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309415697] [2023-08-30 03:05:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:31,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:05:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:31,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:05:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:05:31,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 233 [2023-08-30 03:05:31,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:31,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:31,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 233 [2023-08-30 03:05:31,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:32,153 INFO L130 PetriNetUnfolder]: 204/388 cut-off events. [2023-08-30 03:05:32,154 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2023-08-30 03:05:32,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 388 events. 204/388 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1686 event pairs, 68 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1094. Up to 315 conditions per place. [2023-08-30 03:05:32,156 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 29 selfloop transitions, 3 changer transitions 5/40 dead transitions. [2023-08-30 03:05:32,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 235 flow [2023-08-30 03:05:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2023-08-30 03:05:32,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40600858369098713 [2023-08-30 03:05:32,158 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 473 transitions. [2023-08-30 03:05:32,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 473 transitions. [2023-08-30 03:05:32,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:32,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 473 transitions. [2023-08-30 03:05:32,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,162 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,162 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 112 flow. Second operand 5 states and 473 transitions. [2023-08-30 03:05:32,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 235 flow [2023-08-30 03:05:32,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:05:32,164 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 110 flow [2023-08-30 03:05:32,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=110, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 03:05:32,165 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-30 03:05:32,165 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 110 flow [2023-08-30 03:05:32,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:32,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:32,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:32,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:32,377 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:32,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:32,377 INFO L85 PathProgramCache]: Analyzing trace with hash 682067418, now seen corresponding path program 2 times [2023-08-30 03:05:32,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:32,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256728748] [2023-08-30 03:05:32,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:05:32,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:32,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:32,379 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-30 03:05:32,381 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-30 03:05:32,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:05:32,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:05:32,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:05:32,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:32,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:32,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256728748] [2023-08-30 03:05:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256728748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:32,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422062933] [2023-08-30 03:05:32,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:32,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:32,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:32,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:32,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:32,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:32,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:32,648 INFO L130 PetriNetUnfolder]: 128/278 cut-off events. [2023-08-30 03:05:32,648 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2023-08-30 03:05:32,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 278 events. 128/278 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1187 event pairs, 19 based on Foata normal form. 1/278 useless extension candidates. Maximal degree in co-relation 765. Up to 129 conditions per place. [2023-08-30 03:05:32,650 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 30 selfloop transitions, 1 changer transitions 17/50 dead transitions. [2023-08-30 03:05:32,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 308 flow [2023-08-30 03:05:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:05:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:05:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-30 03:05:32,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4667381974248927 [2023-08-30 03:05:32,653 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-30 03:05:32,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-30 03:05:32,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:32,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-30 03:05:32,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,663 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,663 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 110 flow. Second operand 4 states and 435 transitions. [2023-08-30 03:05:32,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 308 flow [2023-08-30 03:05:32,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 296 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-30 03:05:32,665 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 106 flow [2023-08-30 03:05:32,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-30 03:05:32,666 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-30 03:05:32,666 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 106 flow [2023-08-30 03:05:32,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:32,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:32,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:32,678 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-30 03:05:32,876 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-30 03:05:32,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:32,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash 882443164, now seen corresponding path program 3 times [2023-08-30 03:05:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:32,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293967061] [2023-08-30 03:05:32,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:05:32,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:32,879 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-30 03:05:32,881 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-30 03:05:32,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:05:32,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:05:32,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 03:05:32,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:33,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:33,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293967061] [2023-08-30 03:05:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293967061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:33,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:05:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873309906] [2023-08-30 03:05:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:33,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:05:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:05:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:05:33,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:33,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 106 flow. Second operand has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:33,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:33,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:33,504 INFO L130 PetriNetUnfolder]: 141/287 cut-off events. [2023-08-30 03:05:33,504 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2023-08-30 03:05:33,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 287 events. 141/287 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1165 event pairs, 29 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 865. Up to 156 conditions per place. [2023-08-30 03:05:33,506 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 37 selfloop transitions, 5 changer transitions 9/53 dead transitions. [2023-08-30 03:05:33,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 323 flow [2023-08-30 03:05:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-30 03:05:33,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46180257510729616 [2023-08-30 03:05:33,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-30 03:05:33,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-30 03:05:33,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:33,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-30 03:05:33,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,512 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 106 flow. Second operand 5 states and 538 transitions. [2023-08-30 03:05:33,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 323 flow [2023-08-30 03:05:33,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 319 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:33,514 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 130 flow [2023-08-30 03:05:33,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-08-30 03:05:33,515 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-30 03:05:33,515 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 130 flow [2023-08-30 03:05:33,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:33,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:33,527 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-30 03:05:33,725 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-30 03:05:33,725 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:33,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash 728161174, now seen corresponding path program 4 times [2023-08-30 03:05:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:33,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810890668] [2023-08-30 03:05:33,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:05:33,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:33,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:33,726 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:33,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 03:05:33,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:05:33,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:05:33,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:05:33,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:33,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:33,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:33,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810890668] [2023-08-30 03:05:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810890668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:33,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:05:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463851753] [2023-08-30 03:05:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:33,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:33,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:33,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:33,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:33,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:33,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:33,983 INFO L130 PetriNetUnfolder]: 189/398 cut-off events. [2023-08-30 03:05:33,983 INFO L131 PetriNetUnfolder]: For 451/451 co-relation queries the response was YES. [2023-08-30 03:05:33,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 398 events. 189/398 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1864 event pairs, 61 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1308. Up to 234 conditions per place. [2023-08-30 03:05:33,985 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 27 selfloop transitions, 3 changer transitions 17/50 dead transitions. [2023-08-30 03:05:33,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 324 flow [2023-08-30 03:05:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:05:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:05:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-08-30 03:05:33,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656652360515021 [2023-08-30 03:05:33,987 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-08-30 03:05:33,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-08-30 03:05:33,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:33,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-08-30 03:05:33,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,991 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 130 flow. Second operand 4 states and 434 transitions. [2023-08-30 03:05:33,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 324 flow [2023-08-30 03:05:33,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:33,996 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 137 flow [2023-08-30 03:05:33,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-08-30 03:05:33,997 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-30 03:05:33,998 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 137 flow [2023-08-30 03:05:33,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:33,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:33,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:34,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:34,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:34,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1572991628, now seen corresponding path program 5 times [2023-08-30 03:05:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:34,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108036205] [2023-08-30 03:05:34,209 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 03:05:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:34,210 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:34,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 03:05:34,296 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:05:34,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:05:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:05:34,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:34,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:34,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108036205] [2023-08-30 03:05:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108036205] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:34,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:05:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507191549] [2023-08-30 03:05:34,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:34,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:05:34,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:05:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:05:34,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:34,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:34,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:34,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:34,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:34,460 INFO L130 PetriNetUnfolder]: 196/408 cut-off events. [2023-08-30 03:05:34,460 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2023-08-30 03:05:34,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 408 events. 196/408 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1840 event pairs, 38 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 1335. Up to 228 conditions per place. [2023-08-30 03:05:34,462 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 30 selfloop transitions, 1 changer transitions 20/53 dead transitions. [2023-08-30 03:05:34,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 354 flow [2023-08-30 03:05:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:05:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:05:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-30 03:05:34,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678111587982833 [2023-08-30 03:05:34,464 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-30 03:05:34,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-30 03:05:34,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:34,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-30 03:05:34,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:34,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:34,468 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:34,468 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 137 flow. Second operand 4 states and 436 transitions. [2023-08-30 03:05:34,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 354 flow [2023-08-30 03:05:34,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 346 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-30 03:05:34,471 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 136 flow [2023-08-30 03:05:34,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-08-30 03:05:34,472 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-30 03:05:34,472 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 136 flow [2023-08-30 03:05:34,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:34,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:34,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:34,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:34,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:34,683 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:34,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1186523016, now seen corresponding path program 6 times [2023-08-30 03:05:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439975190] [2023-08-30 03:05:34,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 03:05:34,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:34,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:34,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:34,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 03:05:34,775 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 03:05:34,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:05:34,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 03:05:34,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:05:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:05:35,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:05:35,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:05:35,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439975190] [2023-08-30 03:05:35,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439975190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:05:35,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:05:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:05:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622836937] [2023-08-30 03:05:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:05:35,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:05:35,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:05:35,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:05:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:05:35,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 03:05:35,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 136 flow. Second operand has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:35,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:05:35,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 03:05:35,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:05:35,364 INFO L130 PetriNetUnfolder]: 155/328 cut-off events. [2023-08-30 03:05:35,364 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-08-30 03:05:35,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 328 events. 155/328 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1384 event pairs, 38 based on Foata normal form. 1/328 useless extension candidates. Maximal degree in co-relation 1130. Up to 161 conditions per place. [2023-08-30 03:05:35,366 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 30 selfloop transitions, 3 changer transitions 18/53 dead transitions. [2023-08-30 03:05:35,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 354 flow [2023-08-30 03:05:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:05:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:05:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-30 03:05:35,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46180257510729616 [2023-08-30 03:05:35,368 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-30 03:05:35,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-30 03:05:35,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:05:35,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-30 03:05:35,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:35,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:35,372 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:35,372 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 136 flow. Second operand 5 states and 538 transitions. [2023-08-30 03:05:35,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 354 flow [2023-08-30 03:05:35,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:05:35,374 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 129 flow [2023-08-30 03:05:35,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2023-08-30 03:05:35,375 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-30 03:05:35,375 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 129 flow [2023-08-30 03:05:35,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:05:35,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:05:35,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:35,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:35,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:35,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:05:35,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:05:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1276224896, now seen corresponding path program 7 times [2023-08-30 03:05:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:05:35,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091643641] [2023-08-30 03:05:35,588 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 03:05:35,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:35,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:05:35,589 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:05:35,592 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 (14)] Waiting until timeout for monitored process [2023-08-30 03:05:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:05:35,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:05:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:05:35,793 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:05:35,794 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:05:35,794 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 03:05:35,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 03:05:35,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 03:05:35,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 03:05:35,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 03:05:35,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 03:05:35,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 03:05:35,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 03:05:35,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 03:05:35,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 03:05:35,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 03:05:35,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 03:05:35,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 03:05:35,811 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 (14)] Forceful destruction successful, exit code 0 [2023-08-30 03:05:36,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:05:36,012 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2023-08-30 03:05:36,016 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:05:36,016 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:05:36,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:05:36 BasicIcfg [2023-08-30 03:05:36,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:05:36,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:05:36,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:05:36,069 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:05:36,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:05:20" (3/4) ... [2023-08-30 03:05:36,071 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:05:36,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:05:36,071 INFO L158 Benchmark]: Toolchain (without parser) took 16652.19ms. Allocated memory was 75.5MB in the beginning and 130.0MB in the end (delta: 54.5MB). Free memory was 55.7MB in the beginning and 70.6MB in the end (delta: -14.9MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2023-08-30 03:05:36,072 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:05:36,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.51ms. Allocated memory is still 75.5MB. Free memory was 55.7MB in the beginning and 31.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-30 03:05:36,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.67ms. Allocated memory is still 75.5MB. Free memory was 31.8MB in the beginning and 29.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:05:36,072 INFO L158 Benchmark]: Boogie Preprocessor took 39.43ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 29.0MB in the beginning and 85.7MB in the end (delta: -56.7MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-08-30 03:05:36,073 INFO L158 Benchmark]: RCFGBuilder took 655.57ms. Allocated memory is still 107.0MB. Free memory was 85.7MB in the beginning and 78.4MB in the end (delta: 7.3MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2023-08-30 03:05:36,073 INFO L158 Benchmark]: TraceAbstraction took 15361.26ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 77.7MB in the beginning and 70.6MB in the end (delta: 7.1MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2023-08-30 03:05:36,073 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 130.0MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:05:36,074 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.51ms. Allocated memory is still 75.5MB. Free memory was 55.7MB in the beginning and 31.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.67ms. Allocated memory is still 75.5MB. Free memory was 31.8MB in the beginning and 29.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.43ms. Allocated memory was 75.5MB in the beginning and 107.0MB in the end (delta: 31.5MB). Free memory was 29.0MB in the beginning and 85.7MB in the end (delta: -56.7MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 655.57ms. Allocated memory is still 107.0MB. Free memory was 85.7MB in the beginning and 78.4MB in the end (delta: 7.3MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15361.26ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 77.7MB in the beginning and 70.6MB in the end (delta: 7.1MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 130.0MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 123 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 30 TransitionsAfterwards, 2126 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 6070 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2926, independent: 2738, independent conditional: 0, independent unconditional: 2738, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1157, independent: 1116, independent conditional: 0, independent unconditional: 1116, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2926, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1157, unknown conditional: 0, unknown unconditional: 1157] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=0, t1876={-6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=1, t1876={-6:0}, t1877={-10:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t1878, ((void *)0), P2, ((void *)0))=2, t1876={-6:0}, t1877={-10:0}, t1878={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={-6:0}, t1877={-10:0}, t1878={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] 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_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: 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, 145 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: 15.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1349 IncrementalHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 66 mSDtfsCounter, 1349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 180 ConstructedInterpolants, 13 QuantifiedInterpolants, 1661 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1607 ConjunctsInSsa, 99 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-30 03:05:36,092 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